Distributed navigation of multi-robot systems for sensing coverage

A team of coordinating mobile robots equipped with operation specific sensors can perform different coverage tasks. If the required number of robots in the team is very large then a centralized control system becomes a complex strategy. There are also some areas where centralized communication turns into an issue. So, a team of mobile robots for coverage tasks should have the ability of decentralized or distributed decision making. This thesis investigates decentralized control of mobile robots specifically for coverage problems. A decentralized control strategy is ideally based on local information and it can offer flexibility in case there is an increment or decrement in the number of mobile robots. We perform a broad survey of the existing literature for coverage control problems. There are different approaches associated with decentralized control strategy for coverage control problems. We perform a comparative review of these approaches and use the approach based on simple local coordination rules. These locally computed nearest neighbour rules are used to develop decentralized control algorithms for coverage control problems. We investigate this extensively used nearest neighbour rule-based approach for developing coverage control algorithms. In this approach, a mobile robot gives an equal importance to every neighbour robot coming under its communication range. We develop our control approach by making some of the mobile robots playing a more influential role than other members of the team. We develop the control algorithm based on nearest neighbour rules with weighted average functions. The approach based on this control strategy becomes efficient in terms of achieving a consensus on control inputs, say heading angle, velocity, etc. The decentralized control of mobile robots can also exhibit a cyclic behaviour under some physical constraints like a quantized orientation of the mobile robot. We further investigate the cyclic behaviour appearing due to the quantized control of mobile robots under some conditions. Our nearest neighbour rule-based approach offers a biased strategy in case of cyclic behaviour appearing in the team of mobile robots. We consider a clustering technique inside the team of mobile robots. Our decentralized control strategy calculates the similarity measure among the neighbours of a mobile robot. The team of mobile robots with the similarity measure based approach becomes efficient in achieving a fast consensus like on heading angle or velocity. We perform a rigorous mathematical analysis of our developed approach. We also develop a condition based on relaxed criteria for achieving consensus on velocity or heading angle of the mobile robots. Our validation approach is based on mathematical arguments and extensive computer simulations

Design and Performance Analysis of Genetic Algorithms for Topology Control Problems

In this dissertation, we present a bio-inspired decentralized topology control mechanism, called force-based genetic algorithm (FGA), where a genetic algorithm (GA) is run by each autonomous mobile node to achieve a uniform spread of mobile nodes and to provide a fully connected network over an unknown area. We present a formal analysis of FGA in terms of convergence speed, uniformity at area coverage, and Lyapunov stability theorem. This dissertation emphasizes the use of mobile nodes to achieve a uniform distribution over an unknown terrain without a priori information and a central control unit. In contrast, each mobile node running our FGA has to make its own movement direction and speed decisions based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge. We have implemented simulation software in Java and developed four different testbeds to study the effectiveness of different GA-based topology control frameworks for network performance metrics including node density, speed, and the number of generations that GAs run. The stochastic behavior of FGA, like all GA-based approaches, makes it difficult to analyze its convergence speed. We built metrically transitive homogeneous and inhomogeneous Markov chain models to analyze the convergence of our FGA with respect to the communication ranges of mobile nodes and the total number of nodes in the system. The Dobrushin contraction coefficient of ergodicity is used for measuring convergence speed for homogeneous and inhomogeneous Markov chain models of our FGA. Furthermore, convergence characteristic analysis helps us to choose the nearoptimal values for communication range, the number of mobile nodes, and the mean node degree before sending autonomous mobile nodes to any mission. Our analytical and experimental results show that our FGA delivers promising results for uniform mobile node distribution over unknown terrains. Since our FGA adapts to local environment rapidly and does not require global network knowledge, it can be used as a real-time topology controller for commercial and military applications

Unmanned Ground Vehicle navigation and coverage hole patching in Wireless Sensor Networks

This dissertation presents a study of an Unmanned Ground Vehicle (UGV) navigation and coverage hole patching in coordinate-free and localization-free Wireless Sensor Networks (WSNs). Navigation and coverage maintenance are related problems since coverage hole patching requires effective navigation in the sensor network environment. A coordinate-free and localization-free WSN that is deployed in an ad-hoc fashion and does not assume the availability of GPS information is considered. The system considered is decentralized and can be self-organized in an event-driven manner where no central controller or global map is required. A single-UGV, single-destination navigation problem is addressed first. The UGV is equipped with a set of wireless listeners that determine the slope of a navigation potential field generated by the wireless sensor and actuator network. The navigation algorithm consists of sensor node level-number assignment that is determined based on a hop-distance from the network destination node and UGV navigation through the potential field created by triplets of actuators in the network. A multi-UGV, multi-destination navigation problem requires a path-planning and task allocation process. UGVs inform the network about their proposed destinations, and the network provides feedback if conflicts are found. Sensor nodes store, share, and communicate to UGVs in order to allocate the navigation tasks. A special case of a single-UGV, multi-destination navigation problem that is equivalent to the well-known Traveling Salesman Problem is discussed. The coverage hole patching process starts after a UGV reaches the hole boundary. For each hole boundary edge, a new node is added along its perpendicular bisector, and the entire hole is patched by adding nodes around the hole boundary edges. The communication complexity and present simulation examples and experimental results are analyzed. Then, a Java-based simulation testbed that is capable of simulating both the centralized and distributed sensor and actuator network algorithms is developed. The laboratory experiment demonstrates the navigation algorithm (single-UGV, single-destination) using Cricket wireless sensors and an actuator network and Pioneer 3-DX robot

Autonomisen multikopteriparven hallinta etsintä- ja pelastustehtävissä

This thesis presents the requirements and implementation of a Ground Control Station (GCS) application for controlling a fleet of multicopters to perform a Search And Rescue (SAR) mission. The requirements are put together by analysing existing drone types, SAR practices, and available GCS applications. Multicopters are found to be the most feasible drone to use for the SAR use case because of their maneuverability, despite not having the best endurance. Several existing area coverage methods are presented and their usefulness is analyzed for SAR scenarios where different amounts of prior knowledge is available. It is stated that most search patterns can be used with a fleet of drones, by creating drone formations and by dividing the target area into sub-areas. It is noted that most currently available GCS applications are focused on controlling a single drone for either industrial or hobby use. A proof of concept prototype is developed on top of an open source GCS and tested in field tests. Based on all the previous learnings from the protype and research, a new GCS is designed and developed. The development on optimizing communications between the GCS and the autopilot leads to a filed patent application. The new software is tested with three multicopters in a water rescue scenario and several user interface improvements are made as a result of the learnings. The development of a GCS for controlling a drone fleet for search and rescue is proven feasible.Työssä esitetään multikopteriparven hallintaan käytettävän Ground Control Station (GCS) ohjelmiston vaatimukset ja toteutus Search And Rescue (SAR) etsintä- ja pelastustehtävien suorittamiseksi. Vaatimukset kootaan yhteen analysoimalla saatavilla olevia droonityyppejä, SAR pelastuskäytäntöjä, sekä GCS ohjelmistoja. Multikopterit osoittautuvat liikkuvuutensa ansiosta pelastustehtäviin sopivimmaksi vaihtoehdoksi, vaikka niiden saavutettavissa oleva lentoaika ei ole parhaimmasta päästä. Erilaisia etsintämetodeja esitetään alueiden kattamiseksi ja niiden hyödyllisyyttä analysoidaan SAR tilanteissa, joissa ennakkotietoa on saatavilla vaihtelevasti. Osoitetaan, että useimpia etsintäalgoritmeja voidaan hyödyntää drooniparvella, muodostamalla lentomuodostelmia, sekä jakamalla kohdealue pienempiin osa-alueisiin. Huomataan, että suurin osa tällä hetkellä saatavilla olevista GCS ohjelmistoista on suunnattu teollisuuden tai harrastelijoiden käyttöön, pääasiassa yksittäisen droonin hallintaan. Prototyyppi kehitetään avoimen lähdekoodin GCS ohjelmiston pohjalta ja testataan kenttätesteissä. Tästä saadun tiedon avulla suunnitellaan ja kehitetään uusi GCS ohjelmisto. Kehitystyö viestinnän optimoinniksi autopilotin ja GCS ohjelmiston välillä johtaa patenttihakemukseen. Uusi ohjelmisto testataan kolmella multikopterilla vesipelastustilanteessa ja sen seurauksena käyttöliittymään tehdään useita parannuksia. GCS ohjelmiston luominen drooniparven hallintaan etsintä- ja pelastustehtävissä todetaan mahdolliseksi

Space station systems: A bibliography with indexes (supplement 9)

This bibliography lists 1,313 reports, articles, and other documents introduced into the NASA scientific and technical information system between January 1, 1989 and June 30, 1989. Its purpose is to provide helpful information to researchers, designers and managers engaged in Space Station technology development and mission design. Coverage includes documents that define major systems and subsystems related to structures and dynamic control, electronics and power supplies, propulsion, and payload integration. In addition, orbital construction methods, servicing and support requirements, procedures and operations, and missions for the current and future Space Station are included

Intelligent Sensor Networks

In the last decade, wireless or wired sensor networks have attracted much attention. However, most designs target general sensor network issues including protocol stack (routing, MAC, etc.) and security issues. This book focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on their world-class research, the authors present the fundamentals of intelligent sensor networks. They cover sensing and sampling, distributed signal processing, and intelligent signal learning. In addition, they present cutting-edge research results from leading experts

Technology for large space systems: A bibliography with indexes (supplement 11)

This bibliography contains 539 abstracts of reports, articles and other documents introduced into the NASA scientific and technical information system between January 1, 1984 and December 31, 1984. Abstracts are arranged in the following categories: systems; analysis and design techniques; structural concepts; structural and thermal analysis; structural dynamics and control; electronics; advanced materials; assembly concepts; propulsion; and miscellaneous. Subject, personal author, corporate source, contract number, report number, and accession number indexes are listed

Sparse Bayesian information filters for localization and mapping

Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the Massachusetts Institute of Technology and the Woods Hole Oceanographic Institution February 2008This thesis formulates an estimation framework for Simultaneous Localization and Mapping (SLAM) that addresses the problem of scalability in large environments. We describe an estimation-theoretic algorithm that achieves significant gains in computational efficiency while maintaining consistent estimates for the vehicle pose and the map of the environment. We specifically address the feature-based SLAM problem in which the robot represents the environment as a collection of landmarks. The thesis takes a Bayesian approach whereby we maintain a joint posterior over the vehicle pose and feature states, conditioned upon measurement data. We model the distribution as Gaussian and parametrize the posterior in the canonical form, in terms of the information (inverse covariance) matrix. When sparse, this representation is amenable to computationally efficient Bayesian SLAM filtering. However, while a large majority of the elements within the normalized information matrix are very small in magnitude, it is fully populated nonetheless. Recent feature-based SLAM filters achieve the scalability benefits of a sparse parametrization by explicitly pruning these weak links in an effort to enforce sparsity. We analyze one such algorithm, the Sparse Extended Information Filter (SEIF), which has laid much of the groundwork concerning the computational benefits of the sparse canonical form. The thesis performs a detailed analysis of the process by which the SEIF approximates the sparsity of the information matrix and reveals key insights into the consequences of different sparsification strategies. We demonstrate that the SEIF yields a sparse approximation to the posterior that is inconsistent, suffering from exaggerated confidence estimates. This overconfidence has detrimental effects on important aspects of the SLAM process and affects the higher level goal of producing accurate maps for subsequent localization and path planning. This thesis proposes an alternative scalable filter that maintains sparsity while preserving the consistency of the distribution. We leverage insights into the natural structure of the feature-based canonical parametrization and derive a method that actively maintains an exactly sparse posterior. Our algorithm exploits the structure of the parametrization to achieve gains in efficiency, with a computational cost that scales linearly with the size of the map. Unlike similar techniques that sacrifice consistency for improved scalability, our algorithm performs inference over a posterior that is conservative relative to the nominal Gaussian distribution. Consequently, we preserve the consistency of the pose and map estimates and avoid the effects of an overconfident posterior. We demonstrate our filter alongside the SEIF and the standard EKF both in simulation as well as on two real-world datasets. While we maintain the computational advantages of an exactly sparse representation, the results show convincingly that our method yields conservative estimates for the robot pose and map that are nearly identical to those of the original Gaussian distribution as produced by the EKF, but at much less computational expense. The thesis concludes with an extension of our SLAM filter to a complex underwater environment. We describe a systems-level framework for localization and mapping relative to a ship hull with an Autonomous Underwater Vehicle (AUV) equipped with a forward-looking sonar. The approach utilizes our filter to fuse measurements of vehicle attitude and motion from onboard sensors with data from sonar images of the hull. We employ the system to perform three-dimensional, 6-DOF SLAM on a ship hull