Pub Date : 2024-06-28DOI: 10.1016/j.ejcon.2024.101074
Ky Quan Tran , Pham Huu Anh Ngoc
This paper addresses the exponential stability in mean square of nonlinear stochastic delay differential equations with Markovian switching. Using a novel approach, we present new explicit criteria for exponential stability in mean square. A discussion and two examples are given to illustrate the effectiveness of our criteria.
{"title":"Novel criteria for exponential stability in mean square of stochastic delay differential equations with Markovian switching","authors":"Ky Quan Tran , Pham Huu Anh Ngoc","doi":"10.1016/j.ejcon.2024.101074","DOIUrl":"10.1016/j.ejcon.2024.101074","url":null,"abstract":"<div><p>This paper addresses the exponential stability in mean square of nonlinear stochastic delay differential equations with Markovian switching. Using a novel approach, we present new explicit criteria for exponential stability in mean square. A discussion and two examples are given to illustrate the effectiveness of our criteria.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-26DOI: 10.1016/j.ejcon.2024.101075
Yilun Shang
This paper studies the resilient consensus problems under -hop communication over directed random networks. We develop novel multi-hop protocols to tackle both leaderless and leader–follower consensus with a single leader when the multiagent system is under both attack from Byzantine agents and failure of communication edges. Our unified framework features a multiple-input multiple-output system design, and generalizes the weighted mean subsequence reduced algorithms, in which extremal values in the -hop neighborhood of a cooperative agent are censored based on the notion of minimum message cover. We establish conditions on dynamical network structures, under which secure consensus with vector states can be achieved in the sense of almost sure convergence.
{"title":"Resilient leaderless and leader–follower consensus over random networks through ℓ-hop communication","authors":"Yilun Shang","doi":"10.1016/j.ejcon.2024.101075","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101075","url":null,"abstract":"<div><p>This paper studies the resilient consensus problems under <span><math><mi>ℓ</mi></math></span>-hop communication over directed random networks. We develop novel multi-hop protocols to tackle both leaderless and leader–follower consensus with a single leader when the multiagent system is under both attack from Byzantine agents and failure of communication edges. Our unified framework features a multiple-input multiple-output system design, and generalizes the weighted mean subsequence reduced algorithms, in which extremal values in the <span><math><mi>ℓ</mi></math></span>-hop neighborhood of a cooperative agent are censored based on the notion of minimum message cover. We establish conditions on dynamical network structures, under which secure consensus with vector states can be achieved in the sense of almost sure convergence.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0947358024001353/pdfft?md5=a41dde29e5061709d522d1db20d0212a&pid=1-s2.0-S0947358024001353-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In discrete event systems, it is often convenient and possible to observe directly whether or not the system is in a subset of the state space, typically after some delay, even if some event occurrences leading to the current state were not observed. We model supervisory control with the delayed observations of events and states and investigate the existence of a supervisor to obtain a given desired language accordingly. An existence verifier with polynomial run time is presented.
{"title":"Supervisory control under delayed observations of events and states","authors":"Jiayuan Liang, Yanwei Zang, Wenbiao Zhang, Chaohui Gong, Lachlan L.H. Andrew, Hanran Zhang, Weilin Wang","doi":"10.1016/j.ejcon.2024.101069","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101069","url":null,"abstract":"In discrete event systems, it is often convenient and possible to observe directly whether or not the system is in a subset of the state space, typically after some delay, even if some event occurrences leading to the current state were not observed. We model supervisory control with the delayed observations of events and states and investigate the existence of a supervisor to obtain a given desired language accordingly. An existence verifier with polynomial run time is presented.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141717638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-25DOI: 10.1016/j.ejcon.2024.101067
Tarek Bouazza, Tarek Hamel, Claude Samson
Vision-aided inertial navigation systems combine data from a camera and an IMU to estimate the position, orientation, and linear velocity of a moving vehicle. In planar environments, existing methods assume knowledge of the vertical direction and ground plane to exploit accelerometer measurements. This paper presents a new solution that extends the estimation to arbitrary planar environments. A deterministic Riccati observer is designed to estimate the direction of gravity along with the vehicle pose, linear velocity, and the normal direction to the plane by fusing bearing correspondences from an image sequence with angular velocity and linear acceleration data. Comprehensive observability and stability analysis establishes an explicit persistent excitation condition under which local exponential stability of the observer is achieved. Simulation and real-world experimental results illustrate the performance and robustness of the proposed approach.
{"title":"Observer design for visual-inertial estimation of pose, linear velocity and gravity direction in planar environments","authors":"Tarek Bouazza, Tarek Hamel, Claude Samson","doi":"10.1016/j.ejcon.2024.101067","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101067","url":null,"abstract":"Vision-aided inertial navigation systems combine data from a camera and an IMU to estimate the position, orientation, and linear velocity of a moving vehicle. In planar environments, existing methods assume knowledge of the vertical direction and ground plane to exploit accelerometer measurements. This paper presents a new solution that extends the estimation to arbitrary planar environments. A deterministic Riccati observer is designed to estimate the direction of gravity along with the vehicle pose, linear velocity, and the normal direction to the plane by fusing bearing correspondences from an image sequence with angular velocity and linear acceleration data. Comprehensive observability and stability analysis establishes an explicit persistent excitation condition under which local exponential stability of the observer is achieved. Simulation and real-world experimental results illustrate the performance and robustness of the proposed approach.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-25DOI: 10.1016/j.ejcon.2024.101051
Andrea Martin, Luca Furieri, Florian Dörfler, John Lygeros, Giancarlo Ferrari-Trecate
We consider control of uncertain linear time-varying stochastic systems from the perspective of regret minimization. Specifically, we focus on the problem of designing a feedback controller that minimizes the loss relative to a clairvoyant optimal policy that has foreknowledge of both the system dynamics and the exogenous disturbances. In this competitive framework, establishing robustness guarantees proves challenging as, differently from the case where the model is known, the clairvoyant optimal policy is not only inapplicable, but also impossible to compute without knowledge of the system parameters. To address this challenge, we embrace a scenario optimization approach, and we propose minimizing regret robustly over a finite set of randomly sampled system parameters. We prove that this policy optimization problem can be solved through semidefinite programming, and that the corresponding solution retains strong probabilistic out-of-sample regret guarantees in face of the uncertain dynamics. Our method naturally extends to include satisfaction of safety constraints with high probability. We validate our theoretical results and showcase the potential of our approach by means of numerical simulations.
{"title":"Regret optimal control for uncertain stochastic systems","authors":"Andrea Martin, Luca Furieri, Florian Dörfler, John Lygeros, Giancarlo Ferrari-Trecate","doi":"10.1016/j.ejcon.2024.101051","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101051","url":null,"abstract":"We consider control of uncertain linear time-varying stochastic systems from the perspective of regret minimization. Specifically, we focus on the problem of designing a feedback controller that minimizes the loss relative to a clairvoyant optimal policy that has foreknowledge of both the system dynamics and the exogenous disturbances. In this competitive framework, establishing robustness guarantees proves challenging as, differently from the case where the model is known, the clairvoyant optimal policy is not only inapplicable, but also impossible to compute without knowledge of the system parameters. To address this challenge, we embrace a scenario optimization approach, and we propose minimizing regret robustly over a finite set of randomly sampled system parameters. We prove that this policy optimization problem can be solved through semidefinite programming, and that the corresponding solution retains strong probabilistic out-of-sample regret guarantees in face of the uncertain dynamics. Our method naturally extends to include satisfaction of safety constraints with high probability. We validate our theoretical results and showcase the potential of our approach by means of numerical simulations.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141578081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-24DOI: 10.1016/j.ejcon.2024.101068
David Ohlin, Emma Tegling, Anders Rantzer
We present a method for optimal control with respect to a linear cost function for positive linear systems with coupled input constraints. We show that the Bellman equation giving the optimal cost function and resulting sparse state feedback for these systems can be stated explicitly, with the solution given by a linear program. Our framework admits a range of network routing problems with underlying linear dynamics. These dynamics can be used to model traditional graph-theoretical problems like shortest path as a special case, but can also capture more complex behaviors. We provide an asynchronous and distributed value iteration algorithm for obtaining the optimal cost function and control law.
{"title":"Optimal control of linear cost networks","authors":"David Ohlin, Emma Tegling, Anders Rantzer","doi":"10.1016/j.ejcon.2024.101068","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101068","url":null,"abstract":"We present a method for optimal control with respect to a linear cost function for positive linear systems with coupled input constraints. We show that the Bellman equation giving the optimal cost function and resulting sparse state feedback for these systems can be stated explicitly, with the solution given by a linear program. Our framework admits a range of network routing problems with underlying linear dynamics. These dynamics can be used to model traditional graph-theoretical problems like shortest path as a special case, but can also capture more complex behaviors. We provide an asynchronous and distributed value iteration algorithm for obtaining the optimal cost function and control law.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-24DOI: 10.1016/j.ejcon.2024.101057
C. Menelaou, S. Timotheou, P. Kolios, C.G. Panayiotou
This work proposes a novel solution approach to address the On-Time Arrival (OTA) problem, considering macroscopic traffic dynamics. In this context, all drivers who intend to use the road infrastructure are required to communicate their origin–destination pair and desired arrival time to a central scheduler prior to starting their trip. In response, the scheduler assigns a departure time and a multi-regional route to each driver to make possible their on-time arrival at the destination. The OTA problem is formulated as a nonconvex, nonlinear, multi-objective optimization problem considering two objective criteria. The first criterion aims at minimizing the travel time of all drivers in the network to prevent congestion, while the second criterion seeks to minimize the discrepancy between the desired and actual arrival time. The proposed formulation is solved efficiently through an approximated convex solution that leverages the Normal Boundary Intersection (NBI) method to efficiently generate a representative sample of the Pareto Front. Additionally, two solution methodologies based on “knee” solution and the Nash Bargaining Game is proposed which can be used to select a unique solution across all the Pareto points, that offers a reasonable trade-off between the two objective criteria. Finally, simulation results demonstrate that the proposed solution can significantly reduce congestion while ensuring that most drivers will arrive at their destination on their desired time.
{"title":"Efficient demand management for the on-time arrival problem: A convexified multi-objective approach assuming macroscopic traffic dynamics","authors":"C. Menelaou, S. Timotheou, P. Kolios, C.G. Panayiotou","doi":"10.1016/j.ejcon.2024.101057","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101057","url":null,"abstract":"This work proposes a novel solution approach to address the On-Time Arrival (OTA) problem, considering macroscopic traffic dynamics. In this context, all drivers who intend to use the road infrastructure are required to communicate their origin–destination pair and desired arrival time to a central scheduler prior to starting their trip. In response, the scheduler assigns a departure time and a multi-regional route to each driver to make possible their on-time arrival at the destination. The OTA problem is formulated as a nonconvex, nonlinear, multi-objective optimization problem considering two objective criteria. The first criterion aims at minimizing the travel time of all drivers in the network to prevent congestion, while the second criterion seeks to minimize the discrepancy between the desired and actual arrival time. The proposed formulation is solved efficiently through an approximated convex solution that leverages the Normal Boundary Intersection (NBI) method to efficiently generate a representative sample of the Pareto Front. Additionally, two solution methodologies based on “knee” solution and the Nash Bargaining Game is proposed which can be used to select a unique solution across all the Pareto points, that offers a reasonable trade-off between the two objective criteria. Finally, simulation results demonstrate that the proposed solution can significantly reduce congestion while ensuring that most drivers will arrive at their destination on their desired time.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-22DOI: 10.1016/j.ejcon.2024.101078
Feng Gao, Zhifeng Bai
Repetitive control (RC), which can track the periodic input or suppress the periodic disturbance with a zero steady-state error, is a promising control strategy for shunt active power filters (SAPF). However, the conventional RC (CRC) scheme will suffer a severe performance degradation caused by the grid frequency variations. In this article, a frequency-adaptive odd-harmonic repetitive control scheme with a single and fixed sampling rate is proposed for SAPF to deal with grid frequency variations and provide fast transient response for RC system. The frequency-adaptability of proposed repetitive control scheme can be implemented by updating the coefficients of the approximate expression for the delay unit in repetitive controller. The FIR filter based on Lagrange linear interpolation is used to transform the multirate repetitive control system into single-rate repetitive control system to address the problems caused by the multirate repetitive control system. Moreover, a fractional-order linear compensator with a simple structure is designed to compensate the magnitude and phase of the system accurately. Compared with other classical repetitive control strategies, the proposed repetitive control scheme can provide a better adaptation to the steady-state deviation and dynamic variation of grid frequency and ensure the control performance of SAPF system. Simulation and experimental results verify the effectiveness of the proposed control scheme.
重复控制(RC)可跟踪周期性输入或抑制周期性干扰,且稳态误差为零,是并联有源电力滤波器(SAPF)的一种有前途的控制策略。然而,传统的 RC(CRC)方案会因电网频率变化而导致性能严重下降。本文针对 SAPF 提出了一种频率自适应奇次谐波重复控制方案,该方案具有单一且固定的采样率,可应对电网频率变化并为 RC 系统提供快速瞬态响应。通过更新重复控制器中延迟单元近似表达式的系数,可以实现所提出的重复控制方案的频率适应性。针对多速率重复控制系统带来的问题,利用基于拉格朗日线性插值的 FIR 滤波器将多速率重复控制系统转换为单速率重复控制系统。此外,还设计了结构简单的分数阶线性补偿器,以精确补偿系统的幅值和相位。与其他经典的重复控制策略相比,所提出的重复控制方案能更好地适应电网频率的稳态偏差和动态变化,确保 SAPF 系统的控制性能。仿真和实验结果验证了所提控制方案的有效性。
{"title":"Frequency-adaptive odd-harmonic repetitive control scheme for three-phase shunt active power filters","authors":"Feng Gao, Zhifeng Bai","doi":"10.1016/j.ejcon.2024.101078","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101078","url":null,"abstract":"<div><p>Repetitive control (RC), which can track the periodic input or suppress the periodic disturbance with a zero steady-state error, is a promising control strategy for shunt active power filters (SAPF). However, the conventional RC (CRC) scheme will suffer a severe performance degradation caused by the grid frequency variations. In this article, a frequency-adaptive odd-harmonic repetitive control scheme with a single and fixed sampling rate is proposed for SAPF to deal with grid frequency variations and provide fast transient response for RC system. The frequency-adaptability of proposed repetitive control scheme can be implemented by updating the coefficients of the approximate expression for the delay unit in repetitive controller. The FIR filter based on Lagrange linear interpolation is used to transform the multirate repetitive control system into single-rate repetitive control system to address the problems caused by the multirate repetitive control system. Moreover, a fractional-order linear compensator with a simple structure is designed to compensate the magnitude and phase of the system accurately. Compared with other classical repetitive control strategies, the proposed repetitive control scheme can provide a better adaptation to the steady-state deviation and dynamic variation of grid frequency and ensure the control performance of SAPF system. Simulation and experimental results verify the effectiveness of the proposed control scheme.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141487238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-22DOI: 10.1016/j.ejcon.2024.101060
Xiao Chen, Zhiqi Tang, Karl H. Johansson, Jonas Mårtensson
This paper proposes a novel formation control design for safe platooning and merging of a group of vehicles in multi-lane road scenarios. Provided a leader vehicle is independently controlled, the objective is controlling the follower vehicles to drive in the desired lane with a constant desired distance behind the neighboring (preceding) vehicle while preventing collisions with both the neighboring vehicle and the road’s edges. Inspired by the recent concept of constructive barrier feedback, the proposed controller for each follower vehicle is composed of two parts: one is the nominal controller that ensures its tracking of the neighboring vehicle; another is for collision avoidance by using divergent flow as a dissipative term, which slows down the relative velocity in the direction of the neighboring vehicle and road edges without compromising the nominal controller’s performance. The key contribution of this work is that the proposed control method ensures collision-free platooning and merging control in multi-lane road scenarios with computational efficiency and systematic stability analysis. Simulation results are provided to demonstrate the effectiveness of the proposed algorithms.
{"title":"Safe platooning and merging control using constructive barrier feedback","authors":"Xiao Chen, Zhiqi Tang, Karl H. Johansson, Jonas Mårtensson","doi":"10.1016/j.ejcon.2024.101060","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101060","url":null,"abstract":"This paper proposes a novel formation control design for safe platooning and merging of a group of vehicles in multi-lane road scenarios. Provided a leader vehicle is independently controlled, the objective is controlling the follower vehicles to drive in the desired lane with a constant desired distance behind the neighboring (preceding) vehicle while preventing collisions with both the neighboring vehicle and the road’s edges. Inspired by the recent concept of constructive barrier feedback, the proposed controller for each follower vehicle is composed of two parts: one is the nominal controller that ensures its tracking of the neighboring vehicle; another is for collision avoidance by using divergent flow as a dissipative term, which slows down the relative velocity in the direction of the neighboring vehicle and road edges without compromising the nominal controller’s performance. The key contribution of this work is that the proposed control method ensures collision-free platooning and merging control in multi-lane road scenarios with computational efficiency and systematic stability analysis. Simulation results are provided to demonstrate the effectiveness of the proposed algorithms.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141717569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-20DOI: 10.1016/j.ejcon.2024.101046
Luca Claude Gino Lebon, Francesco Lo Iudice, Claudio Altafini
Temporality has been recently identified as a useful feature to exploit when controlling a complex network. Empirical evidence has in fact shown that, with respect to their static counterparts, temporal networks (i) are often endowed with larger reachable sets and (ii) require less control energy when steered towards an arbitrary target state. However, to date, we lack conditions guaranteeing that the dimension of the controllable subspace of a temporal network is larger than that of its static counterpart. In this work, we consider the case in which a static network is input connected but not controllable. We show that when the structure of the graph underlying the temporal network remains the same throughout each temporal snapshot while the (nonvanishing) edge weights vary, then the temporal network will be completely controllable almost always, even when its static counterpart is not. An upper bound on the number of snapshots needed to achieve controllability is also provided.
{"title":"On controllability of temporal networks","authors":"Luca Claude Gino Lebon, Francesco Lo Iudice, Claudio Altafini","doi":"10.1016/j.ejcon.2024.101046","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101046","url":null,"abstract":"Temporality has been recently identified as a useful feature to exploit when controlling a complex network. Empirical evidence has in fact shown that, with respect to their static counterparts, temporal networks (i) are often endowed with larger reachable sets and (ii) require less control energy when steered towards an arbitrary target state. However, to date, we lack conditions guaranteeing that the dimension of the controllable subspace of a temporal network is larger than that of its static counterpart. In this work, we consider the case in which a static network is input connected but not controllable. We show that when the structure of the graph underlying the temporal network remains the same throughout each temporal snapshot while the (nonvanishing) edge weights vary, then the temporal network will be completely controllable almost always, even when its static counterpart is not. An upper bound on the number of snapshots needed to achieve controllability is also provided.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}