Direct Search for Optimal Transients in Objects with One Control Input

摘要

The paper represents a new departure in formal mathematical studies on the automated drive in stating that the problem of optimizing transient behaviour in a drive has not as yet been solved anywhere in a way which engineers can put into effect. The present contribution for reasons of space is therefore confined to objects with only one control input, but the proposed approach by the methods of direct search is believed to be generalizable. The essential idea is to concentrate firstly on minimizing the response time, and this can be done heuristically by dynamic programming (Bellman). Other considerations may then be treated as approximate problems, the solutions for which are refined in accord with the optimum response time.