This paper investigates the dynamic cluster consensus problem for second-order multi-agent leader–follower systems operating under directed communication topologies. Focusing on two scenarios, including single-chain leadership systems and multi-connection leadership systems, the study constructs a three-layer cooperative architecture that decouples the system into a leader layer, an intermediate follower layer, and a bottom follower layer. A consensus control protocol is then designed based on a hierarchical dynamic clustering strategy. For the single-chain system, a dynamic adjustment mechanism is proposed for the bottom-layer topology, and this mechanism utilizes a composite position-velocity error to achieve adaptive optimization of the communication links among neighbouring followers. For the multi-connection system, the method is extended to include dynamic adjustment of the leader–follower communication topology and an anchoring mechanism, thereby resolving issues of cluster partitioning and leader isolation. Furthermore, the design of a distributed control protocol with weight adjustment and an anti-ambiguity mechanism ensures that the system can form stable multi-cluster structures, achieve uniform convergence of states and velocities within each cluster, and maintain communication isolation between clusters. The theoretical analysis, grounded in graph theory and Lyapunov stability theory, proves the convergence of the system under weaker assumptions, while simulation results verify the effectiveness of the proposed method.
{"title":"Hierarchical Dynamic Cluster Consensus for Second-Order Multi-Agent Systems","authors":"Kexin Cai, Yineng Xiong, Yucheng Yang","doi":"10.1049/cth2.70092","DOIUrl":"https://doi.org/10.1049/cth2.70092","url":null,"abstract":"<p>This paper investigates the dynamic cluster consensus problem for second-order multi-agent leader–follower systems operating under directed communication topologies. Focusing on two scenarios, including single-chain leadership systems and multi-connection leadership systems, the study constructs a three-layer cooperative architecture that decouples the system into a leader layer, an intermediate follower layer, and a bottom follower layer. A consensus control protocol is then designed based on a hierarchical dynamic clustering strategy. For the single-chain system, a dynamic adjustment mechanism is proposed for the bottom-layer topology, and this mechanism utilizes a composite position-velocity error to achieve adaptive optimization of the communication links among neighbouring followers. For the multi-connection system, the method is extended to include dynamic adjustment of the leader–follower communication topology and an anchoring mechanism, thereby resolving issues of cluster partitioning and leader isolation. Furthermore, the design of a distributed control protocol with weight adjustment and an anti-ambiguity mechanism ensures that the system can form stable multi-cluster structures, achieve uniform convergence of states and velocities within each cluster, and maintain communication isolation between clusters. The theoretical analysis, grounded in graph theory and Lyapunov stability theory, proves the convergence of the system under weaker assumptions, while simulation results verify the effectiveness of the proposed method.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70092","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145739674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a flight control scheme utilizing a fully actuated auxiliary system is investigated to improve the manoeuvring flight performance and safety of manoeuvrability-limited unmanned autonomous helicopters (UAHs). A saturation-like function is employed to approximate state constraints. A dedicated fully actuated auxiliary system is integrated into the control framework to address the detrimental impacts induced by input saturation and state constraints. The control architecture is developed through a backstepping methodology. The stability of the closed-loop system is verified by Lyapunov stability analysis. Simulation results demonstrate that the proposed control scheme effectively resolves the flight control challenges associated with manoeuvrability limitations in UAHs and achieves superior tracking performance under the presence of state constraints and input saturation.
{"title":"Manoeuvrability Limitation-Based Flight Control for Unmanned Autonomous Helicopter With State Constraints and Input Saturation","authors":"Min Wan, Kenan Yong","doi":"10.1049/cth2.70094","DOIUrl":"https://doi.org/10.1049/cth2.70094","url":null,"abstract":"<p>In this paper, a flight control scheme utilizing a fully actuated auxiliary system is investigated to improve the manoeuvring flight performance and safety of manoeuvrability-limited unmanned autonomous helicopters (UAHs). A saturation-like function is employed to approximate state constraints. A dedicated fully actuated auxiliary system is integrated into the control framework to address the detrimental impacts induced by input saturation and state constraints. The control architecture is developed through a backstepping methodology. The stability of the closed-loop system is verified by Lyapunov stability analysis. Simulation results demonstrate that the proposed control scheme effectively resolves the flight control challenges associated with manoeuvrability limitations in UAHs and achieves superior tracking performance under the presence of state constraints and input saturation.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70094","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145695265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper investigates the error accumulation problem in centralized training and decentralized execution (CTDE) policy-based multi-agent reinforcement learning (MARL) algorithms, which arises from local observation inaccuracies. To address this issue, we propose a novel MARL algorithm that incorporates imitation learning using local observations. Firstly, by analysing the multi-agent proximal policy optimization algorithm and examining the problems arising when global states are replaced with local observations, it is proved that insufficient observations can lead to information loss, thereby introducing errors of advantage function, and it is demonstrated that the generalized advantage estimation method accumulates errors during the training process. Then, imitation learning is introduced and a novel training framework that combines reinforcement learning and imitation learning is proposed. During the reinforcement learning phase, an MARL agent trained with global observations acts as an expert. Subsequently, imitation learning is applied to train another agent that mimics the expert's decisions using only local observations. Finally, the effectiveness of this algorithm is verified in some commonly used multi-agent environments, which demonstrates its superior performance compared to traditional multi-agent reinforcement learning algorithms.
{"title":"Multi-Agent Reinforcement Learning Algorithm Based on Local Observation Imitation Learning","authors":"Hui Zhang, Jiachen Fu, Ya Zhang, Hongfei Du","doi":"10.1049/cth2.70097","DOIUrl":"10.1049/cth2.70097","url":null,"abstract":"<p>This paper investigates the error accumulation problem in centralized training and decentralized execution (CTDE) policy-based multi-agent reinforcement learning (MARL) algorithms, which arises from local observation inaccuracies. To address this issue, we propose a novel MARL algorithm that incorporates imitation learning using local observations. Firstly, by analysing the multi-agent proximal policy optimization algorithm and examining the problems arising when global states are replaced with local observations, it is proved that insufficient observations can lead to information loss, thereby introducing errors of advantage function, and it is demonstrated that the generalized advantage estimation method accumulates errors during the training process. Then, imitation learning is introduced and a novel training framework that combines reinforcement learning and imitation learning is proposed. During the reinforcement learning phase, an MARL agent trained with global observations acts as an expert. Subsequently, imitation learning is applied to train another agent that mimics the expert's decisions using only local observations. Finally, the effectiveness of this algorithm is verified in some commonly used multi-agent environments, which demonstrates its superior performance compared to traditional multi-agent reinforcement learning algorithms.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70097","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145686098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Willems' fundamental lemma (WFL) is widely used in the data-driven model predictive controllers (MPCs) to model the plant and predict its response to the given input sequence. The advantage of this model is that it can be incorporated as a linear matrix equality constraint into the optimization problem of MPC. However, the response of a dynamical system depends not only on the input applied to it but also on its initial condition. The WFL does not directly state anything about how the initial condition of the system should be defined and incorporated into the data-driven model equations. The conventional method for incorporating the initial condition of the system in a data-driven model is to insert a number of the most recent input and output samples of the system into the same data-driven model used for predicting the system's response, and this equation is then added as a new constraint to the optimization problem. This paper shows that the conventional method of incorporating the system's initial condition into the data-driven model is inaccurate and leads to errors in predicting the system's output. Moreover, the correct method for doing this has been presented for linear time-invariant systems, and the results have also been extended to the non-linear case. The proposed method has been used to design a data-driven MPC for a lab-scale wind turbine and experimental results have been presented.
{"title":"A Linear Data-Driven Model for Accurate Prediction of the Response of Non-Linear Dynamical Systems: Application to Data-Driven Output-Feedback Model Predictive Controller Design","authors":"Farshad Merrikh-Bayat, Majid Mokhtari","doi":"10.1049/cth2.70095","DOIUrl":"https://doi.org/10.1049/cth2.70095","url":null,"abstract":"<p>Willems' fundamental lemma (WFL) is widely used in the data-driven model predictive controllers (MPCs) to model the plant and predict its response to the given input sequence. The advantage of this model is that it can be incorporated as a linear matrix equality constraint into the optimization problem of MPC. However, the response of a dynamical system depends not only on the input applied to it but also on its initial condition. The WFL does not directly state anything about how the initial condition of the system should be defined and incorporated into the data-driven model equations. The conventional method for incorporating the initial condition of the system in a data-driven model is to insert a number of the most recent input and output samples of the system into the same data-driven model used for predicting the system's response, and this equation is then added as a new constraint to the optimization problem. This paper shows that the conventional method of incorporating the system's initial condition into the data-driven model is inaccurate and leads to errors in predicting the system's output. Moreover, the correct method for doing this has been presented for linear time-invariant systems, and the results have also been extended to the non-linear case. The proposed method has been used to design a data-driven MPC for a lab-scale wind turbine and experimental results have been presented.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70095","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145626259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper examines the issue of collision-avoidance trajectory tracking control in a multi-quadrotor unmanned aerial vehicle (UAV) slung load system, with particular emphasis on the scenario where the reference trajectory is unreachable. The challenge of tracking an unreachable reference trajectory is effectively addressed by integrating a trajectory planner and a trajectory tracking controller within a unified distributed model predictive control (DMPC) framework. Moreover, the nonlinear system is linearized using the first-order Taylor approximation, significantly simplifying the computation in DMPC. To ensure collision avoidance with both dynamic and static obstacles, the MINVO basis is employed to calculate the minimum volume of the exterior polyhedral approximation of the obstacles' trajectories, which is significantly smaller than that achieved using the B-spline or Bernstein bases typically utilized in the planning literature. Simulation experiments involving four UAVs, one payload, two static obstacles, and one dynamic obstacle are conducted to evaluate the effectiveness of the proposed DMPC method.
{"title":"Distributed MPC-Based Trajectory Tracking Control for a Multi-Quadrotor UAV Slung Load System","authors":"Chenlong Fu, Jinxian Wu, Li Dai, Yuanqing Xia","doi":"10.1049/cth2.70088","DOIUrl":"https://doi.org/10.1049/cth2.70088","url":null,"abstract":"<p>This paper examines the issue of collision-avoidance trajectory tracking control in a multi-quadrotor unmanned aerial vehicle (UAV) slung load system, with particular emphasis on the scenario where the reference trajectory is unreachable. The challenge of tracking an unreachable reference trajectory is effectively addressed by integrating a trajectory planner and a trajectory tracking controller within a unified distributed model predictive control (DMPC) framework. Moreover, the nonlinear system is linearized using the first-order Taylor approximation, significantly simplifying the computation in DMPC. To ensure collision avoidance with both dynamic and static obstacles, the MINVO basis is employed to calculate the minimum volume of the exterior polyhedral approximation of the obstacles' trajectories, which is significantly smaller than that achieved using the B-spline or Bernstein bases typically utilized in the planning literature. Simulation experiments involving four UAVs, one payload, two static obstacles, and one dynamic obstacle are conducted to evaluate the effectiveness of the proposed DMPC method.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70088","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145626260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a fault detection method for uncertain systems under denial-of-service (DoS) attack using a probabilistic approach. Model uncertainties, disturbances, and faults are systematically described using probabilistic parameter models. An aperiodic DoS attack model is introduced, with limitations only on the duration and frequency of the attack. By using a randomized algorithm, a switched fault detection filter is constructed, and a threshold is designed to achieve a balance between the false alarm and fault detection rate. The feasibility of the developed method is illustrated through experimental validation conducted on an unmanned surface vehicle system.
{"title":"A New Fault Detection Method for Systems With Uncertainty Under Denial-of-Service Attack","authors":"Zhen Zhao, Peter Xiaoping Liu, Jinfeng Gao","doi":"10.1049/cth2.70093","DOIUrl":"https://doi.org/10.1049/cth2.70093","url":null,"abstract":"<p>This paper presents a fault detection method for uncertain systems under denial-of-service (DoS) attack using a probabilistic approach. Model uncertainties, disturbances, and faults are systematically described using probabilistic parameter models. An aperiodic DoS attack model is introduced, with limitations only on the duration and frequency of the attack. By using a randomized algorithm, a switched fault detection filter is constructed, and a threshold is designed to achieve a balance between the false alarm and fault detection rate. The feasibility of the developed method is illustrated through experimental validation conducted on an unmanned surface vehicle system.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70093","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145626244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}