By Topic

Fast solution techniques for a class of optimal trajectory planning problems with applications to automated spray coating

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Ramabhadran ; Fuel Syst. Plant, Cummins Engine Co. Inc., Columbus, IN, USA ; J. K. Antonio

Optimal trajectory planning problems are often formulated as constrained variational problems. In general, solutions to variational problems are determined by appropriately discretizing the underlying objective functional and solving the resulting nonlinear differential equation(s) and/or nonlinear programming problem(s) numerically. These general solution techniques often require a significant amount of time to be computed, and therefore are of limited value when optimal trajectories need to be frequently computed and/or recomputed. In this paper, a realistic class of optimal trajectory planning problems is defined for which the existence of fast numerical solution techniques are demonstrated. To illustrate the practicality of this class of trajectory planning problems and the proposed solution techniques, three optimal trajectory planning problems for spray coating applications are formulated and solved. Based on the proposed discretization technique, it is shown that these problems can be reduced to either a linear program or a quadratic program, which are readily solved

Published in:

IEEE Transactions on Robotics and Automation  (Volume:13 ,  Issue: 4 )