BiSpace planning: Concurrent multi-space exploration

11Citations
Citations of this article
80Readers
Mendeley users who have this article in their library.

Abstract

We present a planning algorithm called BiSpace that produces fast plans to complex high-dimensional problems by simultaneously exploring multiple spaces. We specifically focus on finding robust solutions to manipulation and grasp planning problems by using BiSpace's special characteristics to explore the work and configuration spaces of the environment and robot. Furthermore, we present a number of techniques for constructing informed heuristics to intelligently search through these high dimensional spaces. In general, the BiSpace planner is applicable to any problem involving multiple search spaces.

Cite

CITATION STYLE

APA

Diankov, R., Ratliff, N., Ferguson, D., Srinivasa, S., & Kuffner, J. (2009). BiSpace planning: Concurrent multi-space exploration. In Robotics: Science and Systems (Vol. 4, pp. 159–166). MIT Press Journals. https://doi.org/10.15607/rss.2008.iv.021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free