A New Algorithm for Path Planning in Dynamic Environments based on Modified Artificial Potential Field Model and Modified Ant-Q Algorithm

Artificial potential field and Ant-Q are effective methods for path planning problems. In this paper, several improvements are made for these two methods. First, a new model of repulsive field is proposed to improve the safety of paths. Second, the risk on a path is defined and quantified as a measurement of path quality to further ensure security. Finally, a new algorithm is designed based on these two modified methods. It extends the application field of the ant-Q algorithm to dynamic path planning and meanwhile overcomes the disadvantages of the artificial potential field method. Experiments show that the new algorithm achieved up to an 86% reduction in computational time and a 5.5% reduction in time costs of paths while maintaining safety in environments with dynamic obstacles and targets.

Authors

Institutions

Publication Details

Published
2024-08-15
DOI
https://doi.org/10.1109/prai62207.2024.10827541
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Algorithm for Path Planning in Dynamic Environments based on Modified Artificial Potential Field Model and Modified Ant-Q Algorithm

Jinghao Zhang
Robotic Path Planning Algorithms
article

A New Algorithm for Path Planning in Dynamic Environments based on Modified Artificial Potential Field Model and Modified Ant-Q Algorithm

Jinghao Zhang
article en

Abstract

Artificial potential field and Ant-Q are effective methods for path planning problems. In this paper, several improvements are made for these two methods. First, a new model of repulsive field is proposed to improve the safety of paths. Second, the risk on a path is defined and quantified as a measurement of path quality to further ensure security. Finally, a new algorithm is designed based on these two modified methods. It extends the application field of the ant-Q algorithm to dynamic path planning and meanwhile overcomes the disadvantages of the artificial potential field method. Experiments show that the new algorithm achieved up to an 86% reduction in computational time and a 5.5% reduction in time costs of paths while maintaining safety in environments with dynamic obstacles and targets.

Shanghai Jiao Tong University (CN)
Sustainable cities and communities
Openalex Percentile: Top 75%
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.