By Topic

Constructive controllability algorithms for motion planning and optimization

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)
W. T. Cerven ; Dept. of Aeronaut. & Astronaut. Eng., Illinois Univ., Urbana, IL, USA ; F. Bullo

Presents algorithms for planning feasible and minimum energy paths. The algorithms rely on series expansions to characterize planning problems for polynomial control systems. The resulting inversion problem is solved through an iterative contraction or a power series inversion. While the design methodology is general, our focus is on a class of polynomial control systems for which we provide explicit convergence guarantees. We demonstrate performance and numerical characteristics using one dimensional and six dimensional systems.

Published in:

IEEE Transactions on Automatic Control  (Volume:48 ,  Issue: 4 )