To assure a successful completion of an assigned task without interruption, such as the collision with fixtures, the hand of a mechanical manipulator often travels along a preplanned path. An advantage of requiring the path to be composed of straight-line segments in Cartesian coordinates is to provide a capability for controlled interaction with objects on a moving conveyor. This paper presents a method of obtaining a time schedule of velocities and accelerations along the path that the manipulator may adopt to obtain a minimum traveling time, under the constraints of composite Cartesian limit on linear and angular velocities and accelerations. Because of the involvement of a linear performance index and a large number of nonlinear inequality constraints, which are generated from physical limitations, the “method of approximate programming (MAP)” is applied. Depending on the initial choice of a feasible solution, the iterated feasible solution, however, does not converge to the optimum feasible point, but is often entrapped at some other point of the boundary of the constraint set. To overcome the obstacle, MAP is modified so that the feasible solution of each of the iterated linear programming problems is shifted to the boundaries corresponding to the original, linear inequality constraints. To reduce the computing time, a “direct approximate programming algorithm (DAPA)” is developed, implemented and shown to converge to optimum feasible solution for the path planning problem. Programs in FORTRAN language have been written for both the modified MAP and DAPA, and are illustrated by a numerical example for the purpose of comparison.
Skip Nav Destination
Article navigation
June 1981
Research Papers
Optimum Path Planning for Mechanical Manipulators
J. Y. S. Luh,
J. Y. S. Luh
School of Electrical Engineering, Purdue University, West Lafayette, Ind. 47907
Search for other works by this author on:
C. S. Lin
C. S. Lin
School of Electrical Engineering, Purdue University, West Lafayette, Ind. 47907
Search for other works by this author on:
J. Y. S. Luh
School of Electrical Engineering, Purdue University, West Lafayette, Ind. 47907
C. S. Lin
School of Electrical Engineering, Purdue University, West Lafayette, Ind. 47907
J. Dyn. Sys., Meas., Control. Jun 1981, 103(2): 142-151 (10 pages)
Published Online: June 1, 1981
Article history
Received:
June 5, 1980
Online:
July 21, 2009
Citation
Luh, J. Y. S., and Lin, C. S. (June 1, 1981). "Optimum Path Planning for Mechanical Manipulators." ASME. J. Dyn. Sys., Meas., Control. June 1981; 103(2): 142–151. https://doi.org/10.1115/1.3139654
Download citation file:
Get Email Alerts
Offset-Free Koopman Model Predictive Control of Thermal Comfort Regulation for A VRF-DOAS Combined System
J. Dyn. Sys., Meas., Control
Rejection of Sinusoidal Disturbances With Unknown Slowly Time-Varying Frequencies for Linear Time-Varying Systems
J. Dyn. Sys., Meas., Control (July 2024)
Using Control Barrier Functions to Incorporate Observability: Application to Range-Based Target Tracking
J. Dyn. Sys., Meas., Control (July 2024)
Gas Path Fault Diagnosis of Turboshaft Engine Based on Novel Transfer Learning Methods
J. Dyn. Sys., Meas., Control (May 2024)
Related Articles
A Linear Programming Solution for Exact Collision Detection
J. Comput. Inf. Sci. Eng (March,2005)
On Superquadric Human Modeling and Risk Assessment for Safe Planning of Human-Safe Robotic Systems
J. Mechanisms Robotics (November,2010)
A New Medical Parallel Robot and Its Static Balancing Optimization
J. Med. Devices (December,2007)
Optimal Path Planning for Robot Manipulators
J. Mech. Des (December,1992)
Related Proceedings Papers
Related Chapters
Feedback-Aided Minimum Joint Motion
Robot Manipulator Redundancy Resolution
QP Based Encoder Feedback Control
Robot Manipulator Redundancy Resolution
A Dynamic Path Planning Algorithm with Application to AFM Tip Steering
International Conference on Advanced Computer Theory and Engineering (ICACTE 2009)