Suboptimal robot path planning scheme for loosely constrained trajectories

Dan Simon, Can Isik

Research output: Chapter in Book/Entry/PoemConference contribution


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 realized 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 optimize 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.

Original languageEnglish (US)
Title of host publicationAmerican Control Conference
Editors Anon
PublisherIEEE Computer Society
Number of pages5
ISBN (Print)0780308611
StatePublished - 1993
Externally publishedYes
EventProceedings of the 1993 American Control Conference Part 3 (of 3) - San Francisco, CA, USA
Duration: Jun 2 1993Jun 4 1993

Publication series

NameAmerican Control Conference


OtherProceedings of the 1993 American Control Conference Part 3 (of 3)
CitySan Francisco, CA, USA

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Suboptimal robot path planning scheme for loosely constrained trajectories'. Together they form a unique fingerprint.

Cite this