Searching Heuristically Optimal Path Using a New Technique of Bug0 Algorithm in Swarm Robotics

Abstract

Bug Algorithms in robotics field play an important role in path planning. The main challenge in conventional bug algorithms is searching the cluttered environment. To solve this problem a method is introduced which uses the concept of swarm robotics that helps in finding path using coordination between robots in swarm. The challenge in this research article is to find a path which is heuristically optimal. A type of bug algorithm is introduced in which parent bug sends two of its child bugs. Each of them has capability of searching in different directions. After searching the path from both sides, parent bug follows the path which is heuristically optimal. Parent and child bugs are equipped with tactile sensors to follow the perimeter of an obstacle. Illustrative simulation results show two test cases in which different scenarios are presented. Results are compared with of bug0 algorithm that is visualized in configuration space as well as in workspace to find the heuristically optimal path.

Keywords

• mobile robotics
• swarm robotics
• heuristics
• path planning
• bug algorithm
• motion planning