The Exact Euclidean Distance Transform: A new algorithm for universal path planning

International Journal of Advanced Robotic Systems

Volumn 10, Issue , 2013, Pages

  Elizondo Leal, Juan Carlos ^a   Parra González, Ezra Federico ^a   Ramírez Torres, José Gabriel ^a  

^a DEPARTAMENTO DE FÍSICA   (Mexico)

Author keywords

Cell decomposition; Distance transform; Path Planning

Indexed keywords

CELL DECOMPOSITION; DISTANCE TRANSFORMS; EXACT EUCLIDEAN DISTANCE; MOBILE ROBOTIC; PATH PLANNING PROBLEMS; POST PROCESSING; TOTAL DISTANCES; UTILITY MEASURE;

ALGORITHMS; CELLS; CYTOLOGY;

MOTION PLANNING;

EID: 84879243034     PISSN: 17298806     EISSN: 17298814     Source Type: Journal    
DOI: 10.5772/56581     Document Type: Article

References (20)

1. Yamauchi B (1997). A frontier-based approach for autonomous exploration. CIRA '97: Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation, page 146, Washington, DC, USA.
2. Elizondo-Leal J C, Ramírez-Torres G and Toscano Pulido G (2008). Multi-robot exploration and mapping using self biddings and stop signals. MICAI, Lecture Notes in Computer Science Springer, 5317: 615-625.
3. Burgard W, Moors M, Stachniss C and Schneider F (2005). Coordinated multi-robot exploration. IEEE Transactions on Robotics and Automation, 21: 376-386.
4. Lozano-Perez T and Wesley M (1979). An Algorithm for Planning Collision-free Paths among Polyhedral Obstacles. Communication of the ACM, 22: 560-570.
5. Xiao J, Michalewicz Z, Zhang L and Trojanowski K (1997). Adaptive evolutionary planner/navigator for mobile robots. IEEE Transactions on Evolutionary Computation, 1: 18-28
6. Bylander T (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2): 165-204.
7. Masehian E and Sedighizadeh D (2007). Classic and heuristic approaches in robot motion planning-a chronological review. World Academy of Science, Engineering and Technology, 23: 101-106
8. Meyer J A and Filliat D (2003). Map-based navigation in mobile robots. ii. a review of map-learning and path-planning strategies. Cognitive Systems Research, 4(4): 283-317.
9. Schoppers M (1987). Universal plans for reactive robots in unpredictable environments. IJCAI: 1039-1046.
10. Latombe J C (1991). Robot Motion Planning. Kluver Academic Publishers, Boston, MA.
11. Elizondo-Leal J C and Ramírez-Torres G (2010). An Exact Euclidean Distance Transform for Universal Path Planning. Cerma, 2010 IEEE Electronics, Robotics and Automotive Mechanics Conference: 62-67
12. Khatib O (1986). Real-time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research, 5(1): 90-99.
13. Barraquand J, Langlois B and Latombe J (1992). Numerical potential field techniques for robot path planning. IEEE Transactions on Systems, Man and Cybernetics, 22(2): 224-241.
14. Jarvis R A (1985). collision-free trajectory planning using distance transform. Proc. National Conference and Exhibition on Robotics, Melbourne, 20-24th Aug. 1984, also in Mechanical Engineering Transactions, Journal of the Institution of Engineers, ME10(3): 187-191.
15. Rosenfeld A and Pfaltz J (1966). Sequential operations in digital picture processing. Journal of the ACM, 13(4): 471-494.
16. Jarvis R (2006). Robot path planning: complexity, flexibility and application scope. PCAR '06: Proceedings of the 2006 international symposium on Practical cognitive agents and robots: 3-14.
17. Lozano-Pérez T and Wesley M A (1979). An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM, 22: 560-570.
18. Lavalle S M (1998). Rapidly-exploring random trees: A new tool for path planning. Technical report.
19. Lee D (1996). The map-building and exploration strategies of a simple sonar-equipped mobile robot. Cambridge University Press, New York, NY, USA.
20. Bresemham J (1987). Ambiguities in incremental line rastering. IEEE Comput. Graph. Appl., 7: 31-43.