› › Probabilistic Modeling For Sensor Fusion With Inertial Measurements

Probabilistic modeling for sensor fusion with inertial measurements

Author : Manon Kok

Publisher : Linköping University Electronic Press

Page : 73 pages

File Size : 22,51 MB

Release : 2016-12-15

Category :

ISBN : 9176856216

Get eBook

Book Description

In recent years, inertial sensors have undergone major developments. The quality of their measurements has improved while their cost has decreased, leading to an increase in availability. They can be found in stand-alone sensor units, so-called inertial measurement units, but are nowadays also present in for instance any modern smartphone, in Wii controllers and in virtual reality headsets. The term inertial sensor refers to the combination of accelerometers and gyroscopes. These measure the external specific force and the angular velocity, respectively. Integration of their measurements provides information about the sensor's position and orientation. However, the position and orientation estimates obtained by simple integration suffer from drift and are therefore only accurate on a short time scale. In order to improve these estimates, we combine the inertial sensors with additional sensors and models. To combine these different sources of information, also called sensor fusion, we make use of probabilistic models to take the uncertainty of the different sources of information into account. The first contribution of this thesis is a tutorial paper that describes the signal processing foundations underlying position and orientation estimation using inertial sensors. In a second contribution, we use data from multiple inertial sensors placed on the human body to estimate the body's pose. A biomechanical model encodes the knowledge about how the different body segments are connected to each other. We also show how the structure inherent to this problem can be exploited. This opens up for processing long data sets and for solving the problem in a distributed manner. Inertial sensors can also be combined with time of arrival measurements from an ultrawideband (UWB) system. We focus both on calibration of the UWB setup and on sensor fusion of the inertial and UWB measurements. The UWB measurements are modeled by a tailored heavy-tailed asymmetric distribution. This distribution naturally handles the possibility of measurement delays due to multipath and non-line-of-sight conditions while not allowing for the possibility of measurements arriving early, i.e. traveling faster than the speed of light. Finally, inertial sensors can be combined with magnetometers. We derive an algorithm that can calibrate a magnetometer for the presence of metallic objects attached to the sensor. Furthermore, the presence of metallic objects in the environment can be exploited by using them as a source of position information. We present a method to build maps of the indoor magnetic field and experimentally show that if a map of the magnetic field is available, accurate position estimates can be obtained by combining inertial and magnetometer measurements.



Controllability of Complex Networks at Minimum Cost

Author : Gustav Lindmark

Publisher : Linköping University Electronic Press

Page : 38 pages

File Size : 17,64 MB

Release : 2020-04-30

Category : Electronic books

ISBN : 9179298478

Get eBook

Book Description

The control-theoretic notion of controllability captures the ability to guide a system toward a desired state with a suitable choice of inputs. Controllability of complex networks such as traffic networks, gene regulatory networks, power grids etc. can for instance enable efficient operation or entirely new applicative possibilities. However, when control theory is applied to complex networks like these, several challenges arise. This thesis considers some of them, in particular we investigate how a given network can be rendered controllable at a minimum cost by placement of control inputs or by growing the network with additional edges between its nodes. As cost function we take either the number of control inputs that are needed or the energy that they must exert. A control input is called unilateral if it can assume either positive or negative values, but not both. Motivated by the many applications where unilateral controls are common, we reformulate classical controllability results for this particular case into a more computationally-efficient form that enables a large scale analysis. Assuming that each control input targets only one node (called a driver node), we show that the unilateral controllability problem is to a high degree structural: from topological properties of the network we derive theoretical lower bounds for the minimal number of unilateral control inputs, bounds similar to those that have already been established for the minimal number of unconstrained control inputs (e.g. can assume both positive and negative values). With a constructive algorithm for unilateral control input placement we also show that the theoretical bounds can often be achieved. A network may be controllable in theory but not in practice if for instance unreasonable amounts of control energy are required to steer it in some direction. For the case with unconstrained control inputs, we show that the control energy depends on the time constants of the modes of the network, the longer they are, the less energy is required for control. We also present different strategies for the problem of placing driver nodes such that the control energy requirements are reduced (assuming that theoretical controllability is not an issue). For the most general class of networks we consider, directed networks with arbitrary eigenvalues (and thereby arbitrary time constants), we suggest strategies based on a novel characterization of network non-normality as imbalance in the distribution of energy over the network. Our formulation allows to quantify network non-normality at a node level as combination of two different centrality metrics. The first measure quantifies the influence that each node has on the rest of the network, while the second measure instead describes the ability to control a node indirectly from the other nodes. Selecting the nodes that maximize the network non-normality as driver nodes significantly reduces the energy needed for control. Growing a network, i.e. adding more edges to it, is a promising alternative to reduce the energy needed to control it. We approach this by deriving a sensitivity function that enables to quantify the impact of an edge modification with the H2 and H? norms, which in turn can be used to design edge additions that improve commonly used control energy metrics.



Flight Test System Identification

Author : Roger Larsson

Publisher : Linköping University Electronic Press

Page : 326 pages

File Size : 33,88 MB

Release : 2019-05-15

Category : Science

ISBN : 9176850706

Get eBook

Book Description

With the demand for more advanced fighter aircraft, relying on unstable flight mechanical characteristics to gain flight performance, more focus has been put on model-based system engineering to help with the design work. The flight control system design is one important part that relies on this modeling. Therefore, it has become more important to develop flight mechanical models that are highly accurate in the whole flight envelope. For today’s modern fighter aircraft, the basic flight mechanical characteristics change between linear and nonlinear as well as stable and unstable as an effect of the desired capability of advanced maneuvering at subsonic, transonic and supersonic speeds. This thesis combines the subject of system identification, which is the art of building mathematical models of dynamical systems based on measurements, with aeronautical engineering in order to find methods for identifying flight mechanical characteristics. Here, some challenging aeronautical identification problems, estimating model parameters from flight-testing, are treated. Two aspects are considered. The first is online identification during flight-testing with the intent to aid the engineers in the analysis process when looking at the flight mechanical characteristics. This will also ensure that enough information is available in the resulting test data for post-flight analysis. Here, a frequency domain method is used. An existing method has been developed further by including an Instrumental Variable approach to take care of noisy data including atmospheric turbulence and by a sensor-fusion step to handle varying excitation during an experiment. The method treats linear systems that can be both stable and unstable working under feedback control. An experiment has been performed on a radio-controlled demonstrator aircraft. For this, multisine input signals have been designed and the results show that it is possible to perform more time-efficient flight-testing compared with standard input signals. The other aspect is post-flight identification of nonlinear characteristics. Here the properties of a parameterized observer approach, using a prediction-error method, are investigated. This approach is compared with four other methods for some test cases. It is shown that this parameterized observer approach is the most robust one with respect to noise disturbances and initial offsets. Another attractive property is that no user parameters have to be tuned by the engineers in order to get the best performance. All methods in this thesis have been validated on simulated data where the system is known, and have also been tested on real flight test data. Both of the investigated approaches show promising results.



Time of Flight Estimation for Radio Network Positioning

Author : Kamiar Radnosrati

Publisher : Linköping University Electronic Press

Page : 78 pages

File Size : 10,9 MB

Release : 2020-02-17

Category :

ISBN : 9179298842

Get eBook

Book Description

Trilateration is the mathematical theory of computing the intersection of circles. These circles may be obtained by time of flight (ToF) measurements in radio systems, as well as laser, radar and sonar systems. A first purpose of this thesis is to survey recent efforts in the area and their potential for localization. The rest of the thesis then concerns selected problems in new cellular radio standards as well as fundamental challenges caused by propagation delays in the ToF measurements, which cannot travel faster than the speed of light. We denote the measurement uncertainty stemming from propagation delays for positive noise, and develop a general theory with optimal estimators for selected distributions, which can be applied to trilateration but also a much wider class of estimation problems. The first contribution concerns a narrow-band mode in the long-term evolution (LTE) standard intended for internet of things (IoT) devices. This LTE standard includes a special position reference signal sent synchronized by all base stations (BS) to all IoT devices. Each device can then compute several pair-wise time differences that correspond to hyperbolic functions. The simulation-based performance evaluation indicates that decent position accuracy can be achieved despite the narrow bandwidth of the channel. The second contribution is a study of how timing measurements in LTE can be combined. Round trip time (RTT) to the serving BS and time difference of arrival (TDOA) to the neighboring BS are used as measurements. We propose a filtering framework to deal with the existing uncertainty in the solution and evaluate with both simulated and experimental test data. The results indicate that the position accuracy is better than 40 meters 95% of the time. The third contribution is a comprehensive theory of how to estimate the signal observed in positive noise, that is, random variables with positive support. It is well known from the literature that order statistics give one order of magnitude lower estimation variance compared to the best linear unbiased estimator (BLUE). We provide a systematic survey of some common distributions with positive support, and provide derivations and summaries of estimators based on order statistics, including the BLUE one for comparison. An iterative global navigation satellite system (GNSS) localization algorithm, based on the derived estimators, is introduced to jointly estimate the receiver’s position and clock bias. The fourth contribution is an extension of the third contribution to a particular approach to utilize positive noise in nonlinear models. That is, order statistics have been employed to derive estimators for a generic nonlinear model with positive noise. The proposed method further enables the estimation of the hyperparameters of the underlying noise distribution. The performance of the proposed estimator is then compared with the maximum likelihood estimator when the underlying noise follows either a uniform or exponential distribution.



Exploiting Direct Optimal Control for Motion Planning in Unstructured Environments

Author : Kristoffer Bergman

Publisher : Linköping University Electronic Press

Page : 60 pages

File Size : 13,56 MB

Release : 2021-03-16

Category : Electronic books

ISBN : 9179296777

Get eBook

Book Description

During the last decades, motion planning for autonomous systems has become an important area of research. The high interest is not the least due to the development of systems such as self-driving cars, unmanned aerial vehicles and robotic manipulators. The objective in optimal motion planning problems is to find feasible motion plans that also optimize a performance measure. From a control perspective, the problem is an instance of an optimal control problem. This thesis addresses optimal motion planning problems for complex dynamical systems that operate in unstructured environments, where no prior reference such as road-lane information is available. Some example scenarios are autonomous docking of vessels in harbors and autonomous parking of self-driving tractor-trailer vehicles at loading sites. The focus is to develop optimal motion planning algorithms that can reliably be applied to these types of problems. This is achieved by combining recent ideas from automatic control, numerical optimization and robotics. The first contribution is a systematic approach for computing local solutions to motion planning problems in challenging unstructured environments. The solutions are computed by combining homotopy methods and direct optimal control techniques. The general principle is to define a homotopy that transforms, or preferably relaxes, the original problem to an easily solved problem. The approach is demonstrated in motion planning problems in 2D and 3D environments, where the presented method outperforms a state-of-the-art asymptotically optimal motion planner based on random sampling. The second contribution is an optimization-based framework for automatic generation of motion primitives for lattice-based motion planners. Given a family of systems, the user only needs to specify which principle types of motions that are relevant for the considered system family. Based on the selected principle motions and a selected system instance, the framework computes a library of motion primitives by simultaneously optimizing the motions and the terminal states. The final contribution of this thesis is a motion planning framework that combines the strengths of sampling-based planners with direct optimal control in a novel way. The sampling-based planner is applied to the problem in a first step using a discretized search space, where the system dynamics and objective function are chosen to coincide with those used in a second step based on optimal control. This combination ensures that the sampling-based motion planner provides a feasible motion plan which is highly suitable as warm-start to the optimal control step. Furthermore, the second step is modified such that it also can be applied in a receding-horizon fashion, where the proposed combination of methods is used to provide theoretical guarantees in terms of recursive feasibility, worst-case objective function value and convergence to the terminal state. The proposed motion planning framework is successfully applied to several problems in challenging unstructured environments for tractor-trailer vehicles. The framework is also applied and tailored for maritime navigation for vessels in archipelagos and harbors, where it is able to compute energy-efficient trajectories which complies with the international regulations for preventing collisions at sea.



Machine learning using approximate inference

Author : Christian Andersson Naesseth

Publisher : Linköping University Electronic Press

Page : 39 pages

File Size : 43,93 MB

Release : 2018-11-27

Category :

ISBN : 9176851613

Get eBook

Book Description

Automatic decision making and pattern recognition under uncertainty are difficult tasks that are ubiquitous in our everyday life. The systems we design, and technology we develop, requires us to coherently represent and work with uncertainty in data. Probabilistic models and probabilistic inference gives us a powerful framework for solving this problem. Using this framework, while enticing, results in difficult-to-compute integrals and probabilities when conditioning on the observed data. This means we have a need for approximate inference, methods that solves the problem approximately using a systematic approach. In this thesis we develop new methods for efficient approximate inference in probabilistic models. There are generally two approaches to approximate inference, variational methods and Monte Carlo methods. In Monte Carlo methods we use a large number of random samples to approximate the integral of interest. With variational methods, on the other hand, we turn the integration problem into that of an optimization problem. We develop algorithms of both types and bridge the gap between them. First, we present a self-contained tutorial to the popular sequential Monte Carlo (SMC) class of methods. Next, we propose new algorithms and applications based on SMC for approximate inference in probabilistic graphical models. We derive nested sequential Monte Carlo, a new algorithm particularly well suited for inference in a large class of high-dimensional probabilistic models. Then, inspired by similar ideas we derive interacting particle Markov chain Monte Carlo to make use of parallelization to speed up approximate inference for universal probabilistic programming languages. After that, we show how we can make use of the rejection sampling process when generating gamma distributed random variables to speed up variational inference. Finally, we bridge the gap between SMC and variational methods by developing variational sequential Monte Carlo, a new flexible family of variational approximations.



Inverse system identification with applications in predistortion

Author : Ylva Jung

Publisher : Linköping University Electronic Press

Page : 224 pages

File Size : 42,30 MB

Release : 2018-12-19

Category :

ISBN : 9176851710

Get eBook

Book Description

Models are commonly used to simulate events and processes, and can be constructed from measured data using system identification. The common way is to model the system from input to output, but in this thesis we want to obtain the inverse of the system. Power amplifiers (PAs) used in communication devices can be nonlinear, and this causes interference in adjacent transmitting channels. A prefilter, called predistorter, can be used to invert the effects of the PA, such that the combination of predistorter and PA reconstructs an amplified version of the input signal. In this thesis, the predistortion problem has been investigated for outphasing power amplifiers, where the input signal is decomposed into two branches that are amplified separately by highly efficient nonlinear amplifiers and then recombined. We have formulated a model structure describing the imperfections in an outphasing abbrPA and the matching ideal predistorter. The predistorter can be estimated from measured data in different ways. Here, the initially nonconvex optimization problem has been developed into a convex problem. The predistorters have been evaluated in measurements. The goal with the inverse models in this thesis is to use them in cascade with the systems to reconstruct the original input. It is shown that the problems of identifying a model of a preinverse and a postinverse are fundamentally different. It turns out that the true inverse is not necessarily the best one when noise is present, and that other models and structures can lead to better inversion results. To construct a predistorter (for a PA, for example), a model of the inverse is used, and different methods can be used for the estimation. One common method is to estimate a postinverse, and then using it as a preinverse, making it straightforward to try out different model structures. Another is to construct a model of the system and then use it to estimate a preinverse in a second step. This method identifies the inverse in the setup it will be used, but leads to a complicated optimization problem. A third option is to model the forward system and then invert it. This method can be understood using standard identification theory in contrast to the ones above, but the model is tuned for the forward system, not the inverse. Models obtained using the various methods capture different properties of the system, and a more detailed analysis of the methods is presented for linear time-invariant systems and linear approximations of block-oriented systems. The theory is also illustrated in examples. When a preinverse is used, the input to the system will be changed, and typically the input data will be different than the original input. This is why the estimation of preinverses is more complicated than for postinverses, and one set of experimental data is not enough. Here, we have shown that identifying a preinverse in series with the system in repeated experiments can improve the inversion performance.



Multisensor Data Fusion

Author : Hassen Fourati

Publisher : CRC Press

Page : 639 pages

File Size : 19,88 MB

Release : 2017-12-19

Category : Technology & Engineering

ISBN : 1482263750

Get eBook

Book Description

Multisensor Data Fusion: From Algorithms and Architectural Design to Applications covers the contemporary theory and practice of multisensor data fusion, from fundamental concepts to cutting-edge techniques drawn from a broad array of disciplines. Featuring contributions from the world’s leading data fusion researchers and academicians, this authoritative book: Presents state-of-the-art advances in the design of multisensor data fusion algorithms, addressing issues related to the nature, location, and computational ability of the sensors Describes new materials and achievements in optimal fusion and multisensor filters Discusses the advantages and challenges associated with multisensor data fusion, from extended spatial and temporal coverage to imperfection and diversity in sensor technologies Explores the topology, communication structure, computational resources, fusion level, goals, and optimization of multisensor data fusion system architectures Showcases applications of multisensor data fusion in fields such as medicine, transportation's traffic, defense, and navigation Multisensor Data Fusion: From Algorithms and Architectural Design to Applications is a robust collection of modern multisensor data fusion methodologies. The book instills a deeper understanding of the basics of multisensor data fusion as well as a practical knowledge of the problems that can be faced during its execution.



Multi-Sensor Data Fusion with MATLAB

Author : Jitendra R. Raol

Publisher : CRC Press

Page : 570 pages

File Size : 22,13 MB

Release : 2009-12-16

Category : Technology & Engineering

ISBN : 1439800057

Get eBook

Book Description

Using MATLAB examples wherever possible, Multi-Sensor Data Fusion with MATLAB explores the three levels of multi-sensor data fusion (MSDF): kinematic-level fusion, including the theory of DF; fuzzy logic and decision fusion; and pixel- and feature-level image fusion. The authors elucidate DF strategies, algorithms, and performance evaluation mainly



Pattern Recognition. ICPR International Workshops and Challenges

Author : Alberto Del Bimbo

Publisher : Springer Nature

Page : 767 pages

File Size : 42,28 MB

Release : 2021-02-20

Category : Computers

ISBN : 3030687961

Get eBook

Book Description

This 8-volumes set constitutes the refereed of the 25th International Conference on Pattern Recognition Workshops, ICPR 2020, held virtually in Milan, Italy and rescheduled to January 10 - 11, 2021 due to Covid-19 pandemic. The 416 full papers presented in these 8 volumes were carefully reviewed and selected from about 700 submissions. The 46 workshops cover a wide range of areas including machine learning, pattern analysis, healthcare, human behavior, environment, surveillance, forensics and biometrics, robotics and egovision, cultural heritage and document analysis, retrieval, and women at ICPR2020.