The possibilities for positioning in cellular networks has increased over time, pushed by increased needs for location based products and services for a variety of purposes. It all started with rough position estimates based on timing measurements and sector information available in the global system for mobile communication (gsm), and today there is an increased standardization effort to provide more position relevant measurements in cellular communication systems to improve on localization accuracy and availability. 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 investigates three particular aspects, where the focus is on timing measurements. How can these be combined in the best way in long term evolution (lte), what is the potential for the new narrow-band communication links for localization, and can the timing measurement error be more accurately modeled? The first contribution concerns a narrow-band standard in lte 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 corresponds to hyperbolic functions. Using multilateration methods the intersection of a set of such hyperbolas can be computed. An extensive performance study using a professional simulation environment with realistic user models is presented, indicating that a decent position accuracy can be achieved despite the narrow bandwidth of the channel. The second contribution is a study of how downlink measurements in lte can be combined. Time of flight (tof) to the serving bs and time difference of arrival (tdoa) to the neighboring bs are used as measurements. From a geometrical perspective, the position estimation problem involves computing the intersection of a circle and hyperbolas, all with uncertain radii. We propose a fusion framework for both snapshot estimation and filtering, and evaluate with both simulated and experimental field test data. The results indicate that the position accuracy is better than 40 meters 95% of the time. A third study in the thesis analyzes the statistical distribution of timing measurement errors in lte systems. Three different machine learning methods are applied to the experimental data to fit Gaussian mixture distributions to the observed measurement errors. Since current positioning algorithms are mostly based on Gaussian distribution models, knowledge of a good model for the measurement errors can be used to improve the accuracy and robustness of the algorithms. The obtained results indicate that a single Gaussian distribution is not adequate to model the real toa measurement errors. One possible future study is to further develop standard algorithms with these models.

Modern day networking and computing systems rely increasingly on knowing the location of the user. These include state-of-the art technologies such as navigation of vehicles and robots, traffic planning, or light control in smart home environments. In the future, even more services will appear. The predominant localization technology currently uses satellite signals but this only works outdoors, is expensive, and consumes considerable power. Alternative localization technologies have been recently developed using optical, ultra-sound, or radar techniques. All of these require additional hardware components to work effectively. Radio-frequency (RF) localization is a technique that uses communication signals to perform the task without the need for any extra hardware. This monograph addresses the role of synchronization in radio localization and provides a comprehensive overview of recent developments suitable for current and future practical implementations. The material is intended for both theoreticians and practitioners and is written to be accessible to novices while covering state-of-the-art topics of interest to advanced researchers of localization and synchronization systems.

This book presents the latest research results in the area of secure localization for both wireless mobile ad hoc networks and wireless sensor networks. It is suitable as a text for computer science courses in wireless systems and security. It includes implementation studies with mica2 mote sensors. Due to the open spectrum nature of wireless communication, it is subject to attacks and intrusions. Hence the wireless network synchronization needs to be both robust and secure. Furthermore, issues such as energy constraints and mobility make the localization process even more challenging. The book will also interest developers of secure wireless systems.

The desire for precise knowledge about the location of a moving object at any time instant has motivated a great deal of scientific research recently. This is owing to a steady expansion of the range of enabling devices and technologies, as well as the need for seamless solutions for location-based services. Besides localization accuracy, a common requirement for emerging solutions is that they are cost-abstemious, both in terms of the financial and computational cost. Hence, development of localization strategies from already deployed technologies, e.g., from different terrestrial radio frequency sources is of great practical interest. Amongst other, these include localization strategies based on received signal strength (RSS), time of arrival, angle of arrival (AoA) or a combination of them. RSS-AoA-based Target Localization and Tracking in Wireless Sensor Networks presents recent advances in developing algorithms for target localization and tracking, reflecting the state-of-the-art algorithms and research achievements in target localization and tracking based on hybrid (RSS-AoA) measurements. Technical topics discussed in the book include: Centralized RSS-AoA-based Target LocalizationDistributed RSS-AoA-based Target LocalizationRSS-AoA-based Target Tracking via Maximum A Posteriori EstimatorRSS-AoA-based Target Tracking via Kalman Filter RSS-AoA-based via Sensor Navigation This book is of interest for personnel in telecommunications and surveillance industries, military, smart systems, as well as academic staff and postgraduate/research students in telecommunications, signal processing, and non-smooth and convex optimization.

Sensor networks consist of sensors (e.g., radar and cameras) and processing units (e.g., estimators), where in the former information extraction occurs and in the latter estimates are formed. In decentralized estimation information extracted by sensors has been pre-processed at an intermediate processing unit prior to arriving at an estimator. Pre-processing of information allows for the complexity of large systems and systems-of-systems to be significantly reduced, and also makes the sensor network robust and flexible. One of the main disadvantages of pre-processing information is that information becomes correlated. These correlations, if not handled carefully, potentially lead to underestimated uncertainties about the calculated estimates. In conservative estimation the unknown correlations are handled by ensuring that the uncertainty about an estimate is not underestimated. If this is ensured the estimate is said to be conservative. Neglecting correlations means information is double counted which in worst case implies diverging estimates with fatal consequences. While ensuring conservative estimates is the main goal, it is desirable for a conservative estimator, as for any estimator, to provide an error covariance which is as small as possible. Application areas where conservative estimation is relevant are setups where multiple agents cooperate to accomplish a common objective, e.g., target tracking, surveillance and air policing. The first part of this thesis deals with theoretical matters where the conservative linear unbiased estimation problem is formalized. This part proposes an extension of classical linear estimation theory to the conservative estimation problem. The conservative linear unbiased estimator (CLUE) is suggested as a robust and practical alternative for estimation problems where the correlations are unknown. Optimality criteria for the CLUE are provided and further investigated. It is shown that finding an optimal CLUE is more complicated than finding an optimal linear unbiased estimator in the classical version of the problem. To simplify the problem, a CLUE that is optimal under certain restrictions will also be investigated. The latter is named restricted best CLUE. An important result is a theorem that gives a closed form solution to a restricted best CLUE. Furthermore, several conservative estimation methods are described followed by an analysis of their properties. The methods are shown to be conservative and optimal under different assumptions about the underlying correlations. The second part of the thesis focuses on practical aspects of the conservative approach to decentralized estimation in configurations where the communication channel is constrained. The diagonal covariance approximation is proposed as a data reduction technique that complies with the communication constraints and if handled correctly can be shown to preserve conservative estimates. Several information selection methods are derived that can reduce the amount of data being transmitted in the communication channel. Using the information selection methods it is possible to decide what information other actors of the sensor network find useful.

The two topics at the heart of this thesis are how to improve control of industrial manipulators and how to reason about the role of models in automatic control. On industrial manipulators, two case studies are presented. The first investigates estimation with inertial sensors, and the second compares control by feedback linearization to control based on gain-scheduling. The contributions on the second topic illustrate the close connection between control and estimation in different ways. A conceptual model of control is introduced, which can be used to emphasize the role of models as well as the human aspect of control engineering. Some observations are made regarding block-diagram reformulations that illustrate the relation between models, control and inversion. Finally, a suggestion for how the internal model principle, internal model control, disturbance observers and Youla-Kucera parametrization can be introduced in a unified way is presented.

In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bounds on worst-case solution time. Often for linear MPC problems, the optimization problem in question is a quadratic program (QP) that depends on parameters such as system states and reference signals. A popular class of methods for solving such QPs is active-set methods, where a sequence of linear systems of equations is solved. The primary contribution of this thesis is a method which determines which sequence of subproblems a popular class of such active-set algorithms need to solve, for every possible QP instance that might arise from a given linear MPC problem (i.e, for every possible state and reference signal). By knowing these sequences, worst-case bounds on how many iterations, floating-point operations and, ultimately, the maximum solution time, these active-set algorithms require to compute a solution can be determined, which is of importance when, e.g, linear MPC is used in safety-critical applications. After establishing this complexity certification method, its applicability is extended by showing how it can be used indirectly to certify the complexity of another, efficient, type of active-set QP algorithm which reformulates the QP as a nonnegative least-squares method. Finally, the proposed complexity certification method is extended further to situations when enhancements to the active-set algorithms are used, namely, when they are terminated early (to save computations) and when outer proximal-point iterations are performed (to improve numerical stability).