Motion Planning for Redundant Manipulators Using a Floating Point Genetic Algorithm

2003 ◽  
Vol 38 (3/4) ◽  
pp. 297-312 ◽  
Author(s):  
Lianfang Tian ◽  
Curtis Collins
Robotica ◽  
2015 ◽  
Vol 35 (1) ◽  
pp. 101-118 ◽  
Author(s):  
Alireza Motahari ◽  
Hassan Zohoor ◽  
Moharam Habibnejad Korayem

SUMMARYA hyper-redundant manipulator is made by mounting the serial and/or parallel mechanisms on top of each other as modules. In discrete actuation, the actuation amounts are a limited number of certain values. It is not feasible to solve the kinematic analysis problems of discretely actuated hyper-redundant manipulators (DAHMs) by using the common methods, which are used for continuous actuated manipulators. In this paper, a new method is proposed to solve the trajectory tracking problem in a static prescribed obstacle field. To date, this problem has not been considered in the literature. Theremoving first collision(RFC) method, which is originally proposed for solving the inverse kinematic problems in the obstacle fields was modified and used to solve the motion planning problem. For verification, the numerical results of the proposed method were compared with the results of thegenetic algorithm(GA) method. Furthermore, a novel DAHM designed and implemented by the authors is introduced.


Author(s):  
Xin-Sheng Ge ◽  
Li-Qun Chen

The motion planning problem of a nonholonomic multibody system is investigated. Nonholonomicity arises in many mechanical systems subject to nonintegrable velocity constraints or nonintegrable conservation laws. When the total angular momentum is zero, the control problem of system can be converted to the motion planning problem for a driftless control system. In this paper, we propose an optimal control approach for nonholonomic motion planning. The genetic algorithm is used to optimize the performance of motion planning to connect the initial and final configurations and to generate a feasible trajectory for a nonholonomic system. The feasible trajectory and its control inputs are searched through a genetic algorithm. The effectiveness of the genetic algorithm is demonstrated by numerical simulation.


Author(s):  
Qingyou Liu ◽  
Yonghua Chen ◽  
Tao Ren ◽  
Ying Wei

Modern society is fueled by very comprehensive grids of gas and liquid supply pipelines. The frequent inspection and maintenance of such pipeline grids is not a trivial task. It has been demonstrated that such task is best performed by using in-pipe robots. In this paper, a novel inchworm robot design and its optimized motion planning are presented. The proposed design uses a helical drive for both gripping and locomotion of the robot. The extension and retraction between inchworm segments are facilitated by conic springs as they can store strain energy. The proposed inchworm robot can also be made very compact without sacrificing stroke length as conic springs can be easily designed with telescopic feature. To generate inchworm motion, a sinusoidal velocity pattern is planned for each segment. The frequency of the velocity pattern is optimized using a genetic algorithm (GA). The optimization result from the GA method has been validated using a traditional gradient based method.


Author(s):  
Shangdong Gong ◽  
Redwan Alqasemi ◽  
Rajiv Dubey

Motion planning of redundant manipulators is an active and widely studied area of research. The inverse kinematics problem can be solved using various optimization methods within the null space to avoid joint limits, obstacle constraints, as well as minimize the velocity or maximize the manipulability measure. However, the relation between the torques of the joints and their respective positions can complicate inverse dynamics of redundant systems. It also makes it challenging to optimize cost functions, such as total torque or kinematic energy. In addition, the functional gradient optimization techniques do not achieve an optimal solution for the goal configuration. We present a study on motion planning using optimal control as a pre-process to find optimal pose at the goal position based on the external forces and gravity compensation, and generate a trajectory with optimized torques using the gradient information of the torque function. As a result, we reach an optimal trajectory that can minimize the torque and takes dynamics into consideration. We demonstrate the motion planning for a planar 3-DOF redundant robotic arm and show the results of the optimized trajectory motion. In the simulation, the torque generated by an external force on the end-effector as well as by the motion of every link is made into an integral over the squared torque norm. This technique is expected to take the torque of every joint into consideration and generate better motion that maintains the torques or kinematic energy of the arm in the safe zone. In future work, the trajectories of the redundant manipulators will be optimized to generate more natural motion as in humanoid arm motion. Similar to the human motion strategy, the robot arm is expected to be able to lift weights held by hands, the configuration of the arm is changed along from the initial configuration to a goal configuration. Furthermore, along with weighted least norm (WLN) solutions, the optimization framework will be more adaptive to the dynamic environment. In this paper, we present the development of our methodology, a simulated test and discussion of the results.


2019 ◽  
Vol 16 (3) ◽  
pp. 172988141984737 ◽  
Author(s):  
Kai Mi ◽  
Haojian Zhang ◽  
Jun Zheng ◽  
Jianhua Hu ◽  
Dengxiang Zhuang ◽  
...  

We consider a motion planning problem with task space constraints in a complex environment for redundant manipulators. For this problem, we propose a motion planning algorithm that combines kinematics control with rapidly exploring random sampling methods. Meanwhile, we introduce an optimization structure similar to dynamic programming into the algorithm. The proposed algorithm can generate an asymptotically optimized smooth path in joint space, which continuously satisfies task space constraints and avoids obstacles. We have confirmed that the proposed algorithm is probabilistically complete and asymptotically optimized. Finally, we conduct multiple experiments with path length and tracking error as optimization targets and the planning results reflect the optimization effect of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document