In this paper we study the problem of path planning among movable obstacles, in which a robot is allowed to move the obstacles if they block the robot's way from a start to a goal position. We make the observation that we can decouple the computations of the robot motions and the obstacle movements, and present a probabilistically complete algorithm, something which to date has not been achieved for this problem. Our algorithm maintains an explicit representation of the robot's configuration space. We present an efficient implementation for the case of planar, axis-aligned environments and report experimental results on challenging scenarios. © 2009 Springer-Verlag.
CITATION STYLE
Van Den Berg, J., Stilman, M., Kuffner, J., Lin, M., & Manocha, D. (2010). Path planning among movable obstacles: A probabilistically complete approach. In Springer Tracts in Advanced Robotics (Vol. 57, pp. 599–614). https://doi.org/10.1007/978-3-642-00312-7_37
Mendeley helps you to discover research relevant for your work.