Handling robot constraints within a Set-Based Multi-Task Priority Inverse Kinematics Framework

Set-Based Multi-Task Priority is a recent framework to handle inverse kinematics for redundant structures. Both equality tasks, i.e., control objectives to be driven to a desired value, and set-bases tasks, i.e., control objectives to be satisfied with a set/range of values can be addressed in a rigorous manner within a priority framework. In addition, optimization tasks, driven by the gradient of a proper function, may be considered as well, usually as lower priority tasks. In this paper the proper design of the tasks, their priority and the use of a Set-Based Multi-Task Priority framework is proposed in order to handle several constraints simultaneously in real-time. It is shown that safety related tasks such as, e.g., joint limits or kinematic singularity, may be properly handled by consider them both at an higher priority as set-based task and at a lower within a proper optimization functional. Experimental results on a 7DOF Jaco$^2

Constrained Bimanual Planning with Analytic Inverse Kinematics

In order for a bimanual robot to manipulate an object that is held by both hands, it must construct motion plans such that the transformation between its end effectors remains fixed. This amounts to complicated nonlinear equality constraints in the configuration space, which are difficult for trajectory optimizers. In addition, the set of feasible configurations becomes a measure zero set, which presents a challenge to sampling-based motion planners. We leverage an analytic solution to the inverse kinematics problem to parametrize the configuration space, resulting in a lower-dimensional representation where the set of valid configurations has positive measure. We describe how to use this parametrization with existing algorithms for motion planning, including sampling-based approaches, trajectory optimizers, and techniques that plan through convex inner-approximations of collision-free space.Comment: Submitted to ICRA 2024. 8 pages, 5 figures. Interactive results available at https://cohnt.github.io/Bimanual-Web/index.htm

Learning Probabilistic Generative Models For Fast Sampling-Based Planning

Due to their simplicity and efficiency in high dimensional space, sampling-based motion planners have been gaining interest for robotic manipulation in recent years. We present several new learning approaches using probabilistic generative models for fast sampling-based planning. First, we propose fast collision detection in high dimensional configuration spaces based on Gaussian Mixture Models (GMMs) for Rapidly-exploring Random Trees (RRT). In addition, we introduce a new probabilistically safe local steering primitive based on the probabilistic model. Our local steering procedure is based on a new notion of a convex probabilistically safety corridor that is constructed around a configuration using tangent hyperplanes of confidence ellipsoids of GMMs learned from prior collision history. For efficient sampling, we suggest a sampling method with a learned Q-function with linear function approximation based on feature representations such as Radial Basis Functions. This sampling method chooses the optimal node from which to extend the search tree via the softmax function of learned state values. We also discuss a novel constrained sampling-based motion planning method for grasp and transport tasks with redundant robotic manipulators, which allows the best grasp configuration and approach direction to be automatically determined. Since these approaches with the learned probabilistic models require large size data and time for training, it is essential that they are able to be adapted to environmental change in an online manner. The suggested online learning approach with the Dirichlet Process Mixture Model (DPMM) can adapt the complexity to the data and learn new Gaussian clusters with streaming data in newly explored areas without batch learning. We have applied these approaches in a number of robot arm planning scenarios and have shown their utility and effectiveness in simulation and on a physical 7-DoF robot manipulator

Motion Planning of Redundant Manipulator With Variable Joint Velocity Limit Based on Beetle Antennae Search Algorithm

Redundant manipulators play important roles in many industrial and service applications by assisting people fulfill heavy and repetitive jobs. However, redundant manipulators are coupled highly-nonlinear systems which exert difficulty of redundancy resolution computation. Conventional methods such as pseudo-inverse-based approaches obtain the resolved joint angles from joint velocity level, which may bring about more computational cost and may neglect joint velocity limits. In this work, a motion planning method based on beetle antennae search algorithm (BAS) is proposed for motion planning of redundant manipulators with the variable joint velocity limit. Such proposed work does not need to resolve the velocity kinematics equation as the conventional methods do, and the proposed method can directly deal with the forward kinematics equation to resolve the desired joint angles. The simulation and experiment on the five-link planar manipulator and the Kuka industrial manipulator system demonstrate the efficiency of the proposed method for motion planning of redundant manipulator, and reveal the reliable performance of the BAS algorithm as compared with genetic algorithm (GA), particle swarm optimization (PSO), firefly algorithm(FA) and quantum behaved particle swarm algorithm(QPSO) methods

An approach for real-time motion planning of an inchworm robot in complex steel bridge environments

© Cambridge University Press 2016. Path planning can be difficult and time consuming for inchworm robots especially when operating in complex 3D environments such as steel bridges. Confined areas may prevent a robot from extensively searching the environment by limiting its mobility. An approach for real-time path planning is presented. This approach first uses the concept of line-of-sight (LoS) to find waypoints from the start pose to the end node. It then plans smooth, collision-free motion for a robot to move between waypoints using a 3D-F2 algorithm. Extensive simulations and experiments are conducted in 2D and 3D scenarios to verify the approach