Robotic Fish Path Planning based on an improved A* Algorithm

Applying the global path planning to traditional A* algorithm in a complex environment and a lot of obstacles will result in an "infinite loop" because there are too many search data. To resolve this problem, this paper provides a new divide-and-rule path planning method which is based on improved A* algorithm. It uses several transition points to divide the entire grid map areas into several sub-regions. We set different speeds in each sub-region for local path planning. Thus the complex global path planning is turned into some simple local path planning. It reduces the search data of A* algorithm and avoids falling into the "infinite loop". By this method, this paper designs the path planning of heading the ball, and smoothes the orbit. The simulation results show that the improved A* algorithm is better and more effective than the traditional one.