Abstract
Modified bug-1 algorithm based strategy for obstacle avoidance in multi robot system
Highlights
IntroductionMobile robots have become a more fundamental part of the industry. In general, obstacle avoidance has turned out to be pre-requisite to mobile robots and this has resulted in the introduction of a large variety of algorithms to support obstacle avoidance
In recent years, mobile robots have become a more fundamental part of the industry
Obstacle avoidance has turned out to be pre-requisite to mobile robots and this has resulted in the introduction of a large variety of algorithms to support obstacle avoidance
Summary
Mobile robots have become a more fundamental part of the industry. In general, obstacle avoidance has turned out to be pre-requisite to mobile robots and this has resulted in the introduction of a large variety of algorithms to support obstacle avoidance. The leadership exchange is the backbone of the leader-follower system [6], [7] This was utilized in the present work to design an efficient multi robot obstacle avoidance strategy. This new strategy assumes that the robots in the system possess only basic sensing and movement capabilities allowing other robots to take over and complete the task in case of breakdown of the leader robot. The concept of information exchange across multiple robots [8], [9] was implemented to achieve better path navigation This new strategy is a modified BUG-1 strategy which is implemented across multiple robots for improving travel time and energy expenditure of robots and providing a better success probability of task at hand.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
