Skip to main content
SpringerLink
Log in

Homotopy conscious roadmap construction by fast sampling of narrow corridors

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Probabilistic Roadmaps are increasingly being used for robot motion planning. The method makes use of an offline construction of a roadmap. Even though the method is offline, it needs to be initially constructed as quickly as possible for an efficient and near-real time initial motion of the robot. The challenge lies in sampling of multiple narrow corridors wherein the probability of samples is very low. It is important to discover all homotopic groups very early to make good initial decisions from the roadmap. Missing out of even a single homotopic group can lead to no solution or poor solutions. The proposed method uses a multi-strategized approach for sampling of the initial points and then intelligently constructs edges between the points in a multi-strategized manner. The aim is to increase sampling at the narrow corridors and then to facilitate edge connectivity of nodes inside the corridor with the rest of the roadmap, so as to lead to the discovery of all possible homotopic groups between any pair of sources and goals. The approach results in a better performance as compared to uniform sampling and obstacle based sampling.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Kavraki LE, Latombe JC (1998) Probabilistic roadmaps for robot path planning. In: Practical motion planning in robotics: Current Approaches and Future Directions, John Wiley, pp 33–53

  2. LaValle SM (2006) Planning algorithms. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  3. Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Rob Res 30(7):846–894

    Article  MATH  Google Scholar 

  4. Kavraki LE, Svestka P, Latombe JC, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Rob Autom 12(4):566–580

    Article  Google Scholar 

  5. Bohlin R, Kavraki L E Path planning using lazy prm. In: Proceedings of the IEEE International Conference on Robotics and Automation, IEEE, pp 521–528, p 2000

  6. Amato NM, Bayazit OB, Dale LK, Jones C, Vallejo D (1998) Obprm: An Obstacle-based prm for 3d workspaces. In: Robotics: The Algorithmic Perspective, A.K. Peters, pp. 155–168

  7. Boor V, Overmars MH, van der SAF (1999) The Gaussian Sampling strategy for probabilistic roadmap planners. In: Proceedings of the IEEE international conference on robotics and automation vol. 2, IEEE, pp 1018–1023

  8. Hsu D, Jiang T, Reif J, Sun Z (2003) The bridge test for sampling narrow passages with probabilistic roadmap planners. In: Proceedings of the 2003 IEEE international conference on robotics and automation vol. 3, IEEE, pp. 4420-4426

  9. Sun Z, Hsu D, Jiang T, Kurniawati H, Reif JH (2005) Narrow passage sampling for probabilistic roadmap planning. IEEE Trans Rob 21(5):1105–1115

    Google Scholar 

  10. Aubry M (1995) Homotopy Theory and Models Birkhäuser. MA, Boston

    Book  Google Scholar 

  11. Choset H, Lynch KM, Hutchinson S, Kantor GA, Burgard W, Kavraki LE, Thrun S (2005) Principles of robot motion: Theory, algorithms, and implementations. MIT Press, Cambridge, MA

  12. Nissoux C, Simeon T, Laumond JP (1999 ) Visibility based probabilistic roadmaps. In: Proceedings of the 1999 IEEE/RSJ international conference on intelligent robots and systems vol. 3, IEEE Press, pp 1316-1321

  13. Siméon T, Laumond JP, Nissoux C (2000) Visibility-based probabilistic roadmaps for motion planning. Adv Rob 14(5):477– 493

    Article  Google Scholar 

  14. Nieuwenhuisen D, Overmars MH (2004) Useful cycles in probabilistic roadmap graphs

  15. Marble JD, Bekris KE (2011) Computing spanners of asymptotically optimal probabilistic roadmaps. In: Proceedings of the 2011 IEEE/RSJ international conference on intelligent robots and systems, IEEE, pp 4292-4298

  16. Kuffner JJ, LaValle SM (2000) RRT-connect: An efficient approach to single-query path planning. In: Proceedings of the IEEE international conference on robotics and automation vol.2, IEEE, pp 995-1001

  17. LaValle SM, Kuffner JJ (1999) Randomized kinodynamic planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, IEEE, pp. 473–479

  18. Karaman S, Frazzoli E (2010) Optimal Kinodynamic Motion Planning using Incremental Sampling-based Methods

  19. Plaku E, Bekris KE, Chen BY, Ladd AM, Kavraki LE (2005) Sampling-Based Roadmap of trees for parallel motion planning. IEEE Trans Rob 21(4):597–608

    Article  Google Scholar 

  20. Karaman S, Frazzoli E (2009) Sampling-based motion planning with deterministic μ-calculus specifications. In: IEEE International Conference on Decision and Control, IEEE, pp 2222-2229

  21. Kala R (2013) Rapidly-exploring random graphs: motion planning of multiple mobile robots. Adv Rob 27 (14):1113–1122

    Article  Google Scholar 

  22. Phillips J, Bedrossian N, Kavraki LE (2004) Guided expansive spaces trees: a search strategy for motion- and Cost-Constrained state spaces

  23. Kim CH, Sugano S (2013) A GPU parallel computing method for LPUSS. Adv Rob 27(15):1199–1207

    Article  Google Scholar 

  24. Dobson A, Bekris KE (2014) Sparse roadmap spanners for asymptotically near-optimal motion planning. Int J Rob Res 33:18–47

    Article  Google Scholar 

  25. Littlefield Z, Li Y, Bekris KE (2013) Efficient sampling-based motion planning with asymptotic near-optimality guarantees for systems with dynamics

  26. Gayle R, Sud A, Lin MC, Manocha D (2007) Reactive Deformation Roadmaps: Motion Planning of Multiple Robots in Dynamic Environments. In: Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE, San Diego, CA, pp. 3777–3783

  27. Gayle R, Sud A, Andersen E, Guy SJ, Lin MC, Manocha D (2009) Interactive navigation of heterogeneous agents using adaptive roadmaps. IEEE Trans Visual Comput Graph 15(1):34–48

    Article  Google Scholar 

  28. Quinlan S, Khatib O (1993) Elastic bands: connecting path planning and control. In: Proceedings of the 1993 IEEE International Conference on Robotics and Automation, IEEE, pp. 802–807

  29. Hilgert J, Hirsch K, Bertram T, Hiller M (2003) Emergency path planning for autonomous vehicles using elastic band theory

  30. Kala R, Warwick K (2013) Planning autonomous vehicles in the absence of speed lanes using an elastic strip. IEEE Trans Intell Transp Syst 14(3):1743–1752

    Article  Google Scholar 

  31. Nilsson NJ (1971) Problem solving methods in artificial intelligence. McGraw-Hill, New York

    Google Scholar 

  32. Kala R (2014) Coordination in navigation of multiple mobile robots. Cybern Syst 45(1):1–24

    Article  MATH  Google Scholar 

  33. Kala R, Warwick K (2013) Multi-level planning for semi-autonomous vehicles in traffic scenarios based on separation maximization. J Intell Rob Syst 72(3-4):559–590

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Robotics and Artificial Intelligence Laboratory, Indian Institute of Information Technology, Allahabad, Allahabad, Uttar Pradesh, India

    Rahul Kala

Authors
  1. Rahul Kala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rahul Kala.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kala, R. Homotopy conscious roadmap construction by fast sampling of narrow corridors. Appl Intell 45, 1089–1102 (2016). https://doi.org/10.1007/s10489-016-0808-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-016-0808-9

Keywords

Search

Navigation