IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-981-19-6084-0_2.html
   My bibliography  Save this book chapter

DMPC of Networked Systems with Event-Triggered Computation

In: Distributed Cooperative Model Predictive Control of Networked Systems

Author

Listed:
  • Yuanyuan Zou

    (Shanghai Jiao Tong University, Department of Automation)

  • Shaoyuan Li

    (Shanghai Jiao Tong University, Department of Automation)

Abstract

This chapter investigates the event-triggered DMPC scheme for achieving convergence and constraints satisfaction of NCSs. By applying a trigger in the sensor-to-controller channel in each subsystem, the computation and communication manners are regulated such that the NCS achieves the control goals with less resources consumption compared to the normal DMPC scheme. Specifically, two approaches that contain different event-triggering conditions are reported. In Sect. 2.2, to achieve the consensus property of NCSs with decoupled dynamics, a DMPC algorithm with a cooperative event-triggering condition is presented. The event-triggered condition is designed considering the information received from neighboring subsystems, and the sufficient conditions for global ISS are derived. In Sect. 2.3, a dual-mode DMPC strategy with a decentralized event-triggered computation mechanism is developed for NCSs with bounded uncertainty. The triggering condition is only parameterized on the information of the subsystem itself. Once the states of two interactive subsystems both enter the pre-designed invariant set respectively, no information will be exchanged between them, thus reducing the communicational resources with acceptable closed-loop performance. Examples are provided to verify the effectiveness of the strategies.

Suggested Citation

  • Yuanyuan Zou & Shaoyuan Li, 2022. "DMPC of Networked Systems with Event-Triggered Computation," Springer Books, in: Distributed Cooperative Model Predictive Control of Networked Systems, chapter 0, pages 21-47, Springer.
  • Handle: RePEc:spr:sprchp:978-981-19-6084-0_2
    DOI: 10.1007/978-981-19-6084-0_2
    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

    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-981-19-6084-0_2. 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.