Graphics processing unit-enabled path planning based on global evolutionary dynamic programming and local genetic algorithm optimization

This paper presents a novel path planning method for real-time robotic path planning in a dynamic environment involving moving obstacles. It combines on a holistic platform a global approach to rapidly generate initial paths of prominent diversity and a heuristic approach to enable local path refinement for enhanced computational efficiency, exploration, and robustness. The global approach innovates a formulation that treats a path planning problem with a visibility graph as a Markov decision process and decomposes the process into many subproblems. A new evolutionary dynamic programming approach (EDP) is proposed to solve these subproblems in an iterative manner using graphics processing unit (GPU) computing to allow backpropagation of state values from goal to start points. The EDP generates multiple feasible initial paths with salient state values, each initializing an independent genetic algorithm (GA) optimization on waypoints only near the mobile robot, and all GAs are run in parallel on GPU, further improving exploration and convergence speed. The strategy to fully utilize CPU/GPU resources for various components in the pipeline is also established. The proposed algorithms are then implemented on an edge computing device (Jetson AGX Xavier) onboard a mobile robot (TurtleBot 3 Waffle Pi). Optimal paths can be continuously generated at the rate of 0.1 seconds/path, enabling successful obstacle avoidance and robot navigation through dynamic environments and, hence, verifying the real-time capabilities and accuracy of the present method. Compared to other benchmarks, the present method greatly enhances path planning robustness, computing speed, and path quality. • Path planning problem is treated as a Markov decision process. • A new evolutionary dynamic programming approach (EDP) is proposed. • All genetic algorithms (GAs) are run in parallel on GPU. • It is implemented on an edge computing device onboard a mobile robot.

Authors

Institutions

Publication Details

Journal
Applied Soft Computing
Published
2025-04-19
DOI
https://doi.org/10.1016/j.asoc.2025.113167
Citations
2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.55

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graphics processing unit-enabled path planning based on global evolutionary dynamic programming and local genetic algorithm optimization

Ge Song, Junlin Ou, Yi Wang
2 citations
Applied Soft Computing
Robotic Path Planning Algorithms
2.55
article

Graphics processing unit-enabled path planning based on global evolutionary dynamic programming and local genetic algorithm optimization

Ge Song, Junlin Ou, Yi Wang
article en
2 citations

Abstract

This paper presents a novel path planning method for real-time robotic path planning in a dynamic environment involving moving obstacles. It combines on a holistic platform a global approach to rapidly generate initial paths of prominent diversity and a heuristic approach to enable local path refinement for enhanced computational efficiency, exploration, and robustness. The global approach innovates a formulation that treats a path planning problem with a visibility graph as a Markov decision process and decomposes the process into many subproblems. A new evolutionary dynamic programming approach (EDP) is proposed to solve these subproblems in an iterative manner using graphics processing unit (GPU) computing to allow backpropagation of state values from goal to start points. The EDP generates multiple feasible initial paths with salient state values, each initializing an independent genetic algorithm (GA) optimization on waypoints only near the mobile robot, and all GAs are run in parallel on GPU, further improving exploration and convergence speed. The strategy to fully utilize CPU/GPU resources for various components in the pipeline is also established. The proposed algorithms are then implemented on an edge computing device (Jetson AGX Xavier) onboard a mobile robot (TurtleBot 3 Waffle Pi). Optimal paths can be continuously generated at the rate of 0.1 seconds/path, enabling successful obstacle avoidance and robot navigation through dynamic environments and, hence, verifying the real-time capabilities and accuracy of the present method. Compared to other benchmarks, the present method greatly enhances path planning robustness, computing speed, and path quality. • Path planning problem is treated as a Markov decision process. • A new evolutionary dynamic programming approach (EDP) is proposed. • All genetic algorithms (GAs) are run in parallel on GPU. • It is implemented on an edge computing device onboard a mobile robot.

Applied Soft ComputingVol. 176
University of South Carolina (US)
University of South Carolina, Scheme for Promotion of Academic and Research Collaboration
Openalex Percentile: Top 11%
Robotic Path Planning Algorithms
2.55
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.