Skip to main content

Small Tree Probabilistic Roadmap Planner for Hyper-Redundant Manipulators

  • Conference paper
Autonomous and Intelligent Systems (AIS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6752))

Included in the following conference series:

Abstract

This article describes a single-query probabilistic roadmap planner, called Small Tree, for hyper-redundant manipulators. The planner incrementally builds two solution paths from small alternating road-maps rooted at the two input configurations, until a connection linking both paths is found. In this manner, the solution path grows from both input queries. The process has the advantage of continuously replacing the two initial input queries, whose original connectivity in configuration space may have been difficult, with new target configurations. The method also has the ability to initiate the manipulator motion before the complete solution is found by using the partial solution path connected to the initial configuration.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Akinc, M., Bekris, K.E., Chen, B.Y., Ladd, A.M., Plaku, E., Kavraki, L.E.: Probabilistic roadmaps of trees for parallel computation of multiple query roadmaps. In: Dario, P., Chatila, R. (eds.) Robotics Research. Springer Tracts in Advanced Robotics, vol. 15, pp. 80–89. Springer, Heidelberg (2005)

    Google Scholar 

  2. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., Vallejo, D.: OBPRM: An obstacle-based PRM for 3D workspaces. In: Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics: the algorithmic perspective, pp. 155–168 (1998)

    Google Scholar 

  3. Bohlin, R., Kavraki, L.E.: Path planning using lazy PRM. In: Proceedings of the IEEE International Conference on Robotics and Automation, April 2000, vol. 1, pp. 521–528 (2000)

    Google Scholar 

  4. Dasgupta, B., Gupta, A., Singla, E.: A variational approach to path planning for hyper-redundant manipulators. Robotics and Autonomous Systems 57(2), 194–201 (2009)

    Article  Google Scholar 

  5. Geraerts, R., Overmars, M.: A comparative study of probabilistic roadmap planners. Springer Tracts in Advanced Robotics: Algorithmic Foundations of Robotics V7, 43–58 (2003)

    Google Scholar 

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

    Article  Google Scholar 

  7. Kuffner, J.J., LaValle, S.M.: RRT-Connect: An efficient approach to single-query path planning. In: Proceeding of the IEEE International Conference on Robotics and Automation, April 2000, vol. 2, pp. 995–1001 (2000)

    Google Scholar 

  8. Lanteigne, E., Jnifene, A.: Experimental study on SMA driven pressurized hyper-redundant manipulator. Journal of Intelligent Materials Systems and Structures 16(9), 1067–1076 (2008)

    Article  Google Scholar 

  9. LaValle, S.M.: Rapidly-exploring random trees: A new tool for path planning. Tech. Rep. TR 98-11, Iowa State University (October 1998)

    Google Scholar 

  10. Nielsen, C.L., Kavraki, L.E.: A two level fuzzy PRM for manipulation planning. In: Proceeding of the IEEE International Conference on Intelligent Robots and Systems, November 2000, vol. 3, pp. 1716–1721 (2000)

    Google Scholar 

  11. Saha, M., Roughgarden, T., Latombe, J.C., Sánchez-Ante, G.: Planning tours of robotic arms among partitioned goals. International Journal of Robotics Research 25(3), 207–223 (2006)

    Article  Google Scholar 

  12. Sánchez, G., Latombe, J.C.: A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In: International Symposium on Robotics Research, pp. 403–417 (2001)

    Google Scholar 

  13. Å vestka, P.: Robot motion planning using probabilistic roadmaps. Ph.D. thesis, Utrecht University, Netherlands (1997)

    Google Scholar 

  14. Vallejo, D., Remmler, I., Amato, N.M.: An adaptive framework for single shot motion planning: A self tuning system for rigid and articulated robots. In: Proceedings of the IEEE International Conference on Robotics and Automation, vol. 4, pp. 21–26 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lanteigne, E., Jnifene, A. (2011). Small Tree Probabilistic Roadmap Planner for Hyper-Redundant Manipulators. In: Kamel, M., Karray, F., Gueaieb, W., Khamis, A. (eds) Autonomous and Intelligent Systems. AIS 2011. Lecture Notes in Computer Science(), vol 6752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21538-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21538-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21537-7

  • Online ISBN: 978-3-642-21538-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics