Tamás Keviczky

Yiming Wan, Tamas Keviczky, Michel Verhaegen et al.

This paper presents a data-driven receding horizon fault estimation method for additive actuator and sensor faults in unknown linear time-invariant systems, with enhanced robustness to stochastic identification errors. State-of-the-art methods construct fault estimators with identified state-space models or Markov parameters, but they do not compensate for identification errors. Motivated by this limitation, we first propose a receding horizon fault estimator parameterized by predictor Markov parameters. This estimator provides (asymptotically) unbiased fault estimates as long as the subsystem from faults to outputs has no unstable transmission zeros. When the identified Markov parameters are used to construct the above fault estimator, zero-mean stochastic identification errors appear as model uncertainty multiplied with unknown fault signals and online system inputs/outputs (I/O). Based on this fault estimation error analysis, we formulate a mixed-norm problem for the offline robust design that regards online I/O data as unknown. An alternative online mixed-norm problem is also proposed that can further reduce estimation errors when the online I/O data have large amplitudes, at the cost of increased computational burden. Based on a geometrical interpretation of the two proposed mixed-norm problems, systematic methods to tune the user-defined parameters therein are given to achieve desired performance trade-offs. Simulation examples illustrate the benefits of our proposed methods compared to recent literature.

Minh Dang Doan, Pontus Giselsson, Tamás Keviczky et al.

A distributed model predictive control (DMPC) approach based on distributed optimization is applied to the power reference tracking problem of a hydro power valley (HPV) system. The applied optimization algorithm is based on accelerated gradient methods and achieves a convergence rate of O(1/k^2), where k is the iteration number. Major challenges in the control of the HPV include a nonlinear and large-scale model, nonsmoothness in the power-production functions, and a globally coupled cost function that prevents distributed schemes to be applied directly. We propose a linearization and approximation approach that accommodates the proposed the DMPC framework and provides very similar performance compared to a centralized solution in simulations. The provided numerical studies also suggest that for the sparsely interconnected system at hand, the distributed algorithm we propose is faster than a centralized state-of-the-art solver such as CPLEX.

Andrea Simonetto, Tamas Keviczky, Robert Babuska

We consider the problem of maximizing the algebraic connectivity of the communication graph in a network of mobile robots by moving them into appropriate positions. We define the Laplacian of the graph as dependent on the pairwise distance between the robots and we approximate the problem as a sequence of Semi-Definite Programs (SDP). We propose a distributed solution consisting of local SDP's which use information only from nearby neighboring robots. We show that the resulting distributed optimization framework leads to feasible subproblems and through its repeated execution, the algebraic connectivity increases monotonically. Moreover, we describe how to adjust the communication load of the robots based on locally computable measures. Numerical simulations show the performance of the algorithm with respect to the centralized solution.

Minh Dang Doan, Tamás Keviczky, Bart De Schutter

We present a hierarchical model predictive control approach for large-scale systems based on dual decomposition. The proposed scheme allows coupling in both dynamics and constraints between the subsystems and generates a primal feasible solution within a finite number of iterations, using primal averaging and a constraint tightening approach. The primal update is performed in a distributed way and does not require exact solutions, while the dual problem uses an approximate subgradient method. Stability of the scheme is established using bounded suboptimality.

Andrea Simonetto, Tamas Keviczky, Mikael Johansson

We propose a regularized saddle-point algorithm for convex networked optimization problems with resource allocation constraints. Standard distributed gradient methods suffer from slow convergence and require excessive communication when applied to problems of this type. Our approach offers an alternative way to address these problems, and ensures that each iterative update step satisfies the resource allocation constraints. We derive step-size conditions under which the distributed algorithm converges geometrically to the regularized optimal value, and show how these conditions are affected by the underlying network topology. We illustrate our method on a robotic network application example where a group of mobile agents strive to maintain a moving target in the barycenter of their positions.

V. Rostampour, T. Keviczky

This paper presents an energy management framework for building climate comfort (BCC) systems interconnected in a grid via aquifer thermal energy storage (ATES) systems in the presence of two types of uncertainty (private and common). ATES can be used either as a heat source (hot well) or sink (cold well) depending on the season. We consider the uncertain thermal energy demand of individual buildings as a private uncertainty source and the uncertain common resource pool (ATES) between neighbors as a common uncertainty source. We develop a large-scale stochastic hybrid dynamical model to predict the thermal energy imbalance in a network of interconnected BCC systems together with mutual interactions between their local ATES. We formulate a finite-horizon mixed-integer quadratic optimization problem with multiple chance constraints at each sampling time, which is in general a non-convex problem and difficult to solve. We then provide a computationally tractable framework by extending the so-called robust randomized approach and offering a less conservative solution for a problem with multiple chance constraints. A simulation study is provided to compare completely decoupled, centralized and move-blocking centralized solutions. We also present a numerical study using a geohydrological simulation environment (MODFLOW) to illustrate the advantages of our proposed framework.

Yiming Wan, Tamas Keviczky, Michel Verhaegen

This paper investigates robust fault diagnosis of multiple air data sensor faults in the presence of winds. The trade-off between robustness to winds and sensitivity to faults is challenging due to simultaneous influence of winds and latent faults on monitored sensors. Different from conventional residual generators that do not consider any constraints, we propose a constrained residual generator using moving horizon estimation. The main contribution is improved fault sensitivity by exploiting known bounds on winds in residual generation. By analyzing the Karush-Kuhn-Tucker conditions of the formulated moving horizon estimation problem, it is shown that this improvement is attributed to active inequality constraints caused by faults. When the weighting matrices in the moving horizon estimation problem are tuned to increase robustness to winds, its fault sensitivity does not simply decrease as one would expect in conventional unconstrained residual generators. Instead, its fault sensitivity increases when the fault is large enough to activate some inequality constraints. This fault sensitivity improvement is not restricted to this particular application, but can be achieved by any general moving horizon estimation based residual generator. A high-fidelity Airbus simulator is used to illustrate the advantage of our proposed approach in terms of fault sensitivity.

V. Rostampour, T. Keviczky

This paper presents a distributed stochastic model predictive control (SMPC) approach for large-scale linear systems with private and common uncertainties in a plug-and-play framework. Using the so-called scenario approach, the centralized SMPC involves formulating a large-scale finite-horizon scenario optimization problem at each sampling time, which is in general computationally demanding, due to the large number of required scenarios. We present two novel ideas in this paper to address this issue. We first develop a technique to decompose the large-scale scenario program into distributed scenario programs that exchange a certain number of scenarios with each other in order to compute local decisions using the alternating direction method of multipliers (ADMM). We show the exactness of the decomposition with a-priori probabilistic guarantees for the desired level of constraint fulfillment for both uncertainty sources. As our second contribution, we develop an inter-agent soft communication scheme based on a set parametrization technique together with the notion of probabilistically reliable sets to reduce the required communication between the subproblems. We show how to incorporate the probabilistic reliability notion into existing results and provide new guarantees for the desired level of constraint violations. Two different simulation studies of two types of systems interactions, dynamically coupled and coupling constraints, are presented to illustrate the advantages of the proposed framework.

Arman Sharifi Kolarijani, Peyman Mohajerin Esfahani, Tamás Keviczky

Treating optimization methods as dynamical systems can be traced back centuries ago in order to comprehend the notions and behaviors of optimization methods. Lately, this mind set has become the driving force to design new optimization methods. Inspired by the recent dynamical system viewpoint of Nesterov's fast method, we propose two classes of fast methods, formulated as hybrid control systems, to obtain pre-specified exponential convergence rate. Alternative to the existing fast methods which are parametric-in-time second order differential equations, we dynamically synthesize feedback controls in a state-dependent manner. Namely, in the first class the damping term is viewed as the control input, while in the second class the amplitude with which the gradient of the objective function impacts the dynamics serves as the controller. The objective function requires to satisfy the so-called Polyak--Łojasiewicz inequality which effectively implies no local optima and a certain gradient-domination property. Moreover, we establish that both hybrid structures possess Zeno-free solution trajectories. We finally provide a mechanism to determine the discretization step size to attain an exponential convergence rate.

Yiming Wan, Tamas Keviczky

This paper presents robust fault diagnosis and estimation for the calibrated airspeed and angle-of-attack sensor faults in the RECONFIGURE benchmark. We adopt a low-order longitudinal model augmented with wind dynamics. In order to enhance sensitivity to faults in the presence of winds, we propose a constrained residual generator by formulating a constrained moving horizon estimation problem and exploiting the bounds of winds. The moving horizon estimation problem requires solving a nonlinear program in real time, which is challenging for flight control computers. This challenge is addressed by adopting an efficient structure-exploiting algorithm within a real-time iteration scheme. Specific approximations and simplifications are performed to enable the implementation of the algorithm using the Airbus graphical symbol library for industrial validation and verification. The simulation tests on the RECONFIGURE benchmark over different flight points and maneuvers show the efficacy of the proposed approach.

Yogesh Prasanna Kumar Rao, Tamas Keviczky, Raj Thilak Rajan

Multi-output Gaussian Processes provide principled uncertainty-aware learning of vector-valued fields but are difficult to deploy in large-scale, distributed, and streaming settings due to their computational and centralized nature. This paper proposes a Consensus-based Recursive Multi-Output Gaussian Process (CRMGP) framework that combines recursive inference on shared basis vectors with neighbour-to-neighbour information-consensus updates. The resulting method supports parallel, fully distributed learning with bounded per-step computation while preserving inter-output correlations and calibrated uncertainty. Experiments on synthetic wind fields and real LiDAR data demonstrate that CRMGP achieves competitive predictive performance and reliable uncertainty calibration, offering a scalable alternative to centralized Gaussian process models for multi-agent sensing applications.

Anastasios Tsolakis, Tamas Keviczky

Nonholonomic mechanical systems encompass a large class of practically interesting robotic structures, such as wheeled mobile robots, space manipulators, and multi-fingered robot hands. However, few results exist on the cooperative control of such systems in a generic, distributed approach. In this work we extend a recently developed distributed Interconnection and Damping Assignment Passivity-Based Control (IDA-PBC) method to such systems. More specifically, relying on port-Hamiltonian system modelling for networks of mechanical systems, we propose a full-state stabilization control law for a class of nonholonomic systems within the framework of distributed IDA-PBC. This enables the cooperative control of heterogeneous, underactuated and nonholonomic systems with a unified control law. This control law primarily relies on the notion of Passive Configuration Decomposition (PCD) and a novel, non-smooth desired potential energy function proposed here. A low-level collision avoidance protocol is also implemented in order to achieve dynamic inter-agent collision avoidance, enhancing the practical relevance of this work. Theoretical results are tested in different simulation scenarios in order to highlight the applicability of the derived method.

Alexander Berndt, Niels Van Duijkeren, Luigi Palmieri et al.

In this paper we consider multiple Automated Guided Vehicles (AGVs) navigating a common workspace to fulfill various intralogistics tasks, typically formulated as the Multi-Agent Path Finding (MAPF) problem. To keep plan execution deadlock-free, one approach is to construct an Action Dependency Graph (ADG) which encodes the ordering of AGVs as they proceed along their routes. Using this method, delayed AGVs occasionally require others to wait for them at intersections, thereby affecting the plan execution efficiency. If the workspace is shared by dynamic obstacles such as humans or third party robots, AGVs can experience large delays. A common mitigation approach is to re-solve the MAPF using the current, delayed AGV positions. However, solving the MAPF is time-consuming, making this approach inefficient, especially for large AGV teams. In this work, we present an online method to repeatedly modify a given acyclic ADG to minimize route completion times of each AGV. Our approach persistently maintains an acyclic ADG, necessary for deadlock-free plan execution. We evaluate the approach by considering simulations with random disturbances on the execution and show faster route completion times compared to the baseline ADG-based execution management approach.

Oscar Sondermeijer, Roel Dobbe, Daniel Arnold et al.

Electronic power inverters are capable of quickly delivering reactive power to maintain customer voltages within operating tolerances and to reduce system losses in distribution grids. This paper proposes a systematic and data-driven approach to determine reactive power inverter output as a function of local measurements in a manner that obtains near optimal results. First, we use a network model and historic load and generation data and do optimal power flow to compute globally optimal reactive power injections for all controllable inverters in the network. Subsequently, we use regression to find a function for each inverter that maps its local historical data to an approximation of its optimal reactive power injection. The resulting functions then serve as decentralized controllers in the participating inverters to predict the optimal injection based on a new local measurements. The method achieves near-optimal results when performing voltage- and capacity-constrained loss minimization and voltage flattening, and allows for an efficient volt-VAR optimization (VVO) scheme in which legacy control equipment collaborates with existing inverters to facilitate safe operation of distribution networks with higher levels of distributed generation.

Arman Sharifi Kolarijani, Manuel Mazo, Tamas Keviczky

In networked control systems, the advent of event-triggering strategies in the sampling process has resulted in the usage reduction of network capacities, such as communication bandwidth. However, the aperiodic nature of sampling periods generated by event-triggering strategies has hindered the schedulability of such networks. In this study, we propose a framework to construct a timed safety automaton that captures the sampling behavior of perturbed LTI systems with an $\mathcal{L}_2$-based triggering mechanisms proposed in the Literature. In this framework, the state-space is partitioned into a finite number of convex polyhedral cones, each cone representing a discrete mode in the abstracted automaton. Adopting techniques from stability analysis of retarded systems accompanied with a polytopic embedding of time, LMI conditions to characterize the sampling interval associated with each region are derived. Then, using reachability analysis, the transitions in the abstracted automaton are derived.

Yiming Wan, Tamas Keviczky, Michel Verhaegen

We propose a systematic method to directly identify a sensor fault estimation filter from plant input/output data collected under fault-free condition. This problem is challenging, especially when omitting the step of building an explicit state-space plant model in data-driven design, because the inverse of the underlying plant dynamics is required and needs to be stable. We show that it is possible to address this problem by relying on a system-inversion-based fault estimation filter that is parameterized using identified Markov parameters. Our novel data-driven approach improves estimation performance by avoiding the propagation of model reduction errors originating from identification of the state-space plant model into the designed filter. Furthermore, it allows additional design freedom to stabilize the obtained filter under the same stabilizability condition as the existing model-based system inversion. This crucial property enables its application to sensor faults in unstable plants, where existing data-driven filter designs could not be applied so far due to the lack of such stability guarantees (even after stabilizing the closed-loop system). A numerical simulation example of sensor faults in an unstable aircraft system illustrates the effectiveness of the proposed new method.