Pub Date : 2025-11-12DOI: 10.1016/j.nahs.2025.101659
Linye Wu , Qiyao Wang , Jitao Sun
This paper explores optimal preview control for probabilistic Boolean networks (PBNs). Over the past decade, scholars have introduced PBNs as a pioneering mathematical framework. A significant challenge involves deriving optimal strategies for PBNs to prevent unfavorable states. Our proposed methodology integrates the strengths of the semi-tensor product (STP, i.e., Cheng product) of matrices and the Exclusive-Or operator. This integration results in an extended system capable of guiding PBNs with minimal cost. Furthermore, the configurability of the cost function allows for the inclusion of various control inputs and state variables. Discrete-time Markov decision processes (DTMDPs) are employed to determine the most suitable control policies. Finally, a numerical example is presented to validate the effectiveness of the proposed preview control protocol for PBNs.
{"title":"Optimal preview control of probabilistic Boolean networks","authors":"Linye Wu , Qiyao Wang , Jitao Sun","doi":"10.1016/j.nahs.2025.101659","DOIUrl":"10.1016/j.nahs.2025.101659","url":null,"abstract":"<div><div>This paper explores optimal preview control for probabilistic Boolean networks (PBNs). Over the past decade, scholars have introduced PBNs as a pioneering mathematical framework. A significant challenge involves deriving optimal strategies for PBNs to prevent unfavorable states. Our proposed methodology integrates the strengths of the semi-tensor product (STP, i.e., Cheng product) of matrices and the Exclusive-Or operator. This integration results in an extended system capable of guiding PBNs with minimal cost. Furthermore, the configurability of the cost function allows for the inclusion of various control inputs and state variables. Discrete-time Markov decision processes (DTMDPs) are employed to determine the most suitable control policies. Finally, a numerical example is presented to validate the effectiveness of the proposed preview control protocol for PBNs.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101659"},"PeriodicalIF":3.7,"publicationDate":"2025-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145519771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a robust sampled controller design for trajectory tracking in unicycle mobile robots subject to state, input, and communication constraints, as well as external disturbances such as wheel slipping. The proposed approach integrates two control strategies: an aperiodic control law based on an event-triggered mechanism and a periodic control law using a constant sampled state-feedback controller. The event-triggered control employs the attractive ellipsoid method and the barrier Lyapunov function to ensure performance within a defined safe set, where state constraints are preserved, and a switching set determines the active control strategy. The periodic sampled control considers the maximum sampling time required to achieve trajectory tracking while minimizing bandwidth usage. This strategy guarantees input-to-state stability of the tracking error dynamics against multiplicative external disturbances. Additionally, a straightforward method using linear matrix inequalities is provided to compute the controller gains. Experimental results validate the effectiveness of the proposed robust control approach.
{"title":"An event-triggered robust sampled tracking controller for communication-state-input constrained perturbed unicycle mobile robots","authors":"Ariana Gutiérrez , Héctor Ríos , Manuel Mera , Denis Efimov , Rosane Ushirobira","doi":"10.1016/j.nahs.2025.101657","DOIUrl":"10.1016/j.nahs.2025.101657","url":null,"abstract":"<div><div>This paper presents a robust sampled controller design for trajectory tracking in unicycle mobile robots subject to state, input, and communication constraints, as well as external disturbances such as wheel slipping. The proposed approach integrates two control strategies: an aperiodic control law based on an event-triggered mechanism and a periodic control law using a constant sampled state-feedback controller. The event-triggered control employs the attractive ellipsoid method and the barrier Lyapunov function to ensure performance within a defined safe set, where state constraints are preserved, and a switching set determines the active control strategy. The periodic sampled control considers the maximum sampling time required to achieve trajectory tracking while minimizing bandwidth usage. This strategy guarantees input-to-state stability of the tracking error dynamics against multiplicative external disturbances. Additionally, a straightforward method using linear matrix inequalities is provided to compute the controller gains. Experimental results validate the effectiveness of the proposed robust control approach.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101657"},"PeriodicalIF":3.7,"publicationDate":"2025-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145465499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-06DOI: 10.1016/j.nahs.2025.101654
Xinyong Wang , Laurentiu Hetel , Ying Tang , Jimmy Lauber
In this paper the local asymptotic stability problem is investigated for a class of piecewise affine (PWA) Filippov systems. We address a particular case of PWA systems with linear switching surfaces crossing at an equilibrium resulting from sliding dynamics (Filippov/pseudo equilibrium). The PWA systems may also present other unstable equilibria. Sufficient Lyapunov-based conditions are given for characterising the local asymptotic stability of the Filippov equilibrium. Methods are proposed to estimate the domain of attraction.
{"title":"Local stability for a class of piecewise affine Filippov systems","authors":"Xinyong Wang , Laurentiu Hetel , Ying Tang , Jimmy Lauber","doi":"10.1016/j.nahs.2025.101654","DOIUrl":"10.1016/j.nahs.2025.101654","url":null,"abstract":"<div><div>In this paper the local asymptotic stability problem is investigated for a class of piecewise affine (PWA) Filippov systems. We address a particular case of PWA systems with linear switching surfaces crossing at an equilibrium resulting from sliding dynamics (Filippov/pseudo equilibrium). The PWA systems may also present other unstable equilibria. Sufficient Lyapunov-based conditions are given for characterising the local asymptotic stability of the Filippov equilibrium. Methods are proposed to estimate the domain of attraction.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101654"},"PeriodicalIF":3.7,"publicationDate":"2025-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145465500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-24DOI: 10.1016/j.nahs.2025.101655
Jianrui Li, Jinghai Shao
The recurrent property of diffusion processes with regime-switching is quite complicated, which could be transient even when it is recurrent at every fixed environment. This work provides explicit criteria in terms of the coefficients of diffusion processes such that the studied processes are recurrent or transient under arbitrary switching rates. The obtained criteria are in the integral form, which are particularly effective for the regime-switching processes with coefficients vibrating periodically. Examples are constructed to illustrate the applications of these criteria.
{"title":"Explicit criteria for recurrence of Markovian regime-switching diffusion processes under arbitrary switching rates","authors":"Jianrui Li, Jinghai Shao","doi":"10.1016/j.nahs.2025.101655","DOIUrl":"10.1016/j.nahs.2025.101655","url":null,"abstract":"<div><div>The recurrent property of diffusion processes with regime-switching is quite complicated, which could be transient even when it is recurrent at every fixed environment. This work provides explicit criteria in terms of the coefficients of diffusion processes such that the studied processes are recurrent or transient under arbitrary switching rates. The obtained criteria are in the integral form, which are particularly effective for the regime-switching processes with coefficients vibrating periodically. Examples are constructed to illustrate the applications of these criteria.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101655"},"PeriodicalIF":3.7,"publicationDate":"2025-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145362671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-17DOI: 10.1016/j.nahs.2025.101653
Yanan Pan , Shihua Fu , Jianjun Wang , Weihai Zhang
This paper studies the optimal output regulation of Boolean control networks (BCNs), the main objective of which is to design a state feedback control such that the tracking error of each state trajectory in the system is minimized. Firstly, the definition of the solvability for the output regulation within admissible tracking error is given, and some necessary and sufficient conditions to determine the solvability of the output regulation problem within admissible tracking error are obtained. Secondly, the optimal trajectory of each state is provided when the outputs of the BCN cannot completely track the time-varying reference signals, and a control design algorithm that minimizes the tracking error of the system is introduced. Finally, two examples are given to verify the validity of our new findings.
{"title":"Optimal output regulation of Boolean control networks","authors":"Yanan Pan , Shihua Fu , Jianjun Wang , Weihai Zhang","doi":"10.1016/j.nahs.2025.101653","DOIUrl":"10.1016/j.nahs.2025.101653","url":null,"abstract":"<div><div>This paper studies the optimal output regulation of Boolean control networks (BCNs), the main objective of which is to design a state feedback control such that the tracking error of each state trajectory in the system is minimized. Firstly, the definition of the solvability for the output regulation within admissible tracking error is given, and some necessary and sufficient conditions to determine the solvability of the output regulation problem within admissible tracking error are obtained. Secondly, the optimal trajectory of each state is provided when the outputs of the BCN cannot completely track the time-varying reference signals, and a control design algorithm that minimizes the tracking error of the system is introduced. Finally, two examples are given to verify the validity of our new findings.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101653"},"PeriodicalIF":3.7,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-16DOI: 10.1016/j.nahs.2025.101649
Hussein Sibai , Enrique Mallada
In this paper, we introduce the notion of recurrence entropy in the context of nonlinear control systems. A set is said to be (-)recurrent if every trajectory that starts in the set returns to it (within at most units of time). The recurrence entropy of a control system quantifies the complexity of making a set -recurrent measured by the average rate of growth, as time increases, of the number of control signals required to achieve this goal. Our analysis reveals that, compared to invariance, recurrence is quantitatively less complex, meaning that the recurrence entropy of a set is no larger than, and often strictly smaller than, the invariance entropy. We provide upper and lower bounds on recurrence entropy and show that they converge to the bounds on invariance entropy as decreases to zero. Further, our results show that recurrence entropy lower bounds the minimum data rate between the sensor and controller required for achieving recurrence. We present an algorithm according to which the sensor can send state estimates to the controller over a limited-bandwidth channel to achieve recurrence asymptotically at an exponential rate. Finally, we show that, under mild stricter conditions on the set and dynamics, the control signals that enforce the -recurrence of a set can be generated by a finite alphabet of control signals of durations of at most units of time, which allows us to store them for quick online execution.
{"title":"Recurrence of nonlinear control systems: Entropy, bit rates, and finite alphabet controllers","authors":"Hussein Sibai , Enrique Mallada","doi":"10.1016/j.nahs.2025.101649","DOIUrl":"10.1016/j.nahs.2025.101649","url":null,"abstract":"<div><div>In this paper, we introduce the notion of recurrence entropy in the context of nonlinear control systems. A set is said to be (<span><math><mi>τ</mi></math></span>-)recurrent if every trajectory that starts in the set returns to it (within at most <span><math><mi>τ</mi></math></span> units of time). The recurrence entropy of a control system quantifies the complexity of making a set <span><math><mi>τ</mi></math></span>-recurrent measured by the average rate of growth, as time increases, of the number of control signals required to achieve this goal. Our analysis reveals that, compared to invariance, recurrence is quantitatively less complex, meaning that the recurrence entropy of a set is no larger than, and often strictly smaller than, the invariance entropy. We provide upper and lower bounds on recurrence entropy and show that they converge to the bounds on invariance entropy as <span><math><mi>τ</mi></math></span> decreases to zero. Further, our results show that recurrence entropy lower bounds the minimum data rate between the sensor and controller required for achieving recurrence. We present an algorithm according to which the sensor can send state estimates to the controller over a limited-bandwidth channel to achieve recurrence asymptotically at an exponential rate. Finally, we show that, under mild stricter conditions on the set and dynamics, the control signals that enforce the <span><math><mi>τ</mi></math></span>-recurrence of a set can be generated by a finite alphabet of control signals of durations of at most <span><math><mi>τ</mi></math></span> units of time, which allows us to store them for quick online execution.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101649"},"PeriodicalIF":3.7,"publicationDate":"2025-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-16DOI: 10.1016/j.nahs.2025.101650
Agustín G. Yabo , Nicolas Augier
In this paper, we investigate optimal state transfers for a generic class of piecewise-linear models widely used to qualitatively describe gene-regulatory networks. Motivated by the main practical drawbacks of artificially regulating gene expression through chemical inducers, the optimality of the transitions is defined as the convex combination of the total time and the cost of the control. Solutions are studied through a Hybrid Pontryagin’s Maximum Principle approach, which allows to characterize the optimal trajectories and control for the general formulation of the problem. Then, we focus on two practical examples of two-dimensional regulatory networks: the bistable switch, for which the objective is to induce optimal transitions between its two stable steady states, and the damped genetic oscillator, where the goal is to induce sustained oscillatory behaviors. The resulting optimal control strategies can be expressed in state feedback form, involving both bang arcs and inactive control periods, and are shown to slide over certain separatrices of the uncontrolled system that characterize the boundaries of the admissibility set.
{"title":"On L1 and time-optimal state transitions in piecewise linear models of gene-regulatory networks","authors":"Agustín G. Yabo , Nicolas Augier","doi":"10.1016/j.nahs.2025.101650","DOIUrl":"10.1016/j.nahs.2025.101650","url":null,"abstract":"<div><div>In this paper, we investigate optimal state transfers for a generic class of piecewise-linear models widely used to qualitatively describe gene-regulatory networks. Motivated by the main practical drawbacks of artificially regulating gene expression through chemical inducers, the optimality of the transitions is defined as the convex combination of the total time and the <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> cost of the control. Solutions are studied through a Hybrid Pontryagin’s Maximum Principle approach, which allows to characterize the optimal trajectories and control for the general formulation of the problem. Then, we focus on two practical examples of two-dimensional regulatory networks: the bistable switch, for which the objective is to induce optimal transitions between its two stable steady states, and the damped genetic oscillator, where the goal is to induce sustained oscillatory behaviors. The resulting optimal control strategies can be expressed in state feedback form, involving both bang arcs and inactive control periods, and are shown to slide over certain separatrices of the uncontrolled system that characterize the boundaries of the admissibility set.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101650"},"PeriodicalIF":3.7,"publicationDate":"2025-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-16DOI: 10.1016/j.nahs.2025.101652
Yifu Feng , Zonghai Hu , Jiancun Wu , Engang Tian
Remote state estimation systems are vulnerable to malicious attacks, particularly when operating over unreliable communication networks with nonlinear dynamics. This paper proposes a stochastic critical-packet-based (SCPB) attack strategy that selectively targets packets according to their impact on the estimation process. A criticality indicator is defined as the difference between prior and posterior local estimates. Based on this indicator, a probabilistic attack mechanism is designed in which the attack success probability (ASP) increases with both packet importance and the assigned attack strength. To enhance the effectiveness of the attack, an adaptive energy adjustment scheme is introduced, assigning higher attack intensity to more critical packets. Theoretical analysis establishes explicit relationships among packet criticality, attack strength, ASP, and estimation performance degradation. Simulation results demonstrate that the proposed strategy induces significantly larger estimation errors than baseline attacks under the same average attack probability.
{"title":"Stochastic critical-packet-based attack on remote state estimation: From attackers’ perspective","authors":"Yifu Feng , Zonghai Hu , Jiancun Wu , Engang Tian","doi":"10.1016/j.nahs.2025.101652","DOIUrl":"10.1016/j.nahs.2025.101652","url":null,"abstract":"<div><div>Remote state estimation systems are vulnerable to malicious attacks, particularly when operating over unreliable communication networks with nonlinear dynamics. This paper proposes a stochastic critical-packet-based (SCPB) attack strategy that selectively targets packets according to their impact on the estimation process. A criticality indicator is defined as the difference between prior and posterior local estimates. Based on this indicator, a probabilistic attack mechanism is designed in which the attack success probability (ASP) increases with both packet importance and the assigned attack strength. To enhance the effectiveness of the attack, an adaptive energy adjustment scheme is introduced, assigning higher attack intensity to more critical packets. Theoretical analysis establishes explicit relationships among packet criticality, attack strength, ASP, and estimation performance degradation. Simulation results demonstrate that the proposed strategy induces significantly larger estimation errors than baseline attacks under the same average attack probability.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101652"},"PeriodicalIF":3.7,"publicationDate":"2025-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-11DOI: 10.1016/j.nahs.2025.101651
Roberto M. Fuentes , Gabriela W. Gabriel , André M. de Oliveira , Jonathan M. Palma
This paper studies the reference-tracking control problem for uncertain sampled-data systems with partial observation of the states. We show that, by robustly stabilizing the closed-loop system, the proposed digital controller ensures that the controlled output tracks constant set points. Moreover, new design conditions given in terms of Differential Linear Matrix Inequalities are presented for obtaining controllers with partial and complete measurements of the states. The design conditions are illustrated by numerical examples.
{"title":"Constant reference tracking control for uncertain linear sampled-data systems","authors":"Roberto M. Fuentes , Gabriela W. Gabriel , André M. de Oliveira , Jonathan M. Palma","doi":"10.1016/j.nahs.2025.101651","DOIUrl":"10.1016/j.nahs.2025.101651","url":null,"abstract":"<div><div>This paper studies the reference-tracking control problem for uncertain sampled-data systems with partial observation of the states. We show that, by robustly stabilizing the closed-loop system, the proposed digital controller ensures that the controlled output tracks constant set points. Moreover, new design conditions given in terms of Differential Linear Matrix Inequalities are presented for obtaining controllers with partial and complete measurements of the states. The design conditions are illustrated by numerical examples.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101651"},"PeriodicalIF":3.7,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145267872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-11DOI: 10.1016/j.nahs.2025.101648
Wei Ren
This paper addresses the state estimation problem of multi-agent systems under multiple networks and event-triggered mechanisms. Multiple networks are to accommodate physical separation of different agents, while event-triggered mechanisms are to address the resource constraints of networks. This setting results in the distributed structure and even the simultaneous design of distributed observers and event-triggered mechanisms. We follow the emulation-based approach to propose a novel hybrid model for the state estimation of multi-agent systems. Both Lyapunov-based conditions and distributed event-triggered mechanisms are established such that the estimation errors are convergent asymptotically. The proposed approach is further implemented to deal with the distributed observer-based controller design problem of multi-agent systems. Both the general framework is established and the conditions in the form of linear matrix inequalities are derived. Finally, the derived results are illustrated via two numerical examples from inverted pendulum robots and power systems.
{"title":"Distributed event-triggered observer design for networked multi-agent systems","authors":"Wei Ren","doi":"10.1016/j.nahs.2025.101648","DOIUrl":"10.1016/j.nahs.2025.101648","url":null,"abstract":"<div><div>This paper addresses the state estimation problem of multi-agent systems under multiple networks and event-triggered mechanisms. Multiple networks are to accommodate physical separation of different agents, while event-triggered mechanisms are to address the resource constraints of networks. This setting results in the distributed structure and even the simultaneous design of distributed observers and event-triggered mechanisms. We follow the emulation-based approach to propose a novel hybrid model for the state estimation of multi-agent systems. Both Lyapunov-based conditions and distributed event-triggered mechanisms are established such that the estimation errors are convergent asymptotically. The proposed approach is further implemented to deal with the distributed observer-based controller design problem of multi-agent systems. Both the general framework is established and the conditions in the form of linear matrix inequalities are derived. Finally, the derived results are illustrated via two numerical examples from inverted pendulum robots and power systems.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101648"},"PeriodicalIF":3.7,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145267874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号