Optimal path planning for nonholonomic robotics systems via parametric optimisation

Abstract. Motivated by the path planning problem for robotic systems this paper considers nonholonomic path planning on the Euclidean group of motions SE(n) which describes a rigid bodies path in n-dimensional Euclidean space. The problem is formulated as a constrained optimal kinematic control problem where the cost function to be minimised is a quadratic function of translational and angular velocity inputs. An application of the Maximum Principle of optimal control leads to a set of Hamiltonian vector field that define the necessary conditions for optimality and consequently the optimal velocity history of the trajectory. It is illustrated that the systems are always integrable when n = 2 and in some cases when n = 3. However, if they are not integrable in the most general form of the cost function they can be rendered integrable by considering special cases. This implies that it is possible to reduce the kinematic system to a class of curves defined analytically. If the optimal motions can be expressed analytically in closed form then the path planning problem is reduced to one of parameter optimisation where the parameters are optimised to match prescribed boundary conditions.This reduction procedure is illustrated for a simple wheeled robot with a sliding constraint and a conventional slender underwater vehicle whose velocity in the lateral directions are constrained due to viscous damping

Path planning for simple wheeled robots : sub-Riemannian and elastic curves on SE(2)

This paper presents a motion planning method for a simple wheeled robot in two cases: (i) where translational and rotational speeds are arbitrary and (ii) where the robot is constrained to move forwards at unit speed. The motions are generated by formulating a constrained optimal control problem on the Special Euclidean group SE(2). An application of Pontryagin’s maximum principle for arbitrary speeds yields an optimal Hamiltonian which is completely integrable in terms of Jacobi elliptic functions. In the unit speed case, the rotational velocity is described in terms of elliptic integrals and the expression for the position reduced to quadratures. Reachable sets are defined in the arbitrary speed case and a numerical plot of the time-limited reachable sets presented for the unit speed case. The resulting analytical functions for the position and orientation of the robot can be parametrically optimised to match prescribed target states within the reachable sets. The method is shown to be easily adapted to obstacle avoidance for static obstacles in a known environment

A Certified-Complete Bimanual Manipulation Planner

Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid object. In this paper, we propose a manipulation planning algorithm to bring an object from an initial stable placement (position and orientation of the object on the support surface) towards a goal stable placement. The key specificity of our algorithm is that it is certified-complete: for a given object and a given environment, we provide a certificate that the algorithm will find a solution to any bimanual manipulation query in that environment whenever one exists. Moreover, the certificate is constructive: at run-time, it can be used to quickly find a solution to a given query. The algorithm is tested in software and hardware on a number of large pieces of furniture.Comment: 12 pages, 7 figures, 1 tabl

Real-Time Planning with Primitives for Dynamic Walking over Uneven Terrain

We present an algorithm for receding-horizon motion planning using a finite family of motion primitives for underactuated dynamic walking over uneven terrain. The motion primitives are defined as virtual holonomic constraints, and the special structure of underactuated mechanical systems operating subject to virtual constraints is used to construct closed-form solutions and a special binary search tree that dramatically speed up motion planning. We propose a greedy depth-first search and discuss improvement using energy-based heuristics. The resulting algorithm can plan several footsteps ahead in a fraction of a second for both the compass-gait walker and a planar 7-Degree-of-freedom/five-link walker.Comment: Conference submissio