Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Dynamic programming approach to a minimum distance optimal control problem

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Melikyan, A. ; Inst. for Problems in Mech., Acad. of Sci., Moscow, Russia ; Hovakimyan, N. ; Ikeda, Y.

An optimal control problem with minimum-type (non-additive) functional is considered. Such problem has several applications, including air collision avoidance problem for two aircraft. It is known that the Bellman optimality principle is not fulfilled globally for this problem, so that the dynamic programming technique works only in a part of the problem's phase space. The boundary of this part is unknown and has to be found as an element of the solution of a dynamic programming problem with unknown boundary. In some problems this boundary contains optimal (singular) trajectories. The equations for such paths are derived by applying the method of singular characteristics. Some other necessary conditions of optimality are discussed in terms of Bellman equation and Hamiltonian. Examples are given for which the unknown boundary includes and does not include optimal paths. An aircraft collision avoidance problem is discussed.

Published in:

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on  (Volume:1 )

Date of Conference:

9-12 Dec. 2003