Minimum-time path planning for robot manipulators using path parameter optimization with external force and frictions

This paper presents a new minimum-time trajectory planning method which consists of a desired path in the Cartesian space to a manipulator under external forces subject to the input voltage of the actuators. Firstly, the path is parametrized with an unknown parameter called a path parameter. This parameter is considered a function of time and an unknown parameter vector for optimization. Secondly, the optimization problem is converted into a regular parameter optimization problem, subject to the equations of motion and limitations in angular velocity, angular acceleration, angular jerk, input torques of actuators’, input voltage and final time, respectively. In the presented algorithm, the final time of the task is divided into known partitions, and the final time is an additional unknown variable in the optimization problem. The algorithm attempts to minimize the final time by optimizing the path parameter, thus it is parametrized as a polynomial of time with some unknown parameters. The algorithm can have a smooth input voltage in an allowable range; then all motion parameters and the jerk will remain smooth. Finally, the simulation study shows that the presented approach is efficient in the trajectory planning for a manipulator that wants to follow a Cartesian path. In simulations, the constraints are respected, and all motion variables and path parameters remain smooth

A New Approach to Time-Optimal Path Parameterization based on Reachability Analysis

Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based methods are fast but difficult to implement and suffer from robustness issues, while CO-based approaches are more robust but at the same time significantly slower. Here we propose a new approach to TOPP based on Reachability Analysis (RA). The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solving small Linear Programs (LPs). The resulting algorithm is faster than NI-based methods and as robust as CO-based ones (100% success rate), as confirmed by extensive numerical evaluations. Moreover, the proposed approach offers unique additional benefits: Admissible Velocity Propagation and robustness to parametric uncertainty can be derived from it in a simple and natural way.Comment: 15 pages, 9 figure

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