AutomaticaPub Date : 2026-03-01Epub Date: 2026-01-02DOI: 10.1016/j.automatica.2025.112817
Han Wang, Zheng Chen
{"title":"Parametrization approach for real-time generation of minimum-effort trajectories via neural network","authors":"Han Wang, Zheng Chen","doi":"10.1016/j.automatica.2025.112817","DOIUrl":"10.1016/j.automatica.2025.112817","url":null,"abstract":"<div><div>This paper is concerned with real-time generation of optimal flight trajectories for Minimum-Effort Control Problems (MECPs), which is fundamentally important for autonomous flight of aerospace vehicles. Although existing optimal control methods, such as indirect methods and direct methods, can be amended to solve MECPs, it is very challenging to obtain, in real time, the solution trajectories since those methods suffer the issue of convergence. As the artificial neural network can generate its output within a constant time, it has been alternative for real-time generation of optimal trajectories in the literature. The usual way is to train neural networks by solutions from indirect or direct methods, which, however, cannot ensure sufficient conditions for local optimality to be met. As a result, the trained neural networks cannot be guaranteed to generate at least locally optimal trajectories. To address this issue, a parametrization approach is developed in the paper so that not only necessary but also sufficient conditions for local optimality are embedded into a parameterized set of differential equations. This allows generating the dataset of at least locally optimal trajectories through solving some initial value problems. Once a neural network is trained by the dataset constructed by the parametrization approach, it not only can generate optimal trajectories within milliseconds but also ensure the generated trajectories to be at least locally optimal, as finally demonstrated by two conventional MECPs in aerospace engineering.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112817"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884871","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2026-01-07DOI: 10.1016/j.automatica.2026.112819
Yao Li , Chengpu Yu , Hao Fang , Jie Chen
{"title":"Inverse optimal control for linear quadratic tracking with unknown target states","authors":"Yao Li , Chengpu Yu , Hao Fang , Jie Chen","doi":"10.1016/j.automatica.2026.112819","DOIUrl":"10.1016/j.automatica.2026.112819","url":null,"abstract":"<div><div>This paper addresses the inverse optimal control for the linear quadratic tracking problem with a fixed but unknown target state, which aims to estimate the possible triplets comprising the target state, the state weight matrix, and the input weight matrix from observed optimal control input and the corresponding state trajectories. Sufficient conditions have been provided for the unique determination of both the linear quadratic cost function as well as the target state. A computationally efficient and numerically reliable parameter identification algorithm is proposed by equating optimal control strategies with a system of linear equations, and the associated relative error upper bound is derived in terms of data volume and signal-to-noise ratio (SNR). Moreover, the proposed inverse optimal control algorithm is applied for the joint cluster coordination and intent identification of a multi-agent system. By incorporating the structural constraint of the Laplace matrix, the relative error upper bound can be reduced accordingly. Finally, the algorithm’s efficiency and accuracy are validated by a vehicle-on-a-lever example and a multi-agent formation control example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112819"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145939142","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-20DOI: 10.1016/j.automatica.2025.112792
Sibren Lagauw, Lukas Vanpoucke, Bart De Moor
{"title":"Exact solution to the least squares realization problem as a multiparameter eigenvalue problem","authors":"Sibren Lagauw, Lukas Vanpoucke, Bart De Moor","doi":"10.1016/j.automatica.2025.112792","DOIUrl":"10.1016/j.automatica.2025.112792","url":null,"abstract":"<div><div>We consider the least squares (LS) realization of an autonomous single-output linear time-invariant dynamical model for a given sequence of output data. As opposed to standard system identification practices, which often rely on (heuristic) iterative optimization techniques, we propose an exact solution to this non-convex optimization problem: the <em>globally optimal</em> solution(s) are identified by means of a <em>deterministic</em> eigenvalue procedure. In particular, we illustrate that for all (local) minimizers, the corresponding misfit can be characterized as the result of filtering an unknown signal twice through a finite-impulse response filter. Exploiting this insight, we propose a novel (rectangular) multiparameter eigenvalue problem (MEP), the eigentuples of which allow to retrieve all local and global minimizers of the identification problem. The proposed MEP is of great theoretical interest and offers new insights into the structure of the LS realization problem, which we explore in detail. We provide numerical examples to illustrate our findings.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112792"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784437","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-20DOI: 10.1016/j.automatica.2025.112781
Zhihe Zhuang , Rodrigo A. González , Hongfeng Tao , Wojciech Paszke , Tom Oomen
{"title":"Data-enabled iterative learning control: A zero-sum game design for time-scale-varying tasks","authors":"Zhihe Zhuang , Rodrigo A. González , Hongfeng Tao , Wojciech Paszke , Tom Oomen","doi":"10.1016/j.automatica.2025.112781","DOIUrl":"10.1016/j.automatica.2025.112781","url":null,"abstract":"<div><div>Iterative learning control (ILC) is an intelligent control methodology for tackling iteration-invariant exogenous inputs. It is of great significance to develop its extrapolation for more general repetitive tasks with mutual similarity, e.g., tasks with different time scales. In practice, discrete-time ILC with sampling behavior for time-scale-varying tasks suffers from the failure of perfect corresponding learning and environment-dependent iteration-varying disturbances. This paper develops a novel direct data-based ILC algorithm using off-policy Q-learning for tasks with varying time scales, enabling the robust learning of an optimal ILC policy from experimental input/output (I/O) data. From a two-player zero-sum game perspective, the iteration-varying disturbance generated from the varying time scales of repetitive tasks is tackled quantitatively with a preset disturbance attenuation level. Further, to emphasize the importance of theoretical guarantees of reinforcement learning (RL)-based ILC designs, the data efficiency of the developed algorithm is enhanced based on Willems’ Fundamental Lemma, and a rigorous convergence analysis is given. The simulation model of an F-16 aircraft autopilot is employed to show the effectiveness of the developed approach.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112781"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145784438","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-22DOI: 10.1016/j.automatica.2025.112762
Yangyang Qian , Zongli Lin , Yacov A. Shamash
{"title":"A multi-objective hierarchical control framework for battery units in DC microgrids using improved adaptive droop control","authors":"Yangyang Qian , Zongli Lin , Yacov A. Shamash","doi":"10.1016/j.automatica.2025.112762","DOIUrl":"10.1016/j.automatica.2025.112762","url":null,"abstract":"<div><div>We investigate the primary/secondary control problem for battery units with adaptive droop control in DC microgrids. A majority of existing control methods for state-of-charge (SoC) balancing among battery units require that the terminal voltage of each battery unit remains constant. To remove such a requirement, at the primary control level, we propose an improved adaptive droop control method by introducing an auxiliary battery state in terms of the battery parameters, the terminal voltage, and a power function of the SoC. The designed droop coefficient is inversely proportional to the auxiliary battery state. It is shown that the proposed adaptive droop control achieves proportional power sharing and SoC balancing, albeit at a cost of compromised voltage regulation. A salient feature of the proposed adaptive droop control method is that the battery’s terminal voltage is allowed to be time-varying. Moreover, to compensate for the voltage deviation caused by the improved adaptive droop control, we propose a consensus-based distributed control scheme at the secondary control level. It is shown that the resulting hierarchical control framework, consisting of the primary and secondary control levels, guarantees that the control objectives of voltage regulation, proportional power sharing, and SoC balancing are all achieved. Simulation studies based on an accurate electrical battery model validate the effectiveness of our multi-objective hierarchical control framework.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112762"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841798","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-19DOI: 10.1016/j.automatica.2025.112772
Juntao Li , Cong Liang , Deyuan Meng
{"title":"Distributed algorithms for solving linear algebraic equations: An optimal control perspective","authors":"Juntao Li , Cong Liang , Deyuan Meng","doi":"10.1016/j.automatica.2025.112772","DOIUrl":"10.1016/j.automatica.2025.112772","url":null,"abstract":"<div><div>Designing superior distributed algorithms for solving linear algebraic equations (LAEs) plays a crucial role in engineering and computer science fields. This paper proposes two discrete distributed algorithms for solving LAEs from the perspective of optimal control. By benefiting from the devised error system and constructed performance index, the presented algorithms can converge R-linearly to a solution of LAEs without solving algebraic Riccati equations. In particular, the full-row rank requirements on sub-matrices are eliminated in row partitioning framework. Moreover, the need for communication exchange among all agents within the same cluster is alleviated, and only one state variable is updated in the row-wise arbitrary column partitioning framework. Simulation results demonstrate that the proposed distributed algorithms outperform non-optimal control design algorithms in terms of convergence performance.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112772"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799603","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-15DOI: 10.1016/j.automatica.2025.112725
Xiaoming Duan , Yagiz Savas , Rui Yan , Zhe Xu , Ufuk Topcu
{"title":"Corrigendum to ‘On the Detection of Markov Decision Processes’ [Automatica 175 (2025) 112196]","authors":"Xiaoming Duan , Yagiz Savas , Rui Yan , Zhe Xu , Ufuk Topcu","doi":"10.1016/j.automatica.2025.112725","DOIUrl":"10.1016/j.automatica.2025.112725","url":null,"abstract":"","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112725"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799606","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-17DOI: 10.1016/j.automatica.2025.112732
Robin Strässer , Manuel Schaller , Karl Worthmann , Julian Berberich , Frank Allgöwer
{"title":"SafEDMD: A Koopman-based data-driven controller design framework for nonlinear dynamical systems","authors":"Robin Strässer , Manuel Schaller , Karl Worthmann , Julian Berberich , Frank Allgöwer","doi":"10.1016/j.automatica.2025.112732","DOIUrl":"10.1016/j.automatica.2025.112732","url":null,"abstract":"<div><div>The Koopman operator serves as the theoretical backbone for machine learning of dynamical control systems, where the operator is heuristically approximated by extended dynamic mode decomposition (EDMD). In this paper, we propose SafEDMD, a novel stability- and feedback-oriented EDMD-based controller design framework. Our approach leverages a reliable surrogate model generated in a data-driven fashion in order to provide closed-loop guarantees. In particular, we establish a controller design based on semi-definite programming with guaranteed stabilization of the underlying nonlinear system. As central ingredient, we derive proportional error bounds that vanish at the origin and are tailored to control tasks. We illustrate the developed method by means of several benchmark examples and highlight the advantages over state-of-the-art methods.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112732"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799657","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-18DOI: 10.1016/j.automatica.2025.112770
Kaixin Lu , Ziliang Lyu , Haoyong Yu
{"title":"Inverse optimal design of input-to-state stabilizing homogeneous controllers for nonlinear homogeneous systems","authors":"Kaixin Lu , Ziliang Lyu , Haoyong Yu","doi":"10.1016/j.automatica.2025.112770","DOIUrl":"10.1016/j.automatica.2025.112770","url":null,"abstract":"<div><div>This work studies the inverse optimality of input-to-state stabilizing controllers with input–output stability guarantees for nonlinear homogeneous systems. We formulate a new inverse optimal control problem, where the cost functional incorporates penalties on the output, in addition to the state, control and disturbance as in current related works. One benefit of penalizing the output is that the resulting inverse optimal controllers can ensure both input-to-state stability and input–output stability. We propose a technique for constructing the corresponding meaningful cost functional by using homogeneity properties, and provide sufficient conditions on solving the inverse optimal gain assignment problem. We show that homogeneous stabilizability of homogeneous systems in the case without disturbance is sufficient for the solvability of inverse optimal gain assignment problem for homogeneous systems.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112770"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799649","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}
AutomaticaPub Date : 2026-03-01Epub Date: 2025-12-18DOI: 10.1016/j.automatica.2025.112793
Rui Gao , Jiangshuai Huang , Changyun Wen
{"title":"Event-triggered privacy-preserving consensus of uncertain nonlinear systems: A full output mask approach","authors":"Rui Gao , Jiangshuai Huang , Changyun Wen","doi":"10.1016/j.automatica.2025.112793","DOIUrl":"10.1016/j.automatica.2025.112793","url":null,"abstract":"<div><div>Achieving distributed task execution with privacy preservation in multi-agent dynamical systems under eavesdropping attacks remains a challenging problem. Most existing schemes focus on eavesdroppers between adjacent agents, while state information leakage from controller or parameter estimator channels via smart eavesdroppers is rarely considered. Moreover, uncertainty of nonlinear multi-agent systems cannot be addressed by approaches developed for linear systems. This paper proposes a control framework that combines a full output mask method with an event-triggered mechanism. Output mask functions are applied to both sensor and parameter estimator channels to resist eavesdroppers on inter-agent links as well as on agents own channels. To overcome the non-differentiability of virtual controllers caused by masked outputs with unknown forms and parameters, each recursive step employs unmasked raw information. Coupling among leader-following consensus, parameter estimation, and privacy protection in uncertain nonlinear multi-agent systems is further addressed through multi-channel triggering conditions and parameter design. Theoretical analysis proves that output consensus tracking errors converge to a small set while ensuring privacy preservation, which is validated by simulation results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112793"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799651","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}