Path planning and obstacle avoidance utilizing chameleon swarm algorithm

摘要

Path planning and obstacle avoidance are crucial tasks in the robotics and autonomous industry. Path planning seeks to determine the most efficient path between a start and an end point, whereas obstacle avoidance seeks to avoid collisions with static or dynamic obstacles in the environment. On this work, we utilize the Chameleon Swarm Algorithm (CSA), which is a metaheuristic approach, for path planning and obstacle avoidance on a predetermined map with static obstacles. This CSA extracted the optimal path from several possible different paths, and the results showed that it has slightly superior performance compared to PSO.