Machine Learning for Efficient Sampling-Based Algorithms in Robust Multi-Agent Planning Under Uncertainty
Name
Quindlen17_GNC.pdf
Size
9.09 MB
Format
Adobe PDF
Checksum (MD5)
a7e8681e668947ffe53ed45014cc9b80
Author(s)
Quindlen, John Francis
How, Jonathan P
Date Issued
January 2017
Journal
AIAA Guidance, Navigation, and Control Conference
Publisher
American Institute of Aeronautics and Astronautics (AIAA)
Citation
Quindlen, John F., and Jonathan P. How. “Machine Learning for Efficient Sampling-Based Algorithms in Robust Multi-Agent Planning Under Uncertainty.” AIAA Guidance, Navigation, and Control Conference (January 2017) © 2017 American Institute of Aeronautics and Astronautics Inc
Version
Author's final manuscript
Abstract
Robust multi-agent planning algorithms have been developed to assign tasks to cooperative teams of robots operating under various uncertainties. Often, it is difficult to evaluate the robustness of potential task assignments analytically, so sampling-based approximations are used instead. In many applications, not only are sampling-based approximations the only solution, but these samples are computationally-burdensome to obtain. This paper presents a machine learning procedure for sampling-based approximations that actively selects samples in order to maximize the accuracy of the approximation with a limited number of samples. Gaussian process regression models are constructed from a small set of training samples and used to approximate the robustness evaluation. Active learning is then used to iteratively select samples that most improve this evaluation. Three example problems demonstrate that the new procedure achieves a similar level of accuracy as the existing sample-inefficient procedures, but with a significant reduction in the number of samples.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.2514/6.2017-1921
