Comparison and Analysis of the DVG+A* and Rapidly-Exploring Random Trees Path-Planners for the RoboCup-Small Size League

摘要

This paper provides an experimental analysis between Dynamic Visibility Graph A Star (DVG+A*) and Rapidly-exploring Random Trees (RRT) path-planners, in order to compare which one is more adequate to the scenario presented in the Small Size League (SSL). The metrics used to compare each algorithm were established based on the characteristics of a SSL game, which demand a short path, low computational cost and a safe distance from the opponent robots. For the comparison, both algorithms were tested in static and dynamic environments. After all the tests, DVG+A* has shown the best results.