Inverse optimal pinning synchronization control for higher-order networks on multi-directed hypergraphs
Dan Liu,
Bin Zhang and
Binrui Wang
Chaos, Solitons & Fractals, 2025, vol. 199, issue P1
Abstract:
This paper investigates the problem of inverse optimal pinning synchronization control for higher-order networks on multi-directed hypergraphs. Compared with existing works that focus only on the synchronization control for higher-order networks while ignoring the optimal performance of systems, a novel inverse optimal pinning control law is designed to realize the synchronization of multi-directed higher-order networks while simultaneously minimizing the associated cost functional, without solving the Hamilton–Jacobi–Bellman or Hamilton–Jacobi–Isaacs equation. Based on hypergraph theory, several sufficient conditions are proposed to guarantee the input-to-state stability of higher-order synchronization error system from the perspective of coupling strength. Finally, we use Chua’s circuit and Lorenz system as the model for each network node, respectively, to verify the effectiveness of the attained results through numerical simulation.
Keywords: Higher-order network; Multi-directed hypergraph; Synchronization; Inverse optimal control; Pinning control (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007792500606X
Full text for ScienceDirect subscribers only
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:eee:chsofr:v:199:y:2025:i:p1:s096007792500606x
DOI: 10.1016/j.chaos.2025.116593
Access Statistics for this article
Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros
More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().