Topology-Aware Efficient Path Planning in Dynamic Environments

This study presents a path-planning approach toward efficient obstacle avoidance in dynamic environments. The developed approach features the awareness of the topological structure of the dynamic environment at a planning instant. It is achieved by employing a homology class path planner to generate a set of non-homotopy global paths. The global paths are cast into tree structures separately and optimized by the developed sampling-based path-planning methods. This mechanism can adaptively adjust the optimizing step size according to the change in the dynamic environment, and the sampling module uses the Gaussian Mixture Model (GMM) Optimizer to control the sampling space. The approach seeks the globally optimal path as it maintains and optimizes homology classes of admissible candidate paths of distinctive topologies in parallel. We conduct various experiments in dynamic environments to verify the developed method’s effectiveness and efficiency. It is demonstrated that the developed method can perform better than the state of the art.

Authors

Institutions

Publication Details

Journal
Machines
Published
2024-12-29
DOI
https://doi.org/10.3390/machines13010014
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Topology-Aware Efficient Path Planning in Dynamic Environments

Xuewen Rong, Jiamin Guo, Haoning Zhao, Chaoqun Wang et al.
Machines
Robotic Path Planning Algorithms
article

Topology-Aware Efficient Path Planning in Dynamic Environments

Xuewen Rong, Jiamin Guo, Haoning Zhao, Chaoqun Wang, Yibin Li
article en

Abstract

This study presents a path-planning approach toward efficient obstacle avoidance in dynamic environments. The developed approach features the awareness of the topological structure of the dynamic environment at a planning instant. It is achieved by employing a homology class path planner to generate a set of non-homotopy global paths. The global paths are cast into tree structures separately and optimized by the developed sampling-based path-planning methods. This mechanism can adaptively adjust the optimizing step size according to the change in the dynamic environment, and the sampling module uses the Gaussian Mixture Model (GMM) Optimizer to control the sampling space. The approach seeks the globally optimal path as it maintains and optimizes homology classes of admissible candidate paths of distinctive topologies in parallel. We conduct various experiments in dynamic environments to verify the developed method’s effectiveness and efficiency. It is demonstrated that the developed method can perform better than the state of the art.

MachinesVol. 13(1)
Shandong University (CN)
Texas Space Grant Consortium, Shandong University, National Key Research and Development Program of China
Sustainable cities and communities
Openalex Percentile: Top 76%
Robotic Path Planning Algorithms
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.

Topology-Aware Efficient Path Planning in Dynamic Environments — Xuewen Rong, Jiamin Guo, et al. · Machines (2024) | TGRS Research Map | TGRS