Abstract
In this paper, A solution is proposed for the multi-robot task assignment in obstacle environment, which combines the A∗ algorithm with the genetic algorithm. Our main work are twofold:(a) Path planning method based on A∗ algorithm to search an optimal path between any robot and any target or any two targets; and (b) task assignment method based on the genetic algorithm for the assignment of robots to targets so that the total distance traveled by all robots can be as minimum as possible. Simulation experiments show that all the robots that have targets can avoid obstacle while performing the task with low cost and high velocity of convergence, meeting the real time requirements of multi-robot task assignment in obstacle environment.
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.
