IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v49y2018i7p1419-1434.html
   My bibliography  Save this article

Optimal control for multi-stage and continuous-time linear singular systems

Author

Listed:
  • Yadong Shu
  • Yuanguo Zhu

Abstract

In this paper, optimal control problems for multi-stage and continuous-time linear singular systems are both considered. The singular systems are assumed to be regular and impulse-free. First, a recurrence equation is derived according to Bellman's principle of optimality in dynamic programming. Then, by applying the recurrence equation, bang-bang optimal controls for the control problems with linear objective functions subject to two types of multi-stage singular systems are obtained. Second, employing the principle of optimality, a equation of optimality for settling the optimal control problem subject to a class of continuous-time singular systems is proposed. The optimal control problem may become simpler through solving this equation of optimality. Two numerical examples and a dynamic input–output model are presented to show the effectiveness of the results obtained.

Suggested Citation

  • Yadong Shu & Yuanguo Zhu, 2018. "Optimal control for multi-stage and continuous-time linear singular systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 49(7), pages 1419-1434, May.
  • Handle: RePEc:taf:tsysxx:v:49:y:2018:i:7:p:1419-1434
    DOI: 10.1080/00207721.2018.1454534
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2018.1454534
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2018.1454534?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:taf:tsysxx:v:49:y:2018:i:7:p:1419-1434. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.