Efficient informative sensing using multiple robots
From MaRDI portal
Abstract: The need for efficient monitoring of spatio-temporal dynamics in large environmental applications, such as the water quality monitoring in rivers and lakes, motivates the use of robotic sensors in order to achieve sufficient spatial coverage. Typically, these robots have bounded resources, such as limited battery or limited amounts of time to obtain measurements. Thus, careful coordination of their paths is required in order to maximize the amount of information collected, while respecting the resource constraints. In this paper, we present an efficient approach for near-optimally solving the NP-hard optimization problem of planning such informative paths. In particular, we first develop eSIP (efficient Single-robot Informative Path planning), an approximation algorithm for optimizing the path of a single robot. Hereby, we use a Gaussian Process to model the underlying phenomenon, and use the mutual information between the visited locations and remainder of the space to quantify the amount of information collected. We prove that the mutual information collected using paths obtained by using eSIP is close to the information obtained by an optimal solution. We then provide a general technique, sequential allocation, which can be used to extend any single robot planning algorithm, such as eSIP, for the multi-robot problem. This procedure approximately generalizes any guarantees for the single-robot problem to the multi-robot case. We extensively evaluate the effectiveness of our approach on several experiments performed in-field for two important environmental sensing applications, lake and river monitoring, and simulation experiments performed using several real world sensor network data sets.
Recommendations
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Mobile Robot Sensing for Environmental Applications
- Near-optimal continuous patrolling with teams of mobile information gathering agents
- Robotic data mules for collecting data over sparse sensor fields
- Cooperative adaptive sampling of random fields with partially known covariance
Cited in
(9)- Spatial coverage in routing and path planning problems
- Learning excursion sets of vector-valued Gaussian random fields for autonomous ocean sampling
- Informative path planning as a maximum traveling salesman problem with submodular rewards
- Adaptive action for multi-agent persistent coverage
- Cooperative adaptive sampling of random fields with partially known covariance
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Adaptive submodular ranking and routing
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- Near-optimal task-driven sensor network configuration
This page was built for publication: Efficient informative sensing using multiple robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651456)
