IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-85025-0_3.html

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

In: Optimization and Multiobjective Control of Time-Discrete Systems

Author

Listed:
  • Dmitrii Lozovanu

    (Academy of Sciences of Moldova)

  • Stefan Pickl

    (Universität der Bundeswehr)

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.

Suggested Citation

  • Dmitrii Lozovanu & Stefan Pickl, 2009. "Extension and Generalization of Discrete Control Problems and Algorithmic Approaches for its Solving," Springer Books, in: Optimization and Multiobjective Control of Time-Discrete Systems, chapter 3, pages 1-55, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-85025-0_3
    DOI: 10.1007/978-3-540-85025-0_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-85025-0_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.