Coverage problems in mobile sensing

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2008.Includes bibliographical references (p. 177-183).Sensor-networks can today measure physical phenomena at spatial and temporal scales that were not achievable earlier, and have shown promise in monitoring the environment, structures, agricultural fields and so on. A key challenge in sensor-networks is the coordination of four actions across the network: measurement (sensing), communication, motion and computation. The term coverage is applied to the central question of how well a sensor-network senses some phenomenon to make inferences. More formally, a coverage problem involves finding an arrangement of sensors that optimizes a coverage metric. In this thesis we examine coverage in the context of three sensing modalities. The literature on the topic has thus far focused largely on coverage problems with the first modality: static event-detection sensors, which detect purely binary events in their immediate vicinity based on thresholds. However, coverage problems for sensors which measure physical quantities like temperature, pressure, chemical concentrations, light intensity and so on in a network configuration have received limited attention in the literature. We refer to this second modality of sensors as estimation sensors; local estimates from such sensors can be used to reconstruct a field. Third, there has been recent interest in deploying sensors on mobile platforms. Mobility has the effect of increasing the effectiveness of sensing actions. We further classify sensor mobility into incidental and intentional motion. Incidentally mobile sensors move passively under the influence of the environment, for instance, a floating sensor drifting in the sea. We define intentional mobility as the ability to control the location and trajectory of the sensor, for example by mounting it on a mobile robot. We build our analysis on a series of cases. We first analyze coverage and connectivity of a network of floating sensors in rivers using simulations and experimental data, and give guidelines for sensor-network design. Second, we examine intentional mobility and detection sensors.(cont.) We examine the problem of covering indoor and outdoor pathways with reconfigurable camera sensor-networks. We propose and validate an empirical model for detection behavior of cameras. We propose a distributed algorithm for reconfiguring locations of cameras to maximize detection performance. Finally, we examine more general strategies for the placement of estimation sensors and ask when and where to take samples in order to estimate an unknown spatiotemporal field with tolerable estimation errors. We discuss various classes of error-tolerant sensor arrangements for trigonometric polynomial fields.by Ajay A. Deshpande.Ph.D

Acoustically driven control of mobile robots for source localization in complex ocean environments

Ocean based robotic systems are an opportunity to combine the power of acoustic sensing in the water with sophisticated control schemes. Together these bodies of knowledge could create autonomous systems for mapping acoustic fields and localizing underwater sources. However, existing control schemes have often been designed for land and air robots. This creates challenges for applying these algorithms to complex ocean environments. Acoustic fields are strongly frequency dependent, can rarely be realistically modeled analytically, have complex contours where the feature of interest is not always located at the peak pressure, and include many sources of background noise. This work addresses these challenges for control schemes from three categories: feedback and observer control, gradient ascent control and optimal control. In each case the challenges of applying the control scheme to an acoustic field are enumerated and addressed to create a suite of acoustically driven control schemes. For many of these algorithms, the largest issue is the processing and collection of acoustic data, particularly in the face of noise. Two new methods are developed to solve this issue. The first is the use of Principal Component Analysis as a noise filter for acoustic signals, which is shown to address particularly high levels of noise, while providing the frequency dependent sound pressure levels necessary for subsequent processing. The second method addresses the challenge that an analytical expression of the pressure field is often lacking, due to uncertainties and complexities in the environmental parameters. Basis functions are used to address this. Several candidates are considered, but Legendre polynomials are selected for their low error and reasonable processing time. Additionally, a method of intermediate points is used to approximate high frequency pressure fields with low numbers of collected data points. Following this work, the individual control schemes are explored. A method of observer feedback control is proposed to localize sources by linearizing the acoustic fields. A gradient ascent method for localizing sources in real time is proposed which uses Matched Field Processing and Bayesian filters. These modifications allow the gradient ascent algorithm to be compatible with complex acoustic fields. Finally, an optimal control method is proposed using Pontryagin's Maximum Principle to derive trajectories in real time that balance information gain with control energy. This method is shown to efficiently map an acoustic field, either for optimal sensor placement or to localize sources. The contribution of this work is a new collection of control schemes that use acoustic data to localize acoustically complex sources in a realistic noisy environment, and an understanding of the tradeoffs inherent in applying each of these to the acoustic domain

Dependable Control for Wireless Distributed Control Systems

The use of wireless communications for real-time control applications poses several problems related to the comparatively low reliability of the communication channels. This paper is concerned with adaptive and predictive application-level strategies for ameliorating the effects of packet losses and burst errors in industrial sampled-data Distributed Control Systems (DCSs), which are implemented via one or more wireless and/or wired links, possibly spanning multiple hops. The paper describes an adaptive compensator that reconstructs the best estimates (in a least squares sense) of a sequence of one or more missing sensor node data packets in the controller node. At each sample time, the controller node calculates the current control, and a prediction of future controls to apply over a short time horizon; these controls are forwarded to the actuator node every sample time step. A simple design method for a digital Proportional Integral Derivative (PID)-like adaptive controller is also described for use in the controller node. Together these mechanisms give robustness to packet losses around the control loop; in addition, the majority of the computational overhead resides in the controller node. An implementation of the proposed techniques is applied to a case study using a Hardware in the Loop (HIL) test facility, and favorable results (in terms of both performance and computational overheads) are found when compared to an existing robust control method for a DCS experiencing artificially induced burst errors

Parallel Manipulators

In recent years, parallel kinematics mechanisms have attracted a lot of attention from the academic and industrial communities due to potential applications not only as robot manipulators but also as machine tools. Generally, the criteria used to compare the performance of traditional serial robots and parallel robots are the workspace, the ratio between the payload and the robot mass, accuracy, and dynamic behaviour. In addition to the reduced coupling effect between joints, parallel robots bring the benefits of much higher payload-robot mass ratios, superior accuracy and greater stiffness; qualities which lead to better dynamic performance. The main drawback with parallel robots is the relatively small workspace. A great deal of research on parallel robots has been carried out worldwide, and a large number of parallel mechanism systems have been built for various applications, such as remote handling, machine tools, medical robots, simulators, micro-robots, and humanoid robots. This book opens a window to exceptional research and development work on parallel mechanisms contributed by authors from around the world. Through this window the reader can get a good view of current parallel robot research and applications

Design and Control of Electrical Motor Drives

Dear Colleagues, I am very happy to have this Special Issue of the journal Energies on the topic of Design and Control of Electrical Motor Drives published. Electrical motor drives are widely used in the industry, automation, transportation, and home appliances. Indeed, rolling mills, machine tools, high-speed trains, subway systems, elevators, electric vehicles, air conditioners, all depend on electrical motor drives.However, the production of effective and practical motors and drives requires flexibility in the regulation of current, torque, flux, acceleration, position, and speed. Without proper modeling, drive, and control, these motor drive systems cannot function effectively.To address these issues, we need to focus on the design, modeling, drive, and control of different types of motors, such as induction motors, permanent magnet synchronous motors, brushless DC motors, DC motors, synchronous reluctance motors, switched reluctance motors, flux-switching motors, linear motors, and step motors.Therefore, relevant research topics in this field of study include modeling electrical motor drives, both in transient and in steady-state, and designing control methods based on novel control strategies (e.g., PI controllers, fuzzy logic controllers, neural network controllers, predictive controllers, adaptive controllers, nonlinear controllers, etc.), with particular attention to transient responses, load disturbances, fault tolerance, and multi-motor drive techniques. This Special Issue include original contributions regarding recent developments and ideas in motor design, motor drive, and motor control. The topics include motor design, field-oriented control, torque control, reliability improvement, advanced controllers for motor drive systems, DSP-based sensorless motor drive systems, high-performance motor drive systems, high-efficiency motor drive systems, and practical applications of motor drive systems. I want to sincerely thank authors, reviewers, and staff members for their time and efforts. Prof. Dr. Tian-Hua Liu Guest Edito

Advances in Vibration Analysis Research

Vibrations are extremely important in all areas of human activities, for all sciences, technologies and industrial applications. Sometimes these Vibrations are useful but other times they are undesirable. In any case, understanding and analysis of vibrations are crucial. This book reports on the state of the art research and development findings on this very broad matter through 22 original and innovative research studies exhibiting various investigation directions. The present book is a result of contributions of experts from international scientific community working in different aspects of vibration analysis. The text is addressed not only to researchers, but also to professional engineers, students and other experts in a variety of disciplines, both academic and industrial seeking to gain a better understanding of what has been done in the field recently, and what kind of open problems are in this area

Algorithm engineering in geometric network planning and data mining

The geometric nature of computational problems provides a rich source of solution strategies as well as complicating obstacles. This thesis considers three problems in the context of geometric network planning, data mining and spherical geometry. Geometric Network Planning: In the d-dimensional Generalized Minimum Manhattan Network problem (d-GMMN) one is interested in finding a minimum cost rectilinear network N connecting a given set of n pairs of points in ℝ^d such that each pair is connected in N via a shortest Manhattan path. The decision version of this optimization problem is known to be NP-hard. The best known upper bound is an O(log^{d+1} n) approximation for d>2 and an O(log n) approximation for 2-GMMN. In this work we provide some more insight in, whether the problem admits constant factor approximations in polynomial time. We develop two new algorithms, a `scale-diversity aware' algorithm with an O(D) approximation guarantee for 2-GMMN. Here D is a measure for the different `scales' that appear in the input, D ∈ O(log n) but potentially much smaller, depending on the problem instance. The other algorithm is based on a primal-dual scheme solving a more general, combinatorial problem - which we call Path Cover. On 2-GMMN it performs well in practice with good a posteriori, instance-based approximation guarantees. Furthermore, it can be extended to deal with obstacle avoiding requirements. We show that the Path Cover problem is at least as hard to approximate as the Hitting Set problem. Moreover, we show that solutions of the primal-dual algorithm are 4ω^2 approximations, where ω ≤ n denotes the maximum overlap of a problem instance. This implies that a potential proof of O(1)-inapproximability for 2-GMMN requires gadgets of many different scales and non-constant overlap in the construction. Geometric Map Matching for Heterogeneous Data: For a given sequence of location measurements, the goal of the geometric map matching is to compute a sequence of movements along edges of a spatially embedded graph which provides a `good explanation' for the measurements. The problem gets challenging as real world data, like traces or graphs from the OpenStreetMap project, does not exhibit homogeneous data quality. Graph details and errors vary in areas and each trace has changing noise and precision. Hence, formalizing what a `good explanation' is becomes quite difficult. We propose a novel map matching approach, which locally adapts to the data quality by constructing what we call dominance decompositions. While our approach is computationally more expensive than previous approaches, our experiments show that it allows for high quality map matching, even in presence of highly variable data quality without parameter tuning. Rational Points on the Unit Spheres: Each non-zero point in ℝ^d identifies a closest point x on the unit sphere S^{d-1}. We are interested in computing an ε-approximation y ∈ ℚ^d for x, that is exactly on S^{d-1} and has low bit-size. We revise lower bounds on rational approximations and provide explicit spherical instances. We prove that floating-point numbers can only provide trivial solutions to the sphere equation in ℝ^2 and ℝ^3. However, we show how to construct a rational point with denominators of at most 10(d-1)/ε^2 for any given ε ∈ (0, 1/8], improving on a previous result. The method further benefits from algorithms for simultaneous Diophantine approximation. Our open-source implementation and experiments demonstrate the practicality of our approach in the context of massive data sets, geo-referenced by latitude and longitude values.Die geometrische Gestalt von Berechnungsproblemen liefert vielfältige Lösungsstrategieen aber auch Hindernisse. Diese Arbeit betrachtet drei Probleme im Gebiet der geometrischen Netzwerk Planung, des geometrischen Data Minings und der sphärischen Geometrie. Geometrische Netzwerk Planung: Im d-dimensionalen Generalized Minimum Manhattan Network Problem (d-GMMN) möchte man ein günstigstes geradliniges Netzwerk finden, welches jedes der gegebenen n Punktepaare aus ℝ^d mit einem kürzesten Manhattan Pfad verbindet. Es ist bekannt, dass die Entscheidungsvariante dieses Optimierungsproblems NP-hart ist. Die beste bekannte obere Schranke ist eine O(log^{d+1} n) Approximation für d>2 und eine O(log n) Approximation für 2-GMMN. Durch diese Arbeit geben wir etwas mehr Einblick, ob das Problem eine Approximation mit konstantem Faktor in polynomieller Zeit zulässt. Wir entwickeln zwei neue Algorithmen. Ersterer nutzt die `Skalendiversität' und hat eine O(D) Approximationsgüte für 2-GMMN. Hierbei ist D ein Maß für die in Eingaben auftretende `Skalen'. D ∈ O(log n), aber potentiell deutlichen kleiner für manche Problem Instanzen. Der andere Algorithmus basiert auf einem Primal-Dual Schema zur Lösung eines allgemeineren, kombinatorischen Problems, welches wir Path Cover nennen. Die praktisch erzielten a posteriori Approximationsgüten auf Instanzen von 2-GMMN verhalten sich gut. Dieser Algorithmus kann für Netzwerk Planungsprobleme mit Hindernis-Anforderungen angepasst werden. Wir zeigen, dass das Path Cover Problem mindestens so schwierig zu approximieren ist wie das Hitting Set Problem. Darüber hinaus zeigen wir, dass Lösungen des Primal-Dual Algorithmus 4ω^2 Approximationen sind, wobei ω ≤ n die maximale Überlappung einer Probleminstanz bezeichnet. Daher müssen potentielle Beweise, die konstante Approximationen für 2-GMMN ausschließen möchten, Instanzen mit vielen unterschiedlichen Skalen und nicht konstanter Überlappung konstruieren. Geometrisches Map Matching für heterogene Daten: Für eine gegebene Sequenz von Positionsmessungen ist das Ziel des geometrischen Map Matchings eine Sequenz von Bewegungen entlang Kanten eines räumlich eingebetteten Graphen zu finden, welche eine `gute Erklärung' für die Messungen ist. Das Problem wird anspruchsvoll da reale Messungen, wie beispielsweise Traces oder Graphen des OpenStreetMap Projekts, keine homogene Datenqualität aufweisen. Graphdetails und -fehler variieren in Gebieten und jeder Trace hat wechselndes Rauschen und Messgenauigkeiten. Zu formalisieren, was eine `gute Erklärung' ist, wird dadurch schwer. Wir stellen einen neuen Map Matching Ansatz vor, welcher sich lokal der Datenqualität anpasst indem er sogenannte Dominance Decompositions berechnet. Obwohl unser Ansatz teurer im Rechenaufwand ist, zeigen unsere Experimente, dass qualitativ hochwertige Map Matching Ergebnisse auf hoch variabler Datenqualität erzielbar sind ohne vorher Parameter kalibrieren zu müssen. Rationale Punkte auf Einheitssphären: Jeder, von Null verschiedene, Punkt in ℝ^d identifiziert einen nächsten Punkt x auf der Einheitssphäre S^{d-1}. Wir suchen eine ε-Approximation y ∈ ℚ^d für x zu berechnen, welche exakt auf S^{d-1} ist und niedrige Bit-Größe hat. Wir wiederholen untere Schranken an rationale Approximationen und liefern explizite, sphärische Instanzen. Wir beweisen, dass Floating-Point Zahlen nur triviale Lösungen zur Sphären-Gleichung in ℝ^2 und ℝ^3 liefern können. Jedoch zeigen wir die Konstruktion eines rationalen Punktes mit Nennern die maximal 10(d-1)/ε^2 sind für gegebene ε ∈ (0, 1/8], was ein bekanntes Resultat verbessert. Darüber hinaus profitiert die Methode von Algorithmen für simultane Diophantische Approximationen. Unsere quell-offene Implementierung und die Experimente demonstrieren die Praktikabilität unseres Ansatzes für sehr große, durch geometrische Längen- und Breitengrade referenzierte, Datensätze

Industrial Robotics

This book covers a wide range of topics relating to advanced industrial robotics, sensors and automation technologies. Although being highly technical and complex in nature, the papers presented in this book represent some of the latest cutting edge technologies and advancements in industrial robotics technology. This book covers topics such as networking, properties of manipulators, forward and inverse robot arm kinematics, motion path-planning, machine vision and many other practical topics too numerous to list here. The authors and editor of this book wish to inspire people, especially young ones, to get involved with robotic and mechatronic engineering technology and to develop new and exciting practical applications, perhaps using the ideas and concepts presented herein

Gravity Field Refinement by Radial Basis Functions from In-situ Satellite Data

In this thesis, an integrated approach is developed for the regional refinement of global gravity field solutions. The analysis concepts are tailored to the in-situ type character of the observations provided by the new satellite missions CHAMP, GRACE, and GOCE. They are able to evaluate data derived from short arcs of the satellite's orbit and, therefore, offer the opportunity to use regional satellite data for the calculation of regional gravity field solutions. The regional character of the approach will be realized at various stages of the analysis procedure. The first step is the design of specifically tailored space localizing basis functions. In order to adapt the basis functions to the signal content to be expected in the gravity field solution, they will be derived from the covariance function of the gravitational potential. To use the basis functions in gravity field modeling, they have to be located at the nodal points of a spherical grid; therefore investigations will be performed regarding a suitable choice of such a nodal point distribution. Another important aspect in the regional gravity field analysis approach is the downward continuation process. In this context, a regionally adapted regularization will be introduced which assigns different regularization matrices to geographical areas with varying signal content. Regularization parameters individually determined for each region take into account the varying frequency behavior, allowing to extract additional information out of a given data set. To conclude the analysis chain, an approach will be described that combines regional solutions with global coverage to obtain a global solution and to derive the corresponding spherical harmonic coefficients by means of the Gauss-Legendre quadrature method. The capability of the method will be demonstrated by its successful application to real data provided by CHAMP and GRACE and to a simulation scenario based on a combination of GRACE and GOCE observations.Verfeinerungen des Gravitationsfeldes mit radialen Basisfunktionen aus in-situ Satellitendaten In der vorliegenden Arbeit wird ein ganzheitliches Konzept für die regionale Verfeinerung globaler Gravitationsfeldmodelle entwickelt. Die dazu verwendeten Analyseverfahren sind dem in-situ Charakter der Beobachtungen der neuen Satellitenmissionen CHAMP, GRACE und GOCE angepasst. Sie beruhen auf kurzen Bahnbögen und ermöglichen somit die Berechnung regionaler Gravitationsfeldmodelle aus regional begrenzten Satellitendaten. Der regionale Charakter des Ansatzes wird dabei auf verschiedenen Ebenen des Analyseprozesses realisiert. Der erste Schritt ist die Entwicklung angepasster orts-lokalisierender Basisfunktionen. Diese sollen das Frequenzverhalten des zu bestimmenden Gravitationsfeldes widerspiegeln; sie werden daher aus der Kovarianzfunktion des Gravitationspotentials abgeleitet. Um die Basisfunktionen für die Schwerefeldmodellierung zu verwenden, müssen sie an den Knotenpunkten eines sphärischen Gitters angeordnet werden. Daher werden Untersuchungen durchgeführt, welche Punktverteilung für diese Aufgabe besonders geeignet ist. Einen wichtigen Aspekt bei der regionalen Gravi-tationsfeldanalyse stellt der Fortsetzungsprozess nach unten dar. In diesem Zusammenhang wird ein regional angepasstes Regularisierungsverfahren entwickelt, das verschiedene Regularisierungsmatrizen für regionale Gebiete mit unterschiedlichem Schwerefeldsignal ermöglicht. Individuell angepasste Regularisierungsparameter berücksichtigen den variierenden Signalinhalt, wodurch erreicht wird, dass zusätzliche Informationen aus einem gegebenen Datensatz extrahiert werden können. Schließlich wird ein Ansatz vorgestellt, der regionale Lösungen mit globaler Überdeckung zu einer globalen Lösung zusammenfügt und die zugehörigen sphärischen harmonischen Koeffizienten mit Hilfe der Gauss-Legendre-Quadratur berechnet. Die Leistungsfähigkeit des beschriebenen Ansatzes wird durch eine erfolgreiche Anwendung auf die Echtdatenanalyse aus Daten der Satellitenmissionen CHAMP und GRACE und auf ein Simulationsszenario aus einer Kombination simulierter GRACE- und GOCE-Beobachtungen verdeutlicht