Dynamic Guidance Point Obstacle Avoidance Planning Method and Optimization Based on DWA

Currently, global-local two-layer path planning is usually adopted when robots perform area coverage cleaning tasks in unfamiliar environments. However, due to the limited detection range of the sensors carried by the robot, when the robot encounters unknown obstacles during the planning of local paths, the robot is prone to deviate from the original planned route during obstacle avoidance, resulting in a decrease in the coverage rate of the cleaning task. To solve this problem, this paper proposes a dynamic guided point obstacle avoidance method based on the Dynamic Window Approach (DWA). The method is that when the robot performs the cleaning task, through constantly updating the perception information and environmental data, the system dynamically selects the guide point on the global path as the temporary target point, and then constantly adjusts the driving direction and speed to ensure that the robot can return to the preset global path while avoiding obstacles. In addition, the evaluation function is improved for this application scenario. This enables the robot to safely and smoothly avoid obstacles when operating autonomously in unfamiliar environments, navigate and travel autonomously in the global path, and improve cleaning task coverage.

Authors

Institutions

Publication Details

Published
2024-11-08
DOI
https://doi.org/10.1109/iccsi62669.2024.10799233
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Guidance Point Obstacle Avoidance Planning Method and Optimization Based on DWA

Yuhao Lv, Huanyu Yang, Jun Wang, Xian‐Chun Zhang
1 citations
Robotic Path Planning Algorithms
0.25
article

Dynamic Guidance Point Obstacle Avoidance Planning Method and Optimization Based on DWA

Yuhao Lv, Huanyu Yang, Jun Wang, Xian‐Chun Zhang
article en
1 citations

Abstract

Currently, global-local two-layer path planning is usually adopted when robots perform area coverage cleaning tasks in unfamiliar environments. However, due to the limited detection range of the sensors carried by the robot, when the robot encounters unknown obstacles during the planning of local paths, the robot is prone to deviate from the original planned route during obstacle avoidance, resulting in a decrease in the coverage rate of the cleaning task. To solve this problem, this paper proposes a dynamic guided point obstacle avoidance method based on the Dynamic Window Approach (DWA). The method is that when the robot performs the cleaning task, through constantly updating the perception information and environmental data, the system dynamically selects the guide point on the global path as the temporary target point, and then constantly adjusts the driving direction and speed to ensure that the robot can return to the preset global path while avoiding obstacles. In addition, the evaluation function is improved for this application scenario. This enables the robot to safely and smoothly avoid obstacles when operating autonomously in unfamiliar environments, navigate and travel autonomously in the global path, and improve cleaning task coverage.

Nanjing University of Science and Technology (CN)
Openalex Percentile: Top 43%
Robotic Path Planning Algorithms
0.25
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.

Dynamic Guidance Point Obstacle Avoidance Planning Method and Optimization Based on DWA — Yuhao Lv, Huanyu Yang, et al. · (2024) | TGRS Research Map | TGRS