Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning

Abstract

In many environmental monitoring scenarios, the sampling robot needs to simultaneously explore the environment and exploit features of interest with limited time. We present an anytime multi-objective informative planning method called Pareto Monte Carlo tree search which allows the robot to handle potentially competing objectives such as exploration versus exploitation. The method produces optimized decision solutions for the robot based on its knowledge (estimation) of the environment state, leading to better adaptation to environmental dynamics. We provide algorithmic analysis on the critical tree node selection step and show that the number of times choosing sub-optimal nodes is logarithmically bounded and the search result converges to the optimal choices at a polynomial rate.

arXiv commentProceeding in Robotics: Science and Systems (RSS) 2019 (http://www.roboticsproceedings.org/rss15/p72.html)

References in corpus (3)

• A Survey of Multi-Objective Sequential Decision-Making
• Efficient Informative Sensing using Multiple Robots
• An Approach to Autonomous Science by Modeling Geological Knowledge in a Bayesian Framework

Cited by in corpus (7)

• Subdimensional Expansion for Multi-objective Multi-agent Path Finding
• Adaptive Robotic Information Gathering via Non-Stationary Gaussian Processes
• A Practical Guide to Multi-Objective Reinforcement Learning and Planning
• A Local Optimization Framework for Multi-Objective Ergodic Search
• Feature Space Exploration For Planning Initial Benthic AUV Surveys
• Efficient Map Prediction via Low-Rank Matrix Completion
• Multi-Objective Autonomous Exploration on Real-Time Continuous Occupancy Maps