Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/78247
Title: Multi-robot informative path planning for active sensing of environmental phenomena: A tale of two algorithms
Authors: Cao, N.
Low, K.H. 
Dolan, J.M.
Keywords: Active learning
Adaptive sampling
Gaussian process
Multi-robot exploration and mapping
Non-myopic path planning
Issue Date: 2013
Source: Cao, N.,Low, K.H.,Dolan, J.M. (2013). Multi-robot informative path planning for active sensing of environmental phenomena: A tale of two algorithms. 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013 1 : 7-14. ScholarBank@NUS Repository.
Abstract: A key problem of robotic environmental sensing and monitoring is that of active sensing: How can a team of robots plan the most informative observation paths to minimize the uncertainty in modeling and predicting an environmental phenomenon? This paper presents two principled approaches to efficient information-theoretic path planning based on entropy and mutual information criteria for in situ active sensing of an important broad class of widely-occurring environmental phenomena called anisotropic fields. Our proposed algorithms are novel in addressing a trade-off between active sensing performance and time efficiency. An important practical consequence is that our algorithms can exploit the spatial correlation structure of Gaussian process-based anisotropic fields to improve time efficiency while preserving near-optimal active sensing performance. We analyze the time complexity of our algorithms and prove analytically that they scale better than state-of-the-art algorithms with increasing planning horizon length. We provide theoretical guarantees on the active sensing performance of our algorithms for a class of exploration tasks called transect sampling, which, in particular, can be improved with longer planning time and/or lower spatial correlation along the transect. Empirical evaluation on real-world anisotropic field data shows that our algorithms can perform better or at least as well as the state-of-the-art algorithms while often incurring a few orders of magnitude less computational time, even when the field conditions are less favorable. Copyright © 2013, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
Source Title: 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013
URI: http://scholarbank.nus.edu.sg/handle/10635/78247
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

39
checked on Jan 14, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.