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

Dmitrii Lozovanu and Stefan Pickl ()
Additional contact information
Dmitrii Lozovanu: Academy of Sciences of Moldova
Stefan Pickl: Universität der Bundeswehr

Chapter 3 in Optimization and Multiobjective Control of Time-Discrete Systems, 2009, pp 1-55 from Springer

Abstract: 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.

Keywords: Control Problem; Nash Equilibrium; Directed Path; Discrete Moment; Stackelberg Solution (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-85025-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9783540850250

DOI: 10.1007/978-3-540-85025-0_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().