A Bug-based Path Planner Guided with Homotopy Classes

Emili Hernández, Marc Carreras, Pere Ridao

Abstract

This paper proposes a bug-based path planning algorithm guided topologically with homotopy classes. Homotopy classes provide a topological description of how paths avoid obstacles in the workspace. They are generated with a method we developed, which builds a topological environment based on the workspace that allows to compute homotopy classes systematically. The homotopy classes are sorted according to a heuristic estimation of their lower bound. Only those with the smaller lower bound are used to guide the path planner we propose, called Homotopic Bug (HBug), which efficiently computes paths in the workspace that accomplish homotopy classes. Results show the feasibility of our method. A comparison with well-known path planners has also been included.

References

  1. Antich, J., Ortiz, A., and Minguez, J. (2009). A buginspired algorithm for efficient anytime path planning. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 5407 -5413.
  2. Bespamyatnikh, S. (2003). Computing homotopic shortest paths in the plane. Journal of Algorithms, 49:284- 303.
  3. Efrat, A., Kobourov, S., and Lubiw, A. (2002). Computing homotopic shortest paths efficiently. In Mö hring, R. and Raman, R., editors, Algorithms - ESA 2002, volume 2461 of Lecture Notes in Computer Science, pages 277-288. Springer Berlin / Heidelberg.
  4. Fabrizi, E. and Saffiotti, A. (2000). Extracting topologybased maps from gridmaps. In IEEE International Conference on Robotics and Automation (ICRA), pages 2972-2978.
  5. Ferguson, D., Likhachev, M., and Stentz, A. (2005). A guide to heuristic-based path planning. In Proceedings of the International Workshop on Planning under Uncertainty for Autonomous Systems, International Conference on Automated Planning and Scheduling (ICAPS).
  6. Ferguson, D. and Stentz, A. (2006). Anytime RRTs. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 5369 - 5375.
  7. Fujita, Y., Nakamura, Y., and Shiller, Z. (2003). Dual dijkstra search for paths with different topologies. In IEEE International Conference on Robotics and Automation (ICRA), volume 3, pages 3359-3364.
  8. Grigoriev, D. and Slissenko, A. (1998). Polytime algorithm for the shortest path in a homotopy class amidst semialgebraic obstacles in the plane. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 17-24, New York, NY, USA. ACM.
  9. Hernández, E., Carreras, M., Antich, J., Ridao, P., and A.Ortiz (2011a). A topologically guided path planner for an AUV using homotopy classes. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages 2337-2343, Shanghai, China.
  10. Hernández, E., Carreras, M., Antich, J., Ridao, P., and Ortiz, A. (2011b). A search-based path planning algorithm with topological constraints. Application to an AUV. In Proceedings of the 18th IFAC World Congress, Milan, Italy.
  11. Hernández, E., Carreras, M., and Ridao, P. (2011c). A path planning algorithm for an AUV guided with homotopy classes. In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS), Freiburg, Germany.
  12. Jenkins, K. D. (1991). The shortest path problem in the plane with obstacles: A graph modeling approach to producing finite search lists of homotopy classes.
  13. Likhachev, M., Gordon, G., and Thrun, S. (2004). ARA*: Anytime A* with provable bounds on sub-optimality. In Proceedings of the Advances in Neural Inforamtion Processing Systems 16 (NIPS). MIT Press.
  14. Lumelsky, V. and Stepanov, A. (1987). Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica, 2:403-430.
  15. Schmitzberger, E., Bouchet, J., Dufaut, M., Wolf, D., and Husson, R. (2002). Capture of homotopy classes with probabilistic road map. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), volume 3, pages 2317-2322.
  16. Takahashi, O. and Schilling, R. (1989). Motion planning in a plane using generalized voronoi diagrams. IEEE Transactions on Robotics and Automation, 5(2):143 - 150.
Download


Paper Citation


in Harvard Style

Hernández E., Carreras M. and Ridao P. (2012). A Bug-based Path Planner Guided with Homotopy Classes . In Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO, ISBN 978-989-8565-22-8, pages 123-131. DOI: 10.5220/0004041201230131


in Bibtex Style

@conference{icinco12,
author={Emili Hernández and Marc Carreras and Pere Ridao},
title={A Bug-based Path Planner Guided with Homotopy Classes},
booktitle={Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,},
year={2012},
pages={123-131},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004041201230131},
isbn={978-989-8565-22-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,
TI - A Bug-based Path Planner Guided with Homotopy Classes
SN - 978-989-8565-22-8
AU - Hernández E.
AU - Carreras M.
AU - Ridao P.
PY - 2012
SP - 123
EP - 131
DO - 10.5220/0004041201230131