A general one-dimensional search algorithm for computing approximate solutions of some non-linear optimal control problems
作者:
PHILIPL. KATZ,
期刊:
International Journal of Control
(Taylor Available online 1974)
卷期:
Volume 20,
issue 4
页码: 655-672
ISSN:0020-7179
年代: 1974
DOI:10.1080/00207177408932766
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
Barr and Gilbert (1966, 1969 b) have presented computing algorithms for converting a brood class of optimal control problems (including minimum time, and fixed-time minimum fuel, energy and effort problems) to a sequence of optimal regulator problems, using a one dimensional search of the cost variable. These Barr and Gilbert algorithms, which use quadratic programming algorithms by the same authors (1969 a) to solve the resulting optimal regulator problems, are restricted to dynamic equations linear in state by virtue of using the convexity and compactness (Neustadt 1963) and contact function (Gilbert 1966) of the reachable set
点击下载:
PDF (701KB)
返 回