Generating informative paths for persistent sensing in unknown environments

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 127-130).In this thesis, we present an adaptive control law for a team of robots to shape their paths to locally optimal configurations for sensing an unknown dynamical environment. As the robots travels through their paths, they identify the areas where the environment is dynamic and shape their paths to sense these areas. A Lyapunov-like stability proof is used to show that, under the proposed adaptive control law, the paths converge to locally optimal configurations according to a Voronoi-based coverage task, i.e. informative paths. The problem is first treated for a single robot and then extended to multiple robots. Additionally, the controllers for both the single-robot and the multi-robot case are extended to treat the problem of generating informative paths for persistent sensing tasks. Persistent sensing tasks are concerned with controlling the trajectories of mobile robots to act in a growing field in the environment in a way that guarantees that the field remains bounded for all time. The extended informative path controllers are proven to shape the paths into informative paths that are useful for performing persistent sensing tasks. Lastly, prior work in persistent sensing tasks only considered robotic systems with collision-free paths. In this thesis we also describe a solution to multi-robot persistent sensing, where robots have intersecting trajectories. We develop collision and deadlock avoidance algorithms and quantify the impact of avoiding collision on the overall stability of the persistent sensing task. Simulated and experimental results support the proposed approach.by Daniel Eduardo Soltero.S.M

Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations

This paper introduces a new mobile sensor scheduling problem, involving a single robot tasked with monitoring several events of interest that occur at different locations. Of particular interest is the monitoring of transient events that can not be easily forecast. Application areas range from natural phenomena ({\em e.g.}, monitoring abnormal seismic activity around a volcano using a ground robot) to urban activities ({\em e.g.}, monitoring early formations of traffic congestion using an aerial robot). Motivated by those and many other examples, this paper focuses on problems in which the precise occurrence times of the events are unknown {\em a priori}, but statistics for their inter-arrival times are available. The robot's task is to monitor the events to optimize the following two objectives: {\em (i)} maximize the number of events observed and {\em (ii)} minimize the delay between two consecutive observations of events occurring at the same location. The paper considers the case when a robot is tasked with optimizing the event observations in a balanced manner, following a cyclic patrolling route. First, assuming the cyclic ordering of stations is known, we prove the existence and uniqueness of the optimal solution, and show that the optimal solution has desirable convergence and robustness properties. Our constructive proof also produces an efficient algorithm for computing the unique optimal solution with $O(n)$ time complexity, in which $n$ is the number of stations, with $O(\log n)$ time complexity for incrementally adding or removing stations. Except for the algorithm, most of the analysis remains valid when the cyclic order is unknown. We then provide a polynomial-time approximation scheme that gives a $(1+\epsilon)$-optimal solution for this more general, NP-hard problem

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

A Study on Multirobot Quantile Estimation in Natural Environments

Quantiles of a natural phenomena can provide scientists with an important understanding of different spreads of concentrations. When there are several available robots, it may be advantageous to pool resources in a collaborative way to improve performance. A multirobot team can be difficult to practically bring together and coordinate. To this end, we present a study across several axes of the impact of using multiple robots to estimate quantiles of a distribution of interest using an informative path planning formulation. We measure quantile estimation accuracy with increasing team size to understand what benefits result from a multirobot approach in a drone exploration task of analyzing the algae concentration in lakes. We additionally perform an analysis on several parameters, including the spread of robot initial positions, the planning budget, and inter-robot communication, and find that while using more robots generally results in lower estimation error, this benefit is achieved under certain conditions. We present our findings in the context of real field robotic applications and discuss the implications of the results and interesting directions for future work.Comment: 7 pages, 2 tables, 7 figure

iRotate: Active Visual SLAM for Omnidirectional Robots

In this paper, we present an active visual SLAM approach for omnidirectional robots. The goal is to generate control commands that allow such a robot to simultaneously localize itself and map an unknown environment while maximizing the amount of information gained and consuming as low energy as possible. Leveraging the robot's independent translation and rotation control, we introduce a multi-layered approach for active V-SLAM. The top layer decides on informative goal locations and generates highly informative paths to them. The second and third layers actively re-plan and execute the path, exploiting the continuously updated map and local features information. Moreover, we introduce two utility formulations to account for the presence of obstacles in the field of view and the robot's location. Through rigorous simulations, real robot experiments, and comparisons with state-of-the-art methods, we demonstrate that our approach achieves similar coverage results with lesser overall map entropy. This is obtained while keeping the traversed distance up to 39% shorter than the other methods and without increasing the wheels' total rotation amount. Code and implementation details are provided as open-source.Comment: 13 pages, 11 figures, 3 tables. Submitted to RAS - Elsevie