Robust Localization and Efficient Path Planning for Mobile Sensor Networks

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2016. 2. 오성회.The area of wireless sensor networks has flourished over the past decade due to advances in micro-electro-mechanical sensors, low power communication and computing protocols, and embedded microprocessors. Recently, there has been a growing interest in mobile sensor networks, along with the development of robotics, and mobile sensor networks have enabled networked sensing system to solve the challenging issues of wireless sensor networks by adding mobility into many different applications of wireless sensor networks. Nonetheless, there are many challenges to be addressed in mobile sensor networks. Among these, the estimation for the exact location is perhaps the most important to obtain high fidelity of the sensory information. Moreover, planning should be required to send the mobile sensors to sensing location considering the region of interest, prior to sensor placements. These are the fundamental problems in realizing mobile sensor networks which is capable of performing monitoring mission in unstructured and dynamic environment. In this dissertation, we take an advantage of mobility which mobile sensor networks possess and develop localization and path planning algorithms suitable for mobile sensor networks. We also design coverage control strategy using resource-constrained mobile sensors by taking advantages of the proposed path planning method. The dissertation starts with the localization problem, one of the fundamental issue in mobile sensor networks. Although global positioning system (GPS) can perform relatively accurate localization, it is not feasible in many situations, especially indoor environment and costs a tremendous amount in deploying all robots equipped with GPS sensors. Thus we develop the indoor localization system suitable for mobile sensor networks using inexpensive robot platform. We focus on the technique that relies primarily on the camera sensor. Since it costs less than other sensors, all mobile robots can be easily equipped with cameras. In this dissertation, we demonstrate that the proposed method is suitable for mobile sensor networks requiring an inexpensive off-the-shelf robotic platform, by showing that it provides consistently robust location information for low-cost noisy sensors. We also focus on another fundamental issue of mobile sensor networks which is a path planning problem in order to deploy mobile sensors in specific locations. Unlike the traditional planning methods, we present an efficient cost-aware planning method suitable for mobile sensor networks by considering the given environment, where it has environmental parameters such as temperature, humidity, chemical concentration, stealthiness and elevation. A global stochastic optimization method is used to improve the efficiency of the sampling based planning algorithm. This dissertation presents the first approach of sampling based planning using global tree extension. Based on the proposed planning method, we also presents a general framework for modeling a coverage control system consisting of multiple robots with resource constraints suitable for mobile sensor networks. We describe the optimal informative planning methods which deal with maximization problem with constraints using global stochastic optimization method. In addition, we describe how to find trajectories for multiple robots efficiently to estimate the environmental field using information obtained from all robots.Chapter 1 Introduction 1 1.1 Mobile Sensor networks 1 1.1.1 Challenges 3 1.2 Overview of the Dissertation 4 Chapter 2 Background 7 2.1 Localization in MSNs 7 2.2 Path planning in MSNs 10 2.3 Informative path planning in MSNs 12 Chapter 3 Robust Indoor Localization 15 3.1 An Overview of Coordinated Multi-Robot Localization 16 3.2 Multi-Robot Localization using Multi-View Geometry 19 3.2.1 Planar Homography for Robot Localization 20 3.2.2 Image Based Robot Control 21 3.3 Multi-Robot Navigation System 25 3.3.1 Multi-Robot System 26 3.3.2 Multi-Robot Navigation 30 3.4 Experimental Results 32 3.4.1 Coordinated Multi-Robot Localization: Single-Step 32 3.4.2 Coordinated Multi-Robot Localization: Multi-Step 36 3.5 Discussions and Comparison to Leap-Frog 42 3.5.1 Discussions 42 3.5.2 Comparison to Leap-Frog 45 3.6 Summary 51 Chapter 4 Preliminaries to Cost-Aware Path Planning 53 4.1 Related works 54 4.2 Sampling based path planning 56 4.3 Cross entropy method 59 4.3.1 Cross entropy based path planning 63 Chapter 5 Fast Cost-Aware Path Planning using Stochastic Optimization 65 5.1 Problem formulation 66 5.2 Issues with sampling-based path planning for complex terrains or high dimensional spaces 68 5.3 Cost-Aware path planning (CAPP) 73 5.3.1 CE Extend 75 5.4 Analysis of CAPP 81 5.4.1 Probabilistic Completeness 81 5.4.2 Asymptotic optimality 83 5.5 Simulation and experimental results 84 5.5.1 (P1) Cost-Aware Navigation in 2D 85 5.5.2 (P2) Complex Terrain Navigation 88 5.5.3 (P3) Humanoid Motion Planning 96 5.6 Summary 103 Chapter 6 Effcient Informative Path Planning 105 6.1 Problem formulation 106 6.2 Cost-Aware informative path planning (CAIPP) 109 6.2.1 Overall procedure 110 6.2.2 Update Bound 112 6.2.3 CE Estimate 115 6.3 Analysis of CAIPP 118 6.4 Simulation and experimental results 120 6.4.1 Single robot informative path planning 120 6.4.2 Multi robot informative path planning 122 6.5 Summary 125 Chapter 7 Conclusion and Future Work 129 Appendices 131 Appendix A Proof of Theorem 1 133 Appendix B Proof of Theorem 2 135 Appendix C Proof of Theorem 3 137 Appendix D Proof of Theorem 4 139 Appendix E Dubins' curve 141 Bibliography 147 초 록 163Docto

Asymptotically Optimal Sampling-Based Motion Planning Methods

Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also optimize a cost function, such as path length. Formal path-quality guarantees for continuously valued search spaces are an active area of research interest. Recent results have proven that some sampling-based planning methods probabilistically converge toward the optimal solution as computational effort approaches infinity. This survey summarizes the assumptions behind these popular asymptotically optimal techniques and provides an introduction to the significant ongoing research on this topic.Comment: Posted with permission from the Annual Review of Control, Robotics, and Autonomous Systems, Volume 4. Copyright 2021 by Annual Reviews, https://www.annualreviews.org/. 25 pages. 2 figure

Informed anytime fast marching tree for asymptotically-optimal motion planning

In many applications, it is necessary for motion planning planners to get high-quality solutions in high-dimensional complex problems. In this paper, we propose an anytime asymptotically-optimal sampling-based algorithm, namely Informed Anytime Fast Marching Tree (IAFMT*), designed for solving motion planning problems. Employing a hybrid incremental search and a dynamic optimal search, the IAFMT* fast finds a feasible solution, if time permits, it can efficiently improve the solution toward the optimal solution. This paper also presents the theoretical analysis of probabilistic completeness, asymptotic optimality, and computational complexity on the proposed algorithm. Its ability to converge to a high-quality solution with the efficiency, stability, and self-adaptability has been tested by challenging simulations and a humanoid mobile robot

Information-theoretic Reasoning in Distributed and Autonomous Systems

The increasing prevalence of distributed and autonomous systems is transforming decision making in industries as diverse as agriculture, environmental monitoring, and healthcare. Despite significant efforts, challenges remain in robustly planning under uncertainty. In this thesis, we present a number of information-theoretic decision rules for improving the analysis and control of complex adaptive systems. We begin with the problem of quantifying the data storage (memory) and transfer (communication) within information processing systems. We develop an information-theoretic framework to study nonlinear interactions within cooperative and adversarial scenarios, solely from observations of each agent's dynamics. This framework is applied to simulations of robotic soccer games, where the measures reveal insights into team performance, including correlations of the information dynamics to the scoreline. We then study the communication between processes with latent nonlinear dynamics that are observed only through a filter. By using methods from differential topology, we show that the information-theoretic measures commonly used to infer communication in observed systems can also be used in certain partially observed systems. For robotic environmental monitoring, the quality of data depends on the placement of sensors. These locations can be improved by either better estimating the quality of future viewpoints or by a team of robots operating concurrently. By robustly handling the uncertainty of sensor model measurements, we are able to present the first end-to-end robotic system for autonomously tracking small dynamic animals, with a performance comparable to human trackers. We then solve the issue of coordinating multi-robot systems through distributed optimisation techniques. These allow us to develop non-myopic robot trajectories for these tasks and, importantly, show that these algorithms provide guarantees for convergence rates to the optimal payoff sequence

Replication or exploration? Sequential design for stochastic simulation experiments

We investigate the merits of replication, and provide methods for optimal design (including replicates), with the goal of obtaining globally accurate emulation of noisy computer simulation experiments. We first show that replication can be beneficial from both design and computational perspectives, in the context of Gaussian process surrogate modeling. We then develop a lookahead based sequential design scheme that can determine if a new run should be at an existing input location (i.e., replicate) or at a new one (explore). When paired with a newly developed heteroskedastic Gaussian process model, our dynamic design scheme facilitates learning of signal and noise relationships which can vary throughout the input space. We show that it does so efficiently, on both computational and statistical grounds. In addition to illustrative synthetic examples, we demonstrate performance on two challenging real-data simulation experiments, from inventory management and epidemiology.Comment: 34 pages, 9 figure

Bayesian Optimisation for Planning in Dynamic Environments

This thesis addresses the problem of trajectory planning for monitoring extreme values of an environmental phenomenon that changes in space and time. The most relevant case study corresponds to environmental monitoring using an autonomous mobile robot for air, water and land pollution monitoring. Since the dynamics of the phenomenon are initially unknown, the planning algorithm needs to satisfy two objectives simultaneously: 1) Learn and predict spatial-temporal patterns and, 2) find areas of interest (e.g. high pollution), addressing the exploration-exploitation trade-off. Consequently, the thesis brings the following contributions: Firstly, it applies and formulates Bayesian Optimisation (BO) to planning in robotics. By maintaining a Gaussian Process (GP) model of the environmental phenomenon the planning algorithms are able to learn the spatial and temporal patterns. A new family of acquisition functions which consider the position of the robot is proposed, allowing an efficient trajectory planning. Secondly, BO is generalised for optimisation over continuous paths, not only determining where and when to sample, but also how to get there. Under these new circumstances, the optimisation of the acquisition function for each iteration of the BO algorithm becomes costly, thus a second layer of BO is included in order to effectively reduce the number of iterations. Finally, this thesis presents Sequential Bayesian Optimisation (SBO), which is a generalisation of the plain BO algorithm with the goal of achieving non-myopic trajectory planning. SBO is formulated under a Partially Observable Markov Decision Process (POMDP) framework, which can find the optimal decision for a sequence of actions with their respective outcomes. An online solution of the POMDP based on Monte Carlo Tree Search (MCTS) allows an efficient search of the optimal action for multistep lookahead. The proposed planning algorithms are evaluated under different scenarios. Experiments on large scale ozone pollution monitoring and indoor light intensity monitoring are conducted for simulated and real robots. The results show the advantages of planning over continuous paths and also demonstrate the benefit of deeper search strategies using SBO

Multi-agent persistent surveillance under temporal logic constraints

This thesis proposes algorithms for the deployment of multiple autonomous agents for persistent surveillance missions requiring repeated, periodic visits to regions of interest. Such problems arise in a variety of domains, such as monitoring ocean conditions like temperature and algae content, performing crowd security during public events, tracking wildlife in remote or dangerous areas, or watching traffic patterns and road conditions. Using robots for surveillance is an attractive solution to scenarios in which fixed sensors are not sufficient to maintain situational awareness. Multi-agent solutions are particularly promising, because they allow for improved spatial and temporal resolution of sensor information. In this work, we consider persistent monitoring by teams of agents that are tasked with satisfying missions specified using temporal logic formulas. Such formulas allow rich, complex tasks to be specified, such as "visit regions A and B infinitely often, and if region C is visited then go to region D, and always avoid obstacles." The agents must determine how to satisfy such missions according to fuel, communication, and other constraints. Such problems are inherently difficult due to the typically infinite horizon, state space explosion from planning for multiple agents, communication constraints, and other issues. Therefore, computing an optimal solution to these problems is often infeasible. Instead, a balance must be struck between computational complexity and optimality. This thesis describes solution methods for two main classes of multi-agent persistent surveillance problems. First, it considers the class of problems in which persistent surveillance goals are captured entirely by TL constraints. Such problems require agents to repeatedly visit a set of surveillance regions in order to satisfy their mission. We present results for agents solving such missions with charging constraints, with noisy observations, and in the presence of adversaries. The second class of problems include an additional optimality criterion, such as minimizing uncertainty about the location of a target or maximizing sensor information among the team of agents. We present solution methods and results for such missions with a variety of optimality criteria based on information metrics. For both classes of problems, the proposed algorithms are implemented and evaluated via simulation, experiments with robots in a motion capture environment, or both

Planning Algorithms for Multi-Robot Active Perception

A fundamental task of robotic systems is to use on-board sensors and perception algorithms to understand high-level semantic properties of an environment. These semantic properties may include a map of the environment, the presence of objects, or the parameters of a dynamic field. Observations are highly viewpoint dependent and, thus, the performance of perception algorithms can be improved by planning the motion of the robots to obtain high-value observations. This motivates the problem of active perception, where the goal is to plan the motion of robots to improve perception performance. This fundamental problem is central to many robotics applications, including environmental monitoring, planetary exploration, and precision agriculture. The core contribution of this thesis is a suite of planning algorithms for multi-robot active perception. These algorithms are designed to improve system-level performance on many fronts: online and anytime planning, addressing uncertainty, optimising over a long time horizon, decentralised coordination, robustness to unreliable communication, predicting plans of other agents, and exploiting characteristics of perception models. We first propose the decentralised Monte Carlo tree search algorithm as a generally-applicable, decentralised algorithm for multi-robot planning. We then present a self-organising map algorithm designed to find paths that maximally observe points of interest. Finally, we consider the problem of mission monitoring, where a team of robots monitor the progress of a robotic mission. A spatiotemporal optimal stopping algorithm is proposed and a generalisation for decentralised monitoring. Experimental results are presented for a range of scenarios, such as marine operations and object recognition. Our analytical and empirical results demonstrate theoretically-interesting and practically-relevant properties that support the use of the approaches in practice

Balancing exploration and exploitation: task-targeted exploration for scientific decision-making

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 September 2022.How do we collect observational data that reveal fundamental properties of scientific phenomena? This is a key challenge in modern scientific discovery. Scientific phenomena are complex—they have high-dimensional and continuous state, exhibit chaotic dynamics, and generate noisy sensor observations. Additionally, scientific experimentation often requires significant time, money, and human effort. In the face of these challenges, we propose to leverage autonomous decision-making to augment and accelerate human scientific discovery. Autonomous decision-making in scientific domains faces an important and classical challenge: balancing exploration and exploitation when making decisions under uncertainty. This thesis argues that efficient decision-making in real-world, scientific domains requires task-targeted exploration—exploration strategies that are tuned to a specific task. By quantifying the change in task performance due to exploratory actions, we enable decision-makers that can contend with highly uncertain real-world environments, performing exploration parsimoniously to improve task performance. The thesis presents three novel paradigms for task-targeted exploration that are motivated by and applied to real-world scientific problems. We first consider exploration in partially observable Markov decision processes (POMDPs) and present two novel planners that leverage task-driven information measures to balance exploration and exploitation. These planners drive robots in simulation and oceanographic field trials to robustly identify plume sources and track targets with stochastic dynamics. We next consider the exploration- exploitation trade-off in online learning paradigms, a robust alternative to POMDPs when the environment is adversarial or difficult to model. We present novel online learning algorithms that balance exploitative and exploratory plays optimally under real-world constraints, including delayed feedback, partial predictability, and short regret horizons. We use these algorithms to perform model selection for subseasonal temperature and precipitation forecasting, achieving state-of-the-art forecasting accuracy. The human scientific endeavor is poised to benefit from our emerging capacity to integrate observational data into the process of model development and validation. Realizing the full potential of these data requires autonomous decision-makers that can contend with the inherent uncertainty of real-world scientific domains. This thesis highlights the critical role that task-targeted exploration plays in efficient scientific decision-making and proposes three novel methods to achieve task-targeted exploration in real-world oceanographic and climate science applications.This material is based upon work supported by the NSF Graduate Research Fellowship Program and a Microsoft Research PhD Fellowship, as well as the Department of Energy / National Nuclear Security Administration under Award Number DE-NA0003921, the Office of Naval Research under Award Number N00014-17-1-2072, and DARPA under Award Number HR001120C0033