Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...

finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. due to simplicity and smoothness of ferguson spline, it has been employed for path planning between arbitrary points on the field in many research teams. in order to optimize the parameters of ferguson spline some evolutionary or intelligent al...

the problem of navigation among movable obstacles (namo) is to find a collision free path for a robot while the robot is able to manipulate and transfer some objects (if possible or needed) to clear its path toward the goal. namo is a np-complete problem and is in a class of motion planning problems that have dynamic environments. in this domain, an optimal plan for the robot can be defined wit...

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

With the development of robotics and artificial intelligence field unceasingly thorough, path planning as an important field of robot calculation has been widespread concern. This paper analyzes the current development of robot and path planning algorithm and focuses on the advantages and disadvantages of the traditional intelligent path planning as well as the path planning. The problem of mob...

Path planning is a crucial algorithmic approach for designing robot behaviors. Sampling-based approaches, like rapidly exploring random trees (RRTs) or probabilistic roadmaps, are prominent solutions path problems. Despite its exponential convergence rate, RRT can only find suboptimal paths. On the other hand, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://ww...

The problem of automatic collision-free path planning is central to mobile robot applications. An approach to automatic path planning based on a quadtree representation is presented. Hierarchical path-searching methods are introduced, which make use of this multireso-lution representation, to speed up the path planning process considerably. The applicability of this approach to mobile robot pat...