A Dubins path is a shortest path with bounded curvature. The seminal result in nonholonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory technique...

This paper presents an integrated approach to mobile robot path planning by combining grid-map based and case-based methods. The map-based path planner is used to suggest new innovative solutions for a particular path planning problem. A probabilistic path transform method is introduced for grid-map based path planning which proposes several alternative solutions for a single path planning prob...

This paper describes a novel idea of path planning for multiple UAVs (Unmanned Aerial Vehicles). The path planning ensures safe and simultaneous arrival of the UAVs to the target while meeting curvature and safety constraints. Pythagorean Hodograph (PH) curve is used for path planning. The PH curve provides continuous curvature of the paths. The offset curves of the PH paths define safety margi...

This paper proposes a hybrid path planning algorithm incorporating a global and local search mechanism for mobile robot. The global path planning is based on Voronoi graph to establish a backbone path for the map with significantly reduced nodes for the original grid map. With the use of the backbone path, the D* algorithm is adopted to determine a shortest path between the starting and end poi...

Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on ran...

Along with the development of robot technology, a robot not only need to complete a specific task, but aslo need to do path planning in the process of performing the task. So, path planning is widly studied. This paper introduce a method of robot path planning based on reinforcement learning,which aimed at Markovian decision process. In this paper, we introduce the basic concept, principle and ...

This paper discusses GA-based motion planning in 3D space for underwater robotic vehicles. We propose a genetic algorithm (GA) for path planning which generates a collision-free path in an environment with two kinds of obstacles: Solid and hazardous obstacles such that a path cannot intersect solid obstacles while it can intersect hazardous obstacles at the expense of extra costs. The most impo...

This paper presents a mission planning method for planetary rover. As a decision support system, mission planning is important for rover navigation and control. Generating travel path and task sequence synchronously is the key point. In this paper, the environment model of planetary surface is summed up as two parts which are obstacle map and timeline. According to this, the mission planner uti...

This paper proposes genetic algorithms (GAs) for path planning and trajectory planning of an autonomous mobile robot. Our GA-based approach has an advantage of adaptivity such that the GAs work even if an environment is time-varying or unknown. Therefore, it is suitable for both o -line and on-line motion planning. We rst presents a GA for path planning in a 2D terrain. Simulation results on th...

The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation of environment models is described. When planning the path of each robot, the graph model of environment is dynamically changed for path correction and collision avoidance. New algorithm applies changes of robots’ paths and spe...