A Suboptimal Robot Path Planning Scheme for Loosely Constrained Trajectories
Document Type
Conference Proceeding
Publication Date
6-1993
Publication Title
American Control Conference
Abstract
Approximation of a desired robot path can be accomplished by interpolating a curve through a sequence of joint-space knots. A smooth interpolated trajectory can be realised by using trigonometric splines (TSs). But sometimes the joint trajectory is not required to exactly pass through the given knots. The knots may rather be centers of tolerances near which the trajectory is required to pass. In this paper, we optimise TSs through a given set of knots subject to user-specified knot tolerances. The contribution of this paper is the straightforward way in which intermediate constraints (i.e. knot angles) are incorporated into the parameter optimization problem. Another contribution is the exploitation of the decoupled nature of TSs to reduce the computational expense of the problem. The additional freedom of varying the knot angles results in a lower objective function and a higher computational expense, compared to the case where the knot angles are constrained to exact values. The specific objective functions considered are minimum jerk and minimum energy. In the minimum jerk case, the optimization problem reduces to a quadratic programming problem. Simulation results for a two-link manipulator are presented to support the results of this paper.
Repository Citation
Simon, Daniel J. and Isik, Can, "A Suboptimal Robot Path Planning Scheme for Loosely Constrained Trajectories" (1993). Electrical and Computer Engineering Faculty Publications. 157.
https://engagedscholarship.csuohio.edu/enece_facpub/157
Original Citation
D. Simon and C. Isik. (1993). A Suboptimal Robot Path Planning Scheme for Loosely Constrained Trajectories. American Control Conference, 59-63.
