Homotopy Path Planning for Terrestrial Robots Using Spherical Algorithm

被引:31
作者
Diaz-Arango, Gerardo [1 ]
Vazquez-Leal, Hector [2 ]
Hernandez-Martinez, Luis [1 ]
Sanz Pascual, Maria Teresa [1 ]
Sandoval-Hernandez, Mario [3 ,4 ]
机构
[1] Natl Inst Astrophys Opt & Elect, Elect Dept, Puebla 72840, Mexico
[2] Univ Veracruzana, Elect Instrumentat & Atmospher Sci Sch, Xalapa 91000, Veracruz, Mexico
[3] Univ Xalapa, Ciencia Cultura & Tecnol, Xalapa 91190, Veracruz, Mexico
[4] Ctr Bachillerato Tecnol Ind & Serv, Veracruz 91777, Veracruz, Mexico
关键词
Homotopy continuation methods (HCMs); mobile robotics; open motion planning library; path planning algorithm; robot operating system (ROS); spherical path tracking algorithm;
D O I
10.1109/TASE.2016.2638208
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Autonomous and semiautonomous mobile robots play an important role in making tasks in environments considered hostile or dangerous for a human being. In order to execute many of the required tasks, robots need, in its architecture, a module of navigation with an appropriate path planning algorithm. This paper presents the development and implementation of a methodology for path planning of a mobile robot using a spherical algorithm and homotopy continuation methods (HCMs). The first section is a brief introduction about HCMs. Subsequently, the homotopy path planning method and spherical path tracking algorithm are explained, as well as the upgraded version and its main features. Then, the main contributions of this paper are presented and the effectiveness of the proposed method is proved. Besides, numerical examples, implementation results in multiple platforms including a 32b microcontroller and robot operating system, are displayed. Finally, some favorable results from a comparative between the proposed methodology against sampling-based planners using the open motion planning library are presented.
引用
收藏
页码:567 / 585
页数:19
相关论文
共 41 条
[1]   Probability-one homotopy maps for mixed complementarity problems [J].
Ahuja, Kapil ;
Watson, Layne T. ;
Billups, Stephen C. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2008, 41 (03) :363-375
[2]  
Allgower E. L., 2003, CLASSICS APPL MATH, P7, DOI [10.1137/1.9780898719154.bm, DOI 10.1137/1.9780898719154.BM]
[3]  
[Anonymous], 2006, Planning algorithms
[4]  
[Anonymous], BRIT J MATH COMPUT S, DOI DOI 10.5402/2011/610637
[5]   Shortest path planning for a tethered robot [J].
Brass, Peter ;
Vigan, Ivo ;
Xu, Ning .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09) :732-742
[6]  
Brock O., 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), P550, DOI 10.1109/ROBOT.2000.844111
[7]  
Buniyamin N., 2011, Int. J. Syst. Appl., Eng. Dev., V5, P151
[8]  
Castaneda MAP., 2008, Motion planning
[9]  
Castaneda-Sheissa R., 2012, P INT IBERCHIP WORKS, P160
[10]  
Corke P.I., 2011, Robotics, Vision Control: Fundamental Algorithms in MATLAB