Enhancing the Dynamic Window Approach: Safer Navigation With Improved Local Goal Selection and Simplified Evaluation Functions

The Dynamic Window Approach (DWA) is a widely used algorithm for autonomous robot navigation. However, its conventional method for local goal selection often leads to overly aggressive behavior, compromising safety in environments with obstacles. Additionally, the standard evaluation function is often overly complex, containing redundant components that complicate parameter tuning. This paper introduces two new evaluation criteria-goaldist and fit-and a refined local goal selection method. These contributions simplify the evaluation function by addressing redundancy, reduce the complexity of parameter tuning, and promote safer and smoother navigation. Experimental results show that the proposed approach increases the robot's average and minimum distances to obstacles by 0.35 m and 0.6 m, respectively, while significantly improving navigation success rates and ensuring safer, more reliable operation.

Authors

Publication Details

Published
2025-04-18
DOI
https://doi.org/10.1109/iccar64901.2025.11072941
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing the Dynamic Window Approach: Safer Navigation With Improved Local Goal Selection and Simplified Evaluation Functions

Ziang Lin, Shengfei Li, Xiangyang Su, Yang Wang et al.
1 citations
Robotic Path Planning Algorithms
1.28
article

Enhancing the Dynamic Window Approach: Safer Navigation With Improved Local Goal Selection and Simplified Evaluation Functions

Ziang Lin, Shengfei Li, Xiangyang Su, Yang Wang, Ningning Zhang, Jun Gu
article en
1 citations

Abstract

The Dynamic Window Approach (DWA) is a widely used algorithm for autonomous robot navigation. However, its conventional method for local goal selection often leads to overly aggressive behavior, compromising safety in environments with obstacles. Additionally, the standard evaluation function is often overly complex, containing redundant components that complicate parameter tuning. This paper introduces two new evaluation criteria-goaldist and fit-and a refined local goal selection method. These contributions simplify the evaluation function by addressing redundancy, reduce the complexity of parameter tuning, and promote safer and smoother navigation. Experimental results show that the proposed approach increases the robot's average and minimum distances to obstacles by 0.35 m and 0.6 m, respectively, while significantly improving navigation success rates and ensuring safer, more reliable operation.

Openalex Percentile: Top 18%
Robotic Path Planning Algorithms
1.28
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.