Abstract
This paper describes an extended Genetic Algorithm Approach for path planning of multiple mobile robots with obstacle detection and avoidance in static and dynamic scenarios. Through the software Netlogo, used in simulations of multi-agent applications, a model was developed for the given problem. The model, which contains multiple robots and a scenario with several dynamic and static obstacles, is responsible for determining the best path used by the robots to achieve the goal state in a shorter number of steps and avoiding collisions. Additionally, a performance evaluation of this model in comparison with A* algorithm is presented.
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.
