in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...

Path planning is the key task in the field of Robotics. The modelling environment and algorithm to find shortest, collision free path are the basic issues in the path planning problem of the robot motion planning. This paper presents a literature review of different path planning techniques in static as well as dynamic environment. Planning a path in static environment is easy as compared to dy...

In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous ...

Route planning techniques is one of the main tasks of VRP (Vehicles route planning) which aims to find an optimal route from a starting point to a destination. Various techniques have been proposed so far to calculate shortest path in VANET by different researchers. This paper presents a study about the two well-known shortest path searching algorithms, which are used in routing. They are Bellm...

The problem of nding a shortest path through a known environment has been well studied. A more realistic and challenging problem is navigation through an unknown environment, where path planning is implemented \on the y" as new obstacle information becomes available through external sensors. A conditional shortest path is a path of shortest Euclidean distance that is computed based on the avail...

Path planning in mobile robots must ensure optimality of the path. The optimality achieved may be in path, time, energy consumed etc. Path planning in robots also depends on the environment in which it operates like, static or dynamic, known or unknown etc. Global path planning using A* algorithm and genetic algorithm is investigated in this paper. A known dynamic environment, in which a contro...

While using drones (UAVs) for remote surveillance missions, it is mandatory to do path planning of the vehicle since these are pilot-less vehicles. Path planning, whether offline (more popular) or online, entails setting up the path as a sequence of locations in the 3D Euclidean space, whose coordinates happen to be latitude, longitude and altitude. For the specific application of remote survei...

We consider the problem of planning shortest paths for a tethered robot with a finite length tether in a 2D environment with polygonal obstacles. We present an algorithm that runs in time O((kl +l)2rL4) and finds the shortest path or correctly determines that none exists that obeys the constraints;here n is the numberobstaclevertices,and kl is the numberloops in the initial configurationof the ...

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...