AutomaticaPub Date : 2025-06-19DOI: 10.1016/j.automatica.2025.112429
Nils Christian Aars Wilhelmsen , Pauline Marie Nüsse , Adrian Ambrus , Ole Morten Aamo
{"title":"Modelling and detection of slipping in distributed damping subs for drillstring torsional vibration mitigation","authors":"Nils Christian Aars Wilhelmsen , Pauline Marie Nüsse , Adrian Ambrus , Ole Morten Aamo","doi":"10.1016/j.automatica.2025.112429","DOIUrl":"10.1016/j.automatica.2025.112429","url":null,"abstract":"<div><div>Torsional vibrations during drilling are detrimental to the equipment used and result in sub-optimal performance. A recently developed method to mitigate such vibrations involves the use of distributed damping subs fitted around the drillstring at various locations throughout non-vertical sections of the well. An eddy current brake, which may be actively controlled in practice, dampens the vibrations but the reactionary torque results in lateral motion of the subs which may cause slipping. To minimize slipping between the damping subs and the wellbore wall during operation, the controller needs to know if and when this happens in order to alter the control input accordingly. A control-oriented mathematical model is derived to describe the lateral and torsional motion of a sub within the wellbore, with the wellbore friction modelled as Coulomb friction with stiction. Next, a slip detection algorithm based on measurements from inertial measurement units placed within the damping sub is proposed. A simulation of the control-oriented damping sub model coupled to a low-order drillstring model featuring torsional vibrations is presented, where the reactionary damping torque causes the sub to slip along the wellbore wall. Simulated accelerometer signals and the resultant residual for detecting slippage are shown to demonstrate the methodology. The slip detection methodology is further verified on data from a high-fidelity simulator.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112429"},"PeriodicalIF":4.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144312723","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 : 2025-06-19DOI: 10.1016/j.automatica.2025.112443
Yiwen Qi , Caibin Yao , Choon Ki Ahn , Dong Shen , Ziyu Qu
{"title":"Dual-variable iterative learning control for switched systems with iteration experience succession strategy","authors":"Yiwen Qi , Caibin Yao , Choon Ki Ahn , Dong Shen , Ziyu Qu","doi":"10.1016/j.automatica.2025.112443","DOIUrl":"10.1016/j.automatica.2025.112443","url":null,"abstract":"<div><div>Iterative learning control (ILC) refers to the optimal control of repetitive systems. It is a thorny problem that ILC is maliciously terminated during any single run, resulting in different running lengths. In addition, reinforcement learning is an intelligent approach to finding the optimal controller gains for system performance improvement. In this paper, dual variable ILC (DV-ILC) for switched systems with arbitrary switching rules is examined. First, for variable iteration run lengths induced by security issues, an iteration experience succession strategy (IESS) is proposed, and the minimum number of iterations is presented. Second, a reinforcement learning optimizer is adopted to continuously regulate variable controller gains. The controller is designed in the form of an open-loop P-type and a closed-loop PD-type working together, meaning that both current and historical information can be fully utilized. In addition, the tracking error convergence in the iteration domain is proved. Finally, the simulations prove the effectiveness of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112443"},"PeriodicalIF":4.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144313454","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 : 2025-06-19DOI: 10.1016/j.automatica.2025.112432
Xiaoxu Lyu , Shilei Li , Dawei Shi , Ling Shi
{"title":"On the effects of modeling errors on distributed continuous-time filtering","authors":"Xiaoxu Lyu , Shilei Li , Dawei Shi , Ling Shi","doi":"10.1016/j.automatica.2025.112432","DOIUrl":"10.1016/j.automatica.2025.112432","url":null,"abstract":"<div><div>This paper offers a comprehensive performance analysis of the distributed continuous-time filtering in the presence of modeling errors. First, we introduce two performance indices, namely the nominal performance index and the estimation error covariance. By leveraging the nominal performance index and the Frobenius norm of the modeling deviations, we derive the bounds of the estimation error covariance and the lower bound of the nominal performance index. Specifically, we reveal the effect of the consensus parameter on both bounds. We demonstrate that, under specific conditions, an incorrect process noise covariance can lead to the divergence of the estimation error covariance. Moreover, we investigate the properties of the eigenvalues of the error dynamical matrix. Furthermore, we explore the magnitude relations between the nominal performance index and the estimation error covariance. Finally, we present some numerical simulations to validate the effectiveness of the theoretical results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112432"},"PeriodicalIF":4.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144313455","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}
{"title":"A privacy preserving distributed controller for the general formation of multi-agent systems in port-Hamiltonian form","authors":"Jingyi Zhao , Yongxin Wu , Yuhu Wu , Yann Le Gorrec","doi":"10.1016/j.automatica.2025.112452","DOIUrl":"10.1016/j.automatica.2025.112452","url":null,"abstract":"<div><div>This paper considers the general formation control problem under the port-Hamiltonian framework and proposes a method to meet the requirements of general formation control while protecting agent privacy. First, the general formation control problem is expressed as an optimization problem whose solution satisfies the requirements of the general formation. To protect the sensitive data of each agent, a distributed controller is designed through the desired general formation output dynamic, which still maintains a port-Hamiltonian form, making the Hamiltonian function the natural choice for the Lyapunov function candidate. It is then shown that the designed system converges exponentially to the global optimum of the optimization problem. Finally, simulations on an application case, namely underactuated unmanned surface vehicles with different parameters are provided to verify the effectiveness of the proposed method.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112452"},"PeriodicalIF":4.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144322911","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 : 2025-06-19DOI: 10.1016/j.automatica.2025.112438
Hoai-Nam Nguyen
{"title":"Scalable command governor via semi-ellipsoidal set for linear systems with time-varying soft constraints","authors":"Hoai-Nam Nguyen","doi":"10.1016/j.automatica.2025.112438","DOIUrl":"10.1016/j.automatica.2025.112438","url":null,"abstract":"<div><div>This paper provides a solution for a command governor (CG) that employs a semi-ellipsoidal set. The motivation is driven by the need to address the shortcomings of polyhedral and ellipsoidal sets widely used in CG. In particular for many applications, polyhedral sets require a large number of linear inequality constraints while ellipsoidal sets are too conservative. Furthermore, both types of sets are generally designed for systems with time-invariant and hard constraints. The contributions of the paper are: (i) we provide new convex conditions to construct an invariant and constraint-admissible semi-ellipsoidal set for discrete-time linear systems with time-varying soft constraints; (ii) we propose a computationally efficient procedure to solve the online optimization problem associated with the newly introduced semi-ellipsoidal set in CG. Three numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed approach.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112438"},"PeriodicalIF":4.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144322954","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 : 2025-06-18DOI: 10.1016/j.automatica.2025.112449
Lakshmi Mandal, Shalabh Bhatnagar
{"title":"n-step temporal difference learning with optimal n","authors":"Lakshmi Mandal, Shalabh Bhatnagar","doi":"10.1016/j.automatica.2025.112449","DOIUrl":"10.1016/j.automatica.2025.112449","url":null,"abstract":"<div><div>We consider the problem of finding the optimal value of <span><math><mi>n</mi></math></span> in the <span><math><mi>n</mi></math></span>-step temporal difference (TD) learning algorithm. Our objective function for the optimization problem is the average root mean squared error (RMSE). We find the optimal <span><math><mi>n</mi></math></span> by resorting to a model-free optimization technique involving a one-simulation simultaneous perturbation stochastic approximation (SPSA) based procedure. Whereas SPSA is a zeroth-order continuous optimization procedure, we adapt it to the discrete optimization setting by using a random projection operator. We prove the asymptotic convergence of the recursion by showing that the sequence of <span><math><mi>n</mi></math></span>-updates obtained using zeroth-order stochastic gradient search converges almost surely to an internally chain transitive invariant set of an associated differential inclusion. This results in convergence of the discrete parameter sequence to the optimal <span><math><mi>n</mi></math></span> in <span><math><mi>n</mi></math></span>-step TD. Through experiments, we show that the optimal value of <span><math><mi>n</mi></math></span> is achieved with our SDPSA algorithm for arbitrary initial values. We further show using numerical evaluations that SDPSA outperforms the state-of-the-art discrete parameter stochastic optimization algorithm ‘Optimal Computing Budget Allocation (OCBA)’ on benchmark RL tasks.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112449"},"PeriodicalIF":4.8,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144312724","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 : 2025-06-17DOI: 10.1016/j.automatica.2025.112430
Zhaoyang Cuan, Da-Wei Ding
{"title":"Adaptive tracking control of state-constrained uncertain nonlinear cyber–physical systems against deception attacks","authors":"Zhaoyang Cuan, Da-Wei Ding","doi":"10.1016/j.automatica.2025.112430","DOIUrl":"10.1016/j.automatica.2025.112430","url":null,"abstract":"<div><div>A novel adaptive tracking control scheme is developed to cope with the tracking control issue for a category of state-constrained nonlinear cyber–physical systems (CPSs) with exogenous interferences, which are subject to deception attacks started in controller–actuator (C–A) channel. Different from most existing works, such type of state constraints own a distinct characteristic that they occur some time after the initial time instant of control operation. An error shifting function and a barrier Lyapunov function (BLF) with varying barrier boundaries are designed to promote the development of a novel adaptive tracking control method, which does not depend on the precise system model, and can dispose of the exogenous perturbations and deception attacks simultaneously. In particular, the developed control architecture can not only make sure that all the tracking errors get into a pre-defined small region of the equilibrium point, but also guarantee the total signals of the closed loop system conform to the corresponding state constraints in fixed time even if the initial state constraints are not satisfied. Significantly, the tracking precision degree is known beforehand and could be preseted by restructuring the control design parameters suitably. Eventually, the effectiveness and superiority of the proposed control framework are theoretically authenticated and practically illustrated through a representative application example.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112430"},"PeriodicalIF":4.8,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144298389","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}
{"title":"Emergence of partial tracking in the set of active pursuer–evader pairs in Euclidean space","authors":"Hyunjin Ahn , Junhyeok Byeon , Seung-Yeal Ha , Jaeyoung Yoon","doi":"10.1016/j.automatica.2025.112445","DOIUrl":"10.1016/j.automatica.2025.112445","url":null,"abstract":"<div><div>We study the emergence of partial tracking in the ensemble of active pursuer–evader pairs. Partial tracking represents a phenomenon in which some proper subset of the whole ensemble achieves asymptotic tracking, whereas the rest of pairs does not achieve asymptotic tracking. In previous literature, tracking problem has been studied for the set of passive pursuer–evader pairs. For the dynamic modeling of active evaders, we use a repulsion force modeling the avoidance of pursuers. We present a sufficient framework for qualitative and quantitative partial tracking using energy methods. We also provide several numerical simulations and compare them with analytical results.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112445"},"PeriodicalIF":4.8,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144298388","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 : 2025-06-17DOI: 10.1016/j.automatica.2025.112451
Long Hu , Qing Zhang
{"title":"Boundary stabilization of linear hyperbolic integro-differential equation with time-dependent coefficients","authors":"Long Hu , Qing Zhang","doi":"10.1016/j.automatica.2025.112451","DOIUrl":"10.1016/j.automatica.2025.112451","url":null,"abstract":"<div><div>This paper is concerned with the boundary stabilization in finite time of first-order linear hyperbolic partial integro-differential equation (PIDE) with time-varying coefficients. By extending the so-called backstepping method, we derive a full-state feedback control law that allows the closed-loop system to converge to the zero equilibrium under minimal settling time. The well-posedness of the kernel equation, which evolves on the multi-dimensional unbounded spatiotemporal domain, is the main technical problem, the proof of which requires careful use of successive approximation approach with new recursive bound. This work extends existing results for the system where the characteristic speed was only time-independent.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112451"},"PeriodicalIF":4.8,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144298391","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 : 2025-06-17DOI: 10.1016/j.automatica.2025.112437
Maxence Lamarque , Jean Auriol , Delphine Bresch-Pietri
{"title":"Converse Lyapunov theorem for Input-to-State Stability of Linear Integral Difference Equations","authors":"Maxence Lamarque , Jean Auriol , Delphine Bresch-Pietri","doi":"10.1016/j.automatica.2025.112437","DOIUrl":"10.1016/j.automatica.2025.112437","url":null,"abstract":"<div><div>This paper investigates necessary and sufficient Lyapunov conditions for Input-to-State Stability (ISS) of Linear Integral Difference Equations in the presence of an additional exogenous signal. Building on recent research in the literature pertaining to necessary conditions for the exponential stability of difference equations, we introduce a quadratic Lyapunov functional that incorporates the derivative of the so-called Lyapunov matrix. We demonstrate that the ISS of the considered class of systems is contingent upon the existence of an ISS Lyapunov functional. The Lyapunov analysis hinges on the properties of the fundamental matrix and the delay Lyapunov matrix.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112437"},"PeriodicalIF":4.8,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144298382","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}