By Topic

Iterative on-line solution of minimum-time/limited-fuel/fixed-route problems

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
$31 $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)
Brankovic, B.M. ; Cement Factory Novi Popovac, Serbia, Yugoslavia ; Hung, S.T.

Operations research has generated many approaches to solve the optimal path or route assignment problem. The authors discuss a technique for rapidly finding the optimal traversal strategy after the route itself has been assigned: nonlinear programming via a modification of Newton's algorithm. A key to the speed of computation is the use of reduced-order modeling of the traversal process. The resultant rapid solution allows for online updating of strategies in the face of modeling uncertainties and potential changes in downstream operating conditions. Frequent reevaluation and updating of the optimal strategy affects a global strategic feedback over the entire history of the route traversal process and thus improves the robustness of the optimization routine. Solar/electric vehicle operation is considered as an example

Published in:

Industrial Electronics, Control and Instrumentation, 1991. Proceedings. IECON '91., 1991 International Conference on

Date of Conference:

28 Oct-1 Nov 1991