Waypoint-Based Path Planning for Autonomous Robots with PSO

  • Gustavo Manhenti Faustino UFABC
  • Mateus Coelho Silva UFABC

Resumo


Autonomous robots are essential for numerous applications requiring high precision and involving significant risks. However, planning and optimizing paths for a single robot in a dynamic environment remains a highly complex task. This challenge necessitates a balance between obstacle avoidance, distance optimization, and efficiency. Traditional strategies often utilize a wide range of path planning algorithms, such as local avoidance, A*, and ACO. Nevertheless, an approach employing waypoints and a “danger zone” in conjunction with a Particle Swarm Optimization (PSO) algorithm can be an effective method for path optimization. Here, we demonstrate that this path planning algorithm provides an efficient and rapid means to generate a path to a goal in an environment with a single obstacle. Through simulations conducted in IR-SIM, a Python-based robotics simulator, we show that a customized PSO, equipped with a multi-objective fitness function, effectively analyzes both intersections with an area around the obstacle (the “danger zone”) and the total path distance. This approach yields paths with over a 97% success rate in guiding the robot to its goal and exhibits relatively low convergence times. Our results illustrate PSO’s effectiveness as a path planning algorithm, highlighting its adaptability to various types of obstacles and positions within a 2D environment. This strategy represents an advancement in the use of heuristic algorithms for autonomous robot path planning, leading to a faster, less computationally demanding algorithm with a high success rate, capable of avoiding diverse obstacle types and easily adaptable to a broad range of single-robot environmental problems.
Palavras-chave: autonomous robotics, PSO, path optimization, routing, path planning

Referências

Y. Rivero-Moreno, M. Rodriguez, P. Losada-Muñoz, S. Redden, S. Lopez-Lezama, A. Vidal-Gallardo, D. Machado-Paled, J. C. Guilarte, S. Teran-Quintero, Y. Rivero et al., “Autonomous robotic surgery: has the future arrived?” Cureus, vol. 16, no. 1, 2024.

Y. Lu, “Autonomous robots for transport applications.” International Journal of Advanced Computer Science & Applications, vol. 15, no. 7, 2024.

S. S. Alam, T. Ahmed, M. S. Islam, and M. M. F. Chowdhury, “A smart approach for human rescue and environment monitoring autonomous robot,” International Journal of Mechanical Engineering and Robotics Research, vol. 10, no. 4, pp. 209–215, 2021.

S. Fu, D. Yang, Z. Mei, and W. Zheng, “Progress in construction robot path-planning algorithms,” Applied Sciences, vol. 15, no. 3, p. 1165, 2025.

M. Jain, V. Saihjpal, N. Singh, and S. B. Singh, “An overview of variants and advancements of pso algorithm,” Applied Sciences, vol. 12, no. 17, p. 8392, 2022.

H. Qin, S. Shao, T. Wang, X. Yu, Y. Jiang, and Z. Cao, “Review of autonomous path planning algorithms for mobile robots,” Drones, vol. 7, no. 3, p. 211, 2023.

S. Alarabi, C. Luo, and M. Santora, “A prm approach to path planning with obstacle avoidance of an autonomous robot,” in 2022 8th international conference on automation, robotics and applications (ICARA). IEEE, 2022, pp. 76–80.

T. A. Teli and M. A. Wani, “A fuzzy based local minima avoidance path planning in autonomous robots,” International Journal of Information Technology, vol. 13, no. 1, pp. 33–40, 2021.

B. Song, Z. Wang, and L. Zou, “On global smooth path planning for mobile robots using a novel multimodal delayed pso algorithm,” Cognitive Computation, vol. 9, no. 1, pp. 5–17, 2017.

E. Masehian and D. Sedighizadeh, “A multi-objective pso-based algorithm for robot path planning,” in 2010 IEEE international conference on industrial technology. IEEE, 2010, pp. 465–470.
Publicado
24/11/2025
FAUSTINO, Gustavo Manhenti; SILVA, Mateus Coelho. Waypoint-Based Path Planning for Autonomous Robots with PSO. In: WORKSHOP LATINOAMERICANO DE DEPENDABILIDADE E SEGURANÇA EM SISTEMAS VEICULARES (SSV), 2. , 2025, Campinas/SP. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2025 . p. 29-32.