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

Adaptive neural smooth finite-time controller for large-scale stochastic nonlinear state-constrained systems with feasibility removal and time delays

Author

Listed:
  • Wenjie Si
  • Xunde Dong
  • Yanfei Dong

Abstract

This paper studies the adaptive smooth finite-time neural controller design for large-scale stochastic nonlinear systems subject to command filter and time-delay interactions. The main features are (1) the communication interconnection has the output delay between subsystems; (2) the smooth finite time strategy is given for stochastic disturbances; (3) all states are confined in the constrained space without feasibility conditions. First, the state time-delay interactions are tackled by the appropriate establishment of Lyapunov–Krasovskii functionals. Second, for full-state constraints, state-related mappings are employed to remove the feasibility. Then, by constructing the switching virtual control signals, the smooth fast finite-time feature is attached to the controller. Finally, based on finite-time stability theory in probability, command filter, and backstepping technique, the smooth fast finite-time neural controller is constructed to make that all system states converge in finite time, all closed-loop variables are bounded in probability, and full-state constraints are satisfied. Simulation results are provided to test the correctness of the method.

Suggested Citation

  • Wenjie Si & Xunde Dong & Yanfei Dong, 2022. "Adaptive neural smooth finite-time controller for large-scale stochastic nonlinear state-constrained systems with feasibility removal and time delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(9), pages 1830-1847, July.
  • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:9:p:1830-1847
    DOI: 10.1080/00207721.2022.2025501
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2022.2025501?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:53:y:2022:i:9:p:1830-1847. 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.