Constrained motion planning and Manipulation planning, for generic non-linear constraints, highly rely on the ability of solving non-linear equations. The Newton-Raphson method, often used in this context, is discontinuous with respect to its input and point wise path projection can lead to discontinuous constrained paths. The discontinuities come from the pseudo-inverse involved at each iterat...

This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane with a passive revolute third joint. Such a robot is small-time locallycontrollableon an open subset of its zero velocity section, allowing it to follow any path in this subset arbitrarily closely. However, some paths are “preferred” by the dynamics of the manipulator in that...

Nonholonomic behavior is observed in free-floating manipulator systems, and is due to the nonintegrability of the angular momentum. Free-floating manipulators exhibit dynamic singularities which cannot be predicted by the kinematic properties of the system and whose location in the workspace is path dependent. Trouble-free Path Independent Workspaces are defined. A joint space planning techniqu...

Abstract— In this paper, the trajectory planning of a two-link rehabilitation robot arm is addressed. Firstly, a Cartesian planning of the trajectory is defined to perform a proper motion exercise for the patient’s arm. Secondly, a trajectory planning in joint space is studied to obtain a similar Cartesian path with less computational complexity. The robot arm analyzed is the two degrees of fre...

the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

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 methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...

While the current part carries the title “path planning” the contributions in this section covers two topics: mapping and planning. In some sense one might argues that intelligent (autonomous) mapping actually requires path planning. While this is correct the contributions actually have a broader scope as is outlined below. A common theme to all of the presentations in this section is the adopt...

This paper studies motion planning from one zero-velocity state to another for a three-joint robot in a horizontal plane with a passive revolute third joint. Such a robot is small-time locally controllable on an open subset of its zero-velocity section, allowing it to follow any path in this subset arbitrarily closely. However, some paths are “preferred” by the dynamics of the manipulator in th...