Abstract

This paper presents a novel simplified mathematical modeling that can solve a path planning problem comprising three agents in a triangular formation. The problem is modeled to optimize the trajectories of the agents and to minimize the distances traveled. The trajectories are obtained in a way that deviates them from fixed obstacles whose dimensions are known. Furthermore, geometry and orientation constraints of the formation of the multi-agent are imposed. Heuristics methods such as the Genetic Algorithm, Differential Evolution and Particle Swarm Optimization are applied to solve the non-linear algebraic equations which represent the system. Comparisons are presented among the results of the different methods highlighting the processing time and the convergence to the global minimum solution. The results prove that all the algorithms can be applied to the path planning problem with constraints. The Particle Swarm Optimization method presents the lowest processing time for all simulated cases. However, the Differential Evolution method is more robust than the others when searching for the global minimum solution.

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 call

Disclaimer: 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.