A Path Planning Method to Robot Soccer Based on Dijkstra Algorithm

摘要

As a typical and very challenging multi-agent system, Robot Soccer System is considered by many researchers as an ideal research platform for multi-agent system, and its purpose is to study multi-robot (or agent) in a complex dynamic environment and multiple constraints, the completion of multi-task and multi-target for real-time reasoning and planning techniques which has far-reaching significance for the future society. Dijkstra algorithm is the most typical short-circuit algorithm used to calculate the shortest path of a node to all other nodes. Main features of a starting point as the center expand outward of layers, until the end of the extension. In this paper, the algorithm is applied to the robot soccer path planning and obstacle avoidance control and made a good effect. After Recognition the environment, Robot Soccer can determine the shortest path timely and the method has been applied to the actual robot control.