By Topic

Optimal control trajectories with minimax objective functions by linear programming

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)
G. Lack ; W. D. Scott & Company, Pty., Ltd., North Sydney, N.S.W., Australia ; M. Enns

A standard linear programming code may be used to compute optimal trajectories for a linear discrete-time system with respect to a minimax criterion on either state or control trajectories. Arbitrary linear constraints, equality or inequality, constant or time-varying, may be placed on linear combinations of the state or control variables along their trajectories or at a fixed terminal time. An important feature of the method is that the dimension of the linear programming problem is independent of the dimension of the state space but depends entirely on the numbers of control variables, constraints, and time intervals. Optimal trajectories for a 21st- order system have been calculated in a few minutes of computer time.

Published in:

IEEE Transactions on Automatic Control  (Volume:12 ,  Issue: 6 )