65 research outputs found
An on-line equivalent system identification scheme for adaptive control
A prime obstacle to the widespread use of adaptive control is the degradation of performance and possible instability resulting from the presence of unmodeled dynamics. The approach taken is to explicitly include the unstructured model uncertainty in the output error identification algorithm. The order of the compensator is successively increased by including identified modes. During this model building stage, heuristic rules are used to test for convergence prior to designing compensators. Additionally, the recursive identification algorithm as extended to multi-input, multi-output systems. Enhancements were also made to reduce the computational burden of an algorithm for obtaining minimal state space realizations from the inexact, multivariate transfer functions which result from the identification process. A number of potential adaptive control applications for this approach are illustrated using computer simulations. Results indicated that when speed of adaptation and plant stability are not critical, the proposed schemes converge to enhance system performance
Geometric Structure Extraction and Reconstruction
Geometric structure extraction and reconstruction is a long-standing problem in research communities including computer graphics, computer vision, and machine learning. Within different communities, it can be interpreted as different subproblems such as skeleton extraction from the point cloud, surface reconstruction from multi-view images, or manifold learning from high dimensional data. All these subproblems are building blocks of many modern applications, such as scene reconstruction for AR/VR, object recognition for robotic vision and structural analysis for big data. Despite its importance, the extraction and reconstruction of a geometric structure from real-world data are ill-posed, where the main challenges lie in the incompleteness, noise, and inconsistency of the raw input data. To address these challenges, three studies are conducted in this thesis: i) a new point set representation for shape completion, ii) a structure-aware data consolidation method, and iii) a data-driven deep learning technique for multi-view consistency. In addition to theoretical contributions, the algorithms we proposed significantly improve the performance of several state-of-the-art geometric structure extraction and reconstruction approaches, validated by extensive experimental results
Multilevel Motion Planning: A Fiber Bundle Formulation
Motion planning problems involving high-dimensional state spaces can often be
solved significantly faster by using multilevel abstractions. While there are
various ways to formally capture multilevel abstractions, we formulate them in
terms of fiber bundles, which allows us to concisely describe and derive novel
algorithms in terms of bundle restrictions and bundle sections. Fiber bundles
essentially describe lower-dimensional projections of the state space using
local product spaces. Given such a structure and a corresponding admissible
constraint function, we can develop highly efficient and optimal search-based
motion planning methods for high-dimensional state spaces. Our contributions
are the following: We first introduce the terminology of fiber bundles, in
particular the notion of restrictions and sections. Second, we use the notion
of restrictions and sections to develop novel multilevel motion planning
algorithms, which we call QRRT* and QMP*. We show these algorithms to be
probabilistically complete and almost-surely asymptotically optimal. Third, we
develop a novel recursive path section method based on an L1 interpolation over
path restrictions, which we use to quickly find feasible path sections. And
fourth, we evaluate all novel algorithms against all available OMPL algorithms
on benchmarks of eight challenging environments ranging from 21 to 100 degrees
of freedom, including multiple robots and nonholonomic constraints. Our
findings support the efficiency of our novel algorithms and the benefit of
exploiting multilevel abstractions using the terminology of fiber bundles.Comment: Submitted to IJR
Development and applications of adaptive IIR and subband filters
Adaptive infinite impulse response (IIR) filter is a challenging research area. Identifiers and Equalizers are among the most essential digital signal processing devices for digital communication systems. In this study, we consider IIR channel both for system identification and channel equalization purposes. We focus on four different approaches: Least Mean Square (LMS), Recursive Least Square (RLS), Genetic Algorithm (GA) and Subband Adaptive Filter (SAF). ). The performance of conventional LMS and RLS based IIR system identification and channel equalization are found with the help of computer simulations. And also the convergence speed and the ability to locate the global optimum solution using a population based algorithm named Genetic Algorithm is given
Scales and Scale-like Structures
Scales are a visually striking feature that grows on many animals. These small, rigid plates embedded in the skin form an integral part of our description of fish and reptiles, some plants, and many extinct animals. Scales exist in many shapes and sizes, and serve as protection, camouflage, and plumage for animals. The variety of scales and the animals they grow from pose an interesting problem in the field of Computer Graphics.
This dissertation presents a method for generating scales and scale-like structures on a polygonal mesh through surface replacement. A triangular mesh was covered with scales and one or more proxy-models were used as the scales shape. A user began scale generation by drawing a lateral line on the model to control the distribution and orientation of scales on the surface. Next, a vector field was created over the surface to control an anisotropic Voronoi tessellation, which represents the region occupied by each scale. Then these regions were replaced by cutting the proxy model to match the boundary of the Voronoi region and deform the cut model onto the surface. The final result is a fully connected 2-manifold that is suitable for subsequent post-processing applications, like surface subdivision
Controlling NMR spin systems for quantum computation
Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols
Real-Time Multi-Fisheye Camera Self-Localization and Egomotion Estimation in Complex Indoor Environments
In this work a real-time capable multi-fisheye camera self-localization and egomotion estimation framework is developed. The thesis covers all aspects ranging from omnidirectional camera calibration to the development of a complete multi-fisheye camera SLAM system based on a generic multi-camera bundle adjustment method
- …