Extension and Generalization of Discrete Control Problems and Algorithmic Approaches for its Solving

  • Dmitrii Lozovanu
  • Stefan Pickl

The aim of this chapter is to extend methods and algorithms from the previous chapters to more general classes of problems. We describe a class of discrete control problems for which a dynamic programming technique can be used efficiently. The results from the first chapter are generalized for the case of control problems with varying time of states’ transitions of dynamical systems. Additionally, we consider a control problem with an algorithmically defined objective function. We show that the concept of multi-objective games for the considered class of control problems can be applied and we propose a new algorithm for determining optimal strategies of the players.


Control Problem Nash Equilibrium Directed Path Discrete Moment Stackelberg Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dmitrii Lozovanu
    • 1
  • Stefan Pickl
    • 2
  1. 1.Academy of Sciences of MoldovaChisinauMoldova
  2. 2.Universität der BundeswehrMünchenGermany

Personalised recommendations