Generating informative paths for persistent sensing in unknown environments

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2012

Author dc:creator

• Soltero, Daniel Eduardo

Advisor dc:contributor.advisor

• Daniela Rus.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/75687

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/75687