Dynamic Programming Approach to a Minimum Distance Optimal Control Problem

Arik Melikyan, Naira Hovakimyan, Yutaka Ikeda

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)239-244
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 2003
Externally publishedYes
Event42nd IEEE Conference on Decision and Control - Maui, HI, United States
Duration: Dec 9 2003Dec 12 2003

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Dynamic Programming Approach to a Minimum Distance Optimal Control Problem'. Together they form a unique fingerprint.

Cite this