In this paper, a planning method based on the spatiotemporal variable-step-size A*
algorithm is proposed to address the problem of safe trajectory planning for incremental …

When mobile robot used in large-scale dynamic environments, it face more challenging
problems in real-time path planning and collision-free path tracking. This paper presents a …

To ensure the collision safety of mobile robots, the velocity of dynamic obstacles should be
considered while planning the robot's trajectory for high-speed navigation tasks. A planning …

In view of the problems of A∗ algorithm in path planning, such as collision risk, the path is
not necessarily optimal, and there are numerous turning nodes. Therefore, this study …

An improved path planning algorithm based on dynamic window approach (DWA) is
proposed to optimize real-time paths for agents moving in complex environments with plenty …

In response to challenges faced by mobile robots in global path planning within high-
resolution grid maps—such as excessive waypoints, low efficiency, inability to evade …

Path planning of a mobile robot in the presence of multiple moving obstacles is found to be a
complicated problem. A planning algorithm capable of negotiating both static and moving …

The fusion of the A* and the dynamic windowing algorithm is commonly used for the path
planning of mobile robots in dynamic environments. However, the planned path has the …

Aiming at the needs of global optimal path planning and real-time obstacle avoidance for
mobile robots, a path planning method based on the fusion of an improved A* algorithm and …

This paper studies a hierarchical approach for incrementally driving a nonholonomic mobile
robot to its destination in unknown environments. The \rmA^∗ algorithm is modified to …