Automatica最新文献_第5页

Cooperative optimal surface coverage control of multi-agent systems in non-convex surface environments 非凸表面环境下多智能体系统的协同最优表面覆盖控制

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-26 DOI: 10.1016/j.automatica.2025.112808

Hai-Tao Zhang , Jiayu Zou , Xingjian Liu

引用次数: 0

A two-layer adaptive control framework for prescribed performance in unmanned aerial vehicles 针对无人机规定性能的两层自适应控制框架

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-22 DOI: 10.1016/j.automatica.2025.112783

Linghuan Kong , Wei He , Carlos Silvestre

引用次数: 0

Information-triggered learning with application to learning-based predictive control 信息触发学习及其在基于学习的预测控制中的应用

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-19 DOI: 10.1016/j.automatica.2025.112746

Kaikai Zheng , Dawei Shi , Sandra Hirche , Yang Shi

{"title":"Information-triggered learning with application to learning-based predictive control","authors":"Kaikai Zheng , Dawei Shi , Sandra Hirche , Yang Shi","doi":"10.1016/j.automatica.2025.112746","DOIUrl":"10.1016/j.automatica.2025.112746","url":null,"abstract":"<div><div>Learning-based control has attracted significant attention in recent years, especially for plants that are difficult to model based on first-principles. A key issue in learning-based control is how to make efficient use of data as the abundance of data becomes overwhelming. To address this issue, this work proposes an information-triggered learning framework and a corresponding learning-based controller design approach with guaranteed stability. Specifically, we consider a linear time-invariant system with unknown dynamics. A set-membership approach is introduced to learn a parametric uncertainty set for the unknown dynamics. Then, a data selection mechanism is proposed by evaluating the incremental information in a data sample, where the incremental information is quantified by its effects on shrinking the parametric uncertainty set. Next, after introducing a stability criterion using the set-membership estimate of the system dynamics, a robust learning-based predictive controller (LPC) is designed by minimizing a worst-case cost function. The closed-loop stability of the LPC equipped with the information-triggered learning protocol is discussed within a high-probability framework. Finally, comparative numerical experiments are performed to verify the validity of the proposed approach.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112746"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145799193","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}

引用次数: 0

A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives 基于行程时间和能耗目标的车辆速度规划的凸重构

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-29 DOI: 10.1016/j.automatica.2025.112811

Luca Consolini, Mattia Laurini, Marco Locatelli

{"title":"A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives","authors":"Luca Consolini, Mattia Laurini, Marco Locatelli","doi":"10.1016/j.automatica.2025.112811","DOIUrl":"10.1016/j.automatica.2025.112811","url":null,"abstract":"<div><div>In this paper we address the speed planning problem for a vehicle along a predefined path. A weighted sum of two conflicting objectives, energy consumption and travel time, is minimized. After deriving a non-convex mathematical model of the problem, we prove that the feasible region of this problem is a lattice. Moreover, we introduce a feasibility-based bound-tightening technique which allows us to derive the minimum and maximum element of the lattice, or establish that the feasible region is empty. We prove the exactness of a convex relaxation of the non-convex problem, obtained by replacing all constraints with the lower and upper bounds for the variables corresponding to the minimum and maximum elements of the lattice, respectively. After proving some properties of optimal solutions of the convex relaxation, we exploit them to develop a dynamic programming approach returning an approximate solution to the convex relaxation, and with time complexity <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>, where <span><math><mi>n</mi></math></span> is the number of points into which the continuous path is discretized.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112811"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884851","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}

引用次数: 0

Safety-critical control of discontinuous systems with nonsmooth safe sets 非光滑安全集不连续系统的安全临界控制

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-23 DOI: 10.1016/j.automatica.2025.112780

Mohammed M.J. Alyaseen, Nikolay Atanasov, Jorge Cortes

引用次数: 0

Exploring the complex relationship between virus transmission and opinion evolution: An individual-based approach 病毒传播与舆论演变之间的复杂关系：基于个体的方法

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-16 DOI: 10.1016/j.automatica.2025.112757

Shidong Zhai , Ji Xiang Cao , Wei Zhu

引用次数: 0

Systematic LMI approaches to design multivariable sliding mode controllers for uncertain systems 不确定系统多变量滑模控制器设计的系统LMI方法

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-17 DOI: 10.1016/j.automatica.2025.112747

Pedro Henrique Silva Coutinho , Iury Bessa , Victor Hugo Pereira Rodrigues , Tiago Roux Oliveira

引用次数: 0

A game-theoretic framework for distributed load balancing: Static and dynamic game models 分布式负载平衡的博弈论框架：静态和动态博弈模型

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-22 DOI: 10.1016/j.automatica.2025.112796

Fatemeh Fardno , S. Rasoul Etesami

{"title":"A game-theoretic framework for distributed load balancing: Static and dynamic game models","authors":"Fatemeh Fardno , S. Rasoul Etesami","doi":"10.1016/j.automatica.2025.112796","DOIUrl":"10.1016/j.automatica.2025.112796","url":null,"abstract":"<div><div>Motivated by applications in job scheduling, queuing networks, and load balancing in cyber–physical systems, we develop and analyze a game-theoretic framework to balance the load among servers in static and dynamic settings. In these applications, jobs/tasks are held by selfish entities that do not want to coordinate with each other, yet the goal is to balance the load among servers in a distributed manner. First, we provide a static game formulation in which each player holds a job with a specific processing requirement and wants to schedule it fractionally among a set of heterogeneous servers to minimize its average processing time. We show that this static game is a potential game with a pure Nash equilibrium (NE). In particular, the best-response dynamics converge to such an NE after <span><math><mi>n</mi></math></span> iterations, where <span><math><mi>n</mi></math></span> is the number of players. Additionally, we bound the price of anarchy (PoA) of the static game in terms of game parameters. We then extend our results to a dynamic game setting, where jobs arrive and get processed, and players observe the load on the servers to decide how to schedule their jobs. In this setting, we show that if the players update their strategies using dynamic best-response, the system eventually becomes fully load-balanced and the players’ strategies converge to the pure NE of the static game. In particular, we show that the convergence time scales only polynomially with respect to the game parameters. Finally, we provide numerical results to evaluate the performance of our proposed algorithms.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112796"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841282","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}

引用次数: 0

Strongly stabilizing the Acrobot by optimizing maximal relative stability via observation point selection 通过观察点选择优化最大相对稳定性，使Acrobot具有较强的稳定性

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2025-12-30 DOI: 10.1016/j.automatica.2025.112814

Xin Xin , Xiaohui Ji , Ziyu Wang , Yannian Liu

引用次数: 0

Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs 有向图上多群资源分配博弈的分布式纳什均衡计算

IF 5.9 2区计算机科学

Automatica Pub Date : 2026-03-01 Epub Date: 2026-01-02 DOI: 10.1016/j.automatica.2025.112816

Jialing Zhou , Guanghui Wen , Yuezu Lv , Xinlei Yi , Tao Yang , Karl Henrik Johansson

{"title":"Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs","authors":"Jialing Zhou , Guanghui Wen , Yuezu Lv , Xinlei Yi , Tao Yang , Karl Henrik Johansson","doi":"10.1016/j.automatica.2025.112816","DOIUrl":"10.1016/j.automatica.2025.112816","url":null,"abstract":"<div><div>The existing distributed resource allocation (DRA) algorithms for multi-agent networks can rarely be implemented for multiple interacting groups of agents with conflicts of interest. The directed interaction, together with the hard balance constraint that follows from maintaining supply–demand balance during the execution process, make the DRA more challenging. To address this problem, the paper studies DRA over multiple interacting groups from a game-theoretic perspective, introducing the resource allocation game (RAG). A novel out-Laplacian matrix based methodology is developed for distributed Nash equilibrium (NE) computation. Following this methodology, distributed algorithms are designed using leader-follower tracking protocols to estimate partial derivatives of individual objective functions for the RAG. A reduced-order distributed algorithm is further developed for the RAG by integrating a gradient-tracking mechanism for estimating partial derivatives of group-level objective functions. It is shown that agent states converge to the NE of the games linearly while satisfying the balance constraint during the whole execution process under the proposed algorithms. The effectiveness of the proposed algorithms is illustrated through numerical examples.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"185 ","pages":"Article 112816"},"PeriodicalIF":5.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884850","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}

引用次数: 0