Open Access iconOpen Access

ARTICLE

crossmark

Real-Time Dynamic Multiobjective Path Planning: A Case Study

Hongle Li1, SeongKi Kim2,*

1 School of Computer, Tonghua Normal University, Tonghua, 134001, China
2 Department of Computer Engineering, Chosun University, Gwangju, 61452, Republic of Korea

* Corresponding Author: SeongKi Kim. Email: email

(This article belongs to the Special Issue: Algorithms for Planning and Scheduling Problems)

Computers, Materials & Continua 2025, 85(3), 5571-5594. https://doi.org/10.32604/cmc.2025.067424

Abstract

Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles, as well as the realism and immersion of virtual environments. However, traditional algorithms are often limited to single-objective optimization and lack real-time adaptability to dynamic environments. This study addresses these limitations through a proposed real-time dynamic multiobjective (RDMO) path-planning algorithm based on an enhanced A* framework. The proposed algorithm employs a queue-based structure and composite multiheuristic functions to dynamically manage game tasks and compute optimal paths under changing-map-connectivity conditions in real time. Simulation experiments are conducted using real-world road network data and benchmarked against mainstream hybrid approaches based on genetic algorithms (GAs) and simulated annealing (SA). The results show that the computational speed of the RDMO algorithm is 88 and 73 times faster than that of the GA- and SA-based solutions, respectively, while the total planned path length is reduced by 58% and 33%, respectively. In addition, the RDMO algorithm also shows excellent responsiveness to dynamic changes in map connectivity and can achieve real-time replanning with a minimal computational overhead. The research results prove that the RDMO algorithm provides a robust and efficient solution for multiobjective path planning in games and robotics applications and has a great application potential in improving system performance and user experience in related fields in the future.

Keywords

Multiobjective optimization; path planning; real-time system; dynamic environments; A* algorithm; game artificial intelligence

Cite This Article

APA Style
Li, H., Kim, S. (2025). Real-Time Dynamic Multiobjective Path Planning: A Case Study. Computers, Materials & Continua, 85(3), 5571–5594. https://doi.org/10.32604/cmc.2025.067424
Vancouver Style
Li H, Kim S. Real-Time Dynamic Multiobjective Path Planning: A Case Study. Comput Mater Contin. 2025;85(3):5571–5594. https://doi.org/10.32604/cmc.2025.067424
IEEE Style
H. Li and S. Kim, “Real-Time Dynamic Multiobjective Path Planning: A Case Study,” Comput. Mater. Contin., vol. 85, no. 3, pp. 5571–5594, 2025. https://doi.org/10.32604/cmc.2025.067424



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 746

    View

  • 214

    Download

  • 0

    Like

Share Link