Skip to content
Conference Open access

Energy-Aware Mobile Robot Path Planning Using Dynamic Window Approach

Aug 2026 · International Conference on Automation and Computing · pp. 1-6 · 0 citations · 17 references

TL;DR

This work extends the Dynamic Window Approach by incorporating a heuristic electromechanical energy model into the local trajectory evaluation and shows that incorporating the energy term improves the smoothness of the commanded motion, as reflected by lower translational and angular velocity variation metrics than the non-energy baseline.

Abstract

Efficient path planning is a key requirement for autonomous mobile robots because it directly affects both navigation performance and operating cost. This work extends the Dynamic Window Approach (DWA) by incorporating a heuristic electromechanical energy model into the local trajectory evaluation. By considering the estimated energy in the cost function, the modified planner can balance heading, obstacle clearance, speed, and energy consumption during local path selection. Simulation results on two test maps show that the proposed extension reduces the total energy consumption by 3.6% and 8.6%, respectively, with an average saving of 6.1% compared with the classical DWA, while also reducing the simulated travel time, the number of planning steps, and the overall elapsed time. A sensitivity analysis further shows that incorporating the energy term improves the smoothness of the commanded motion, as reflected by lower translational and angular velocity variation metrics than the non-energy baseline. In particular, the best tested weighting combination reduced the v-variation from 18.60 to 1.16 and the ω-variation from 34.17 to 9.84, while also achieving the lowest total energy consumption. Although the average power increases, the overall energy decreases because the robot completes the motion in a shorter time. The results also indicate that path length alone is not a sufficient indicator of energy efficiency. Overall, the proposed energy-aware DWA improves mission-level efficiency and yields smoother velocity profiles without compromising successful local navigation.

Read PDF

Similar papers

Open access Oct 2026

Robot movement path planning integrating A* algorithm and dynamic window

To address the coupled problem of insufficient global path geometric smoothness and slow local dynamic obstacle avoidance response in mobile robots operating in unstructured and complex environments, a hierarchical path planning model integrating the improved A* algorithm and the fuzzy adaptive dynamic window method is...

Xin-Yue Cui · 0 citations
Open access Oct 2026

Improved DWA-Based Local Path Planning for Multi-Robot Navigation

The Dynamic Window Approach (DWA) evaluates candidate motions for local robot navigation. This paper presents an Improved Dynamic Window Approach (IDWA) with two changes to trajectory evaluation. First, a distance threshold selects a near-term reference state on each predicted trajectory for heading evaluation. Second,...

Jia-Hao Zhu, Yuan-Kang Wang, Kai Liao et al. · 0 citations
Conference Oct 2026

Performance comparison of RRT-series algorithms for mobile robot path planning

This paper presents a comparative performance evaluation of three sampling-based path planning algorithms—RRT, RRT-Connect, and RRT*—for mobile robot navigation in complex environments. Experiments are conducted on three obstacle-avoidance maps with two distinct path-length scenarios, using path length, planning time,...

Jia-Jun Liu · 0 citations
Conference Oct 2026

A hybrid A* mobile robot path planning algorithm based on geometric-kinematic-dynamic three-level pruning

The classical A* algorithm, when applied to mobile robot path planning, struggles to simultaneously satisfy kinematic and dynamic constraints while maintaining planning efficiency. Moreover, the mainstream L1+L2 two-level kinematic pruning hybrid A* algorithm suffers from state expansion redundancy, high computational...

Ze-Nan Zhang, Jin-Cheng Hu, Jia-Cheng Wang · 0 citations
Open access Sep 2026

Research on Robot Path Planning Based on Improved A* Algorithm

Robot path planning is a key core technology for realizing autonomous navigation of robots. Among them, the A* algorithm has been widely used due to its good balance between path optimality and search efficiency. However, the traditional A* algorithm faces problems such as excessive expansion nodes, numerous path infle...

Shao-Wei Hao · 2 citations
Conference Oct 2026

An improved A*-DWA mobile robot path planning algorithm considering path smoothing and dynamic obstacle avoidance

To reduce redundant search, frequent path turning, and trajectory oscillation in mobile robot navigation, this paper proposes an improved A*-DWA fusion path planning algorithm considering path smoothing and dynamic obstacle avoidance. In the global planning stage, a joint cost function integrating a dynamic heuristic w...

Xin-Yu Li · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.