Skip to main content

Path Planning among Movable Obstacles: A Probabilistically Complete Approach

  • Chapter
Algorithmic Foundation of Robotics VIII

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 57))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alami, R., Laumond, J.-P., Siméon, T.: Two manipulation planning algorithms. In: Proc. Workshop on Algorithmic Foundations of Robotics, pp. 109–125 (1995)

    Google Scholar 

  2. Ben-Shahar, O., Rivlin, E.: Practical pushing planning for rearrangement tasks. IEEE Trans. on Robotics and Automation 14(4), 549–565

    Google Scholar 

  3. Canny, J.: The complexity of robot motion planning. MIT Press, Cambridge (1987)

    Google Scholar 

  4. Chadzelek, T., Eckstein, J., Schömer, E.: Heuristic motion planning with movable obstacles. In: Proc. Canadian Conf. on Computational Geometry, pp. 211–219 (2000)

    Google Scholar 

  5. Chen, P., Hwang, Y.: Practical path planning among movable obstacles. In: Proc. IEEE Int. Conf. on Robotics and Automation, pp. 444–449 (1991)

    Google Scholar 

  6. Demaine, E., Demaine, M., O’Rourke, J.: Pushpush and Push-1 are NP-hard in 2D. In: Proc. Canadian Conf. on Computational Geometry, pp. 211–219 (2000)

    Google Scholar 

  7. Hsu, D., Kindel, R., Latombe, J.-C., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. Int. J. of Robotics Research 21(3), 233–255 (2002)

    Article  Google Scholar 

  8. Kavraki, L., Švestka, P., Latombe, J.-C., Overmars, M.: Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566–580 (1996)

    Article  Google Scholar 

  9. LaValle, S., Kuffner, J.: Rapidly-exploring random trees: progress and prospects. In: Proc. Workshop on Algorithmic Foundations of Robotics (2000)

    Google Scholar 

  10. Nieuwenhuisen, D., van der Stappen, F., Overmars, M.: An effective framework for path planning amidst movable obstacles. In: Proc. Workshop on Algorithmic Foundations of Robotics (2006)

    Google Scholar 

  11. Ota, J.: Rearrangement of multiple movable objects. In: Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1962–1967 (2004)

    Google Scholar 

  12. Sánchez, G., Latombe, J.-C.: Using a PRM planner to compare centralized and decoupled planning for multi-robot systems. In: Proc. IEEE Int. Conf. on Robotics and Automation, pp. 2112–2119 (2002)

    Google Scholar 

  13. Siméon, T., Laumond, J.-P., Cortés, J., Sahbani, A.: Manipulation planning with probabilistic roadmaps. Int. J. of Robotics Research 23(7-8), 729–746 (2004)

    Article  Google Scholar 

  14. Stilman, M., Kuffner, J.: Navigation among movable obstacles: real-time reasoning in complex environments. Int. J. of Humanoid Robotics 2(4), 479–504 (2005)

    Article  Google Scholar 

  15. Stilman, M., Kuffner, J.: Planning among movable obstacles with artificial constraints. In: Proc. Workshop on Algorithmic Foundations of Robotics (2006)

    Google Scholar 

  16. Stilman, M., Schamburek, J.-U., Kuffner, J., Asfour, T.: Manipulation planning among movable obstacles. In: Proc. IEEE Int. Conf. on Robotics and Automation, pp. 3327–3332 (2007)

    Google Scholar 

  17. Švestka, P., Overmars, M.: Coordinated path planning for multiple robots. Robotics and Autonomous Systems 23(3), 125–152 (1998)

    Article  Google Scholar 

  18. Wein, R., Fogel, E., Zukerman, B., Halperin, D.: 2D Arrangements. CGAL User and Reference Manual, ch. 20 (2007)

    Google Scholar 

  19. Wilfong, G.: Motion planning in the presence of movable obstacles. Annals of Mathematics and Artificial Intelligence 3, 131–150 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

van den Berg, J., Stilman, M., Kuffner, J., Lin, M., Manocha, D. (2009). Path Planning among Movable Obstacles: A Probabilistically Complete Approach. In: Chirikjian, G.S., Choset, H., Morales, M., Murphey, T. (eds) Algorithmic Foundation of Robotics VIII. Springer Tracts in Advanced Robotics, vol 57. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00312-7_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00312-7_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00311-0

  • Online ISBN: 978-3-642-00312-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics