Fast Path Planning Algorithm for the RoboCup Small Size League

被引：0

作者：

Rodriguez, Saith ^{[1
]}

Rojas, Eyberth ^{[1
]}

Perez, Katherin ^{[1
]}

Lopez, Jorge ^{[1
]}

Quintero, Carlos ^{[1
]}

Calderon, Juan ^{[1
,2
]}

机构：

[1] Univ Santo Tomas, Bogota, Colombia

[2] Univ S Florida, Tampa, FL USA

来源：

ROBOCUP 2014: ROBOT WORLD CUP XVIII | 2015年 / 8992卷

关键词：

Path planning; Mobile robots; Real-time systems; RoboCup;

D O I：

10.1007/978-3-319-18615-3_33

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Plenty of work based on the Rapidly-exploring Random Trees (RRT) algorithm for path planning in real time has been developed recently. This is the most used algorithm by the top research teams in the Small Size League of RoboCup. Nevertheless, we have concluded that other simpler alternatives show better results under these highly dynamic environments. In this work, we propose a new path planning algorithm that meets all the robotic soccer challenges requirements, which has already been implemented in the STOx's team for the RoboCup competition in 2013. We have evaluated the algorithm's performance using metrics such as the smoothness of the paths, the traveled distance and the processing time and compared it with the RRT algorithm's. The results showed improved performance over RRT when combined measures are used.

引用

页码：407 / 418

页数：12

共 9 条

[1] Bruce J., 2006, LECT NOTES COMPUTER, V4434, P532
[2] Desaraju VR, 2011, IEEE INT CONF ROBOT
[3] Han K, 1998, IEEE INT CONF ROBOT, P3510, DOI 10.1109/ROBOT.1998.680981
[4] Jing Xiao, 1997, IEEE Transactions on Evolutionary Computation, V1, P18, DOI 10.1109/4235.585889
[5] Kitano H., 1995, P IJCAI 95 WORKSH EN, P340
[6] LaValle S. M., 1998, Tech. Rep.
[7] LaValle SM, 2001, ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS, P293
[8] Ould-Khessal N., 2004, 2 INT C AUT ROB AG P, P429
[9] TSUBOUCHI T, 1994, IEEE INT CONF ROBOT, P2470, DOI 10.1109/ROBOT.1994.351140

← 1 →