Abstract
Although there are many motion planning techniques, there is no method that outperforms all others for all problem instances. Rather, each technique has different strengths and weaknesses which makes it best-suited for certain types of problems. Moreover, since an environment can contain vastly different regions, there may not be a single planner that will perform well in all its regions. Ideally, one would use a suite of planners in concert and would solve the problem by applying the best-suited planner in each region. In this paper, we propose an automated framework for feature-sensitive motion planning. We use a machine learning approach to characterize and partition C-space into regions that are well suited to one of the methods in our library of roadmap-based motion planners. After the best-suited method is applied in each region, the resulting region roadmaps are combined to form a roadmap of the entire planning space. Over a range of problems, we demonstrate that our simple prototype system reliably outperforms any of the planners on their own.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Morales, M., Tapia, L., Pearce, R., Rodriguez, S., Amato, N.M. A Machine Learning Approach for Feature-Sensitive Motion Planning. In: Erdmann, M., Overmars, M., Hsu, D., van der Stappen, F. (eds) Algorithmic Foundations of Robotics VI. Springer Tracts in Advanced Robotics, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10991541_25
Download citation
DOI: https://doi.org/10.1007/10991541_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25728-8
Online ISBN: 978-3-540-31506-3
eBook Packages: EngineeringEngineering (R0)