The problem of path planning is studied for the case of a mobile robot moving in an environment
filled with obstacles whose shape and positions are not known. Under the accepted …

… for solving mobile robot path planning problems in static and dynamic environments. The
Genetic Algorithm Planner (GAP) utilizes variable length chromosomes for path encoding. The …

… path planning problem of mobile robots in dynamic environments. Path planning for a mobile
robot finds a feasible path … GA has been widely used to generate an optimal path by taking …

… -time dynamic path planning method for autonomous driving that avoids both static and
moving obstacles. The proposed path planning method determines not only an optimal path, but …

… The type of path planning we investigate is dynamic. Dynamic path planning is problematic
because the path needs to be continually recomputed as new information becomes available…

… In this paper, we suggest to solve the problem of path planning in dynamic environments
by reducing arbitrary moving objects to stationary objects. The solution combines linear …

… prior knowledge of the dynamic environment. … dynamic distance landscape has a better
physical meaning than the neural-activity landscape, and it offers faster and better path planning…

… path planning algorithm and solve the generalization problem by means of local path planning
… In this paper, DDQN local path planning algorithm is transplanted into ROS in the form of …

… Path planning has been one … path planning algorithm is to provide a collision free path from
a start state to an end state within the configuration space of the robot. Probabilistic planning …

… path and planning efficiency of global path planning for intelligent driving, this paper proposes
a global dynamic path planning … path and planning efficiency of global path planning for …