Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments
arXiv:1102.0603 · doi:10.1109/TRO.2011.2174493
Abstract
We present controllers that enable mobile robots to persistently monitor or sweep a changing environment. The changing environment is modeled as a field which grows in locations that are not within range of a robot, and decreases in locations that are within range of a robot. We assume that the robots travel on given closed paths. The speed of each robot along its path is controlled to prevent the field from growing unbounded at any location. We consider the space of speed controllers that can be parametrized by a finite set of basis functions. For a single robot, we develop a linear program that is guaranteed to compute a speed controller in this space to keep the field bounded, if such a controller exists. Another linear program is then derived whose solution is the speed controller that minimizes the maximum field value over the environment. We extend our linear program formulation to develop a multi-robot controller that keeps the field bounded. The multi-robot controller has the unique feature that it does not require communication among the robots. Simulation studies demonstrate the robustness of the controllers to modeling errors, and to stochasticity in the environment.
This is an expanded version of a paper at ICRA 2011. This expanded version has been submitted to the IEEE Transactions on Robotics
Cited by in corpus (26)
- Multi-robot persistent surveillance with connectivity constraints
- Optimal active particle navigation meets machine learning
- Multi-Robot Patrolling with Sensing Idleness and Data Delay Objectives
- Monitoring Over the Long Term: Intermittent Deployment and Sensing Strategies for Multi-Robot Teams
- Optimal Tourist Problem and Anytime Planning of Trip Itineraries
- Cooperative Periodic Coverage With Collision Avoidance
- Optimizing Task Waiting Times in Dynamic Vehicle Routing
- Multi-vehicle Dynamic Water Surface Monitoring
- Optimal control for a robotic exploration, pick-up and delivery problem
- Multi-Agent Coverage Control with Energy Depletion and Repletion
- Motion and Communication Co-optimization with Path Planning and Online Channel Estimation
- An Optimal Control Approach to the Persistent Monitoring Problem
- On Sensing, Agility, and Computation Requirements for a Data-gathering Agile Robotic Vehicle
- Optimal Policies for Recovery of Multiple Systems After Disruptions
- Decentralized Event-Driven Algorithms for Multi-Agent Persistent Monitoring
- Algorithms for Visibility-Based Monitoring with Robot Teams
- Markov Chain-Based Stochastic Strategies for Robotic Surveillance
- Comparison of Centralized and Decentralized Approaches in Cooperative Coverage Problems with Energy-Constrained Agents
- Collision-Free Trajectory Design for 2D Persistent Monitoring Using Second-Order Agents
- Expedited Multi-Target Search with Guaranteed Performance via Multi-fidelity Gaussian Processes
- Optimal Threshold-Based Control Policies for Persistent Monitoring on Graphs
- Persistent Monitoring in Discrete Environments: Minimizing the Maximum Weighted Latency Between Observations
- Persistent Covering of a Graph under Latency and Energy Constraints
- Correlated Orienteering Problem and it Application to Persistent Monitoring Tasks
- Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations
- Stochastic Surveillance Strategies for Spatial Quickest Detection