Backward-forward search for manipulation planning
Lists
Only you see this
Abstract
In this paper we address planning problems in high-dimensional hybrid configuration spaces, with a particular focus on manipulation planning problems involving many objects. We present the hybrid backward-forward (HBF) planning algorithm that uses a backward identification of constraints to direct the sampling of the infinite action space in a forward search from the initial state towards a goal configuration. The resulting planner is probabilistically complete and can effectively construct long manipulation plans requiring both prehensile and nonprehensile actions in cluttered environments.
BibTeX
@inproceedings{garrett2015backward,
author = {Caelan Reed Garrett and Tomás Lozano-Pérez and Leslie Pack Kaelbling},
title = {{Backward-forward search for manipulation planning}},
booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2015},
doi = {10.1109/iros.2015.7354287},
}Loading related content...