Humanoid manipulation planning using backward-forward search
Abstract
This paper explores combining task and manipulation planning for humanoid robots. Existing methods tend to either take prohibitively long to compute for humanoids or artificially limit the physical capabilities of the humanoid platform by restricting the robot's actions to predetermined trajectories. We present a hybrid planning system which is able to scale well for complex tasks without relying on predetermined robot actions. Our system utilizes the hybrid backward-forward planning algorithm for high-level task planning combined with humanoid primitives for standing and walking motion planning. These primitives are designed to be efficiently computable during planning, despite the large amount of complexity present in humanoid robots, while still informing the task planner of the geometric constraints present in the problem. Our experiments apply our method to simulated pick-and-place problems with additional gate constraints impacting navigation using the DRC-HUBO1 robot. Our system is able to solve puzzle-like problems on a humanoid within a matter of minutes.
Additional Information
© 2016 IEEE. This work was supported in part by DARPA grant D15AP00006, NSF grants 1420927 and 1523767, ONR grant N00014-14-1-0486, and ARO grant W911NF1410433.Additional details
- Eprint ID
- 92698
- DOI
- 10.1109/IROS.2016.7759804
- Resolver ID
- CaltechAUTHORS:20190205-155646129
- Defense Advanced Research Projects Agency (DARPA)
- D15AP00006
- NSF
- IIS-1420927
- NSF
- IIS-1523767
- Office of Naval Research (ONR)
- N00014-14-1-0486
- Army Research Office (ARO)
- W911NF1410433
- Created
-
2019-02-06Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field