arXiv subjects

Matthias Köhler

Publications and source records attributed to Matthias Köhler.

6 recordsLinked to original sources

arXiv2026

Distributed Model Predictive Control for Dynamic Cooperation of Multi-Agent Systems

We propose a distributed model predictive control (MPC) framework for coordinating heterogeneous, nonlinear multi-agent systems under individual and coupling constraints. The cooperative task is encoded as a shared objective function minimized collectively by the agents. Each agent optimizes an artificial reference as an intermediate step towards the cooperative objective, along with a control input to track it. We establish recursive feasibility, asymptotic stability, and transient performance bounds under suitable assumptions. The solution to the cooperative task is not predetermined but emerges from the optimized interactions of the agents. We demonstrate the framework on numerical examples inspired by satellite constellation control, collision-free narrow-passage traversal, and coordinated quadrotor flight.

eess.SY↗

arXiv2025

Transient performance of MPC for tracking without terminal constraints

Model predictive control (MPC) for tracking is a recently introduced approach, which extends standard MPC formulations by incorporating an artificial reference as an additional optimization variable, in order to track external and potentially time-varying references. In this work, we analyze the performance of such an MPC for tracking scheme without a terminal cost and terminal constraints. We derive a transient performance estimate, i.e. a bound on the closed-loop performance over an arbitrary time interval, yielding insights on how to select the scheme's parameters for performance. Furthermore, we show that in the asymptotic case, where the prediction horizon and observed time interval tend to infinity, the closed-loop solution of MPC for tracking recovers the infinite horizon optimal solution.

eess.SY↗

arXiv2024

Distributed MPC for Self-Organized Cooperation of Multiagent Systems -- Extended Version

We present a sequential distributed model predictive control (MPC) scheme for cooperative control of multi-agent systems with dynamically decoupled heterogeneous nonlinear agents subject to individual constraints. In the scheme, we explore the idea of using tracking MPC with artificial references to let agents coordinate their cooperation without external guidance. Each agent combines a tracking MPC with artificial references, the latter penalized by a suitable coupling cost. They solve an individual optimization problem for this artificial reference and an input that tracks it, only communicating the former to its neighbors in a communication graph. This puts the cooperative problem on a different layer than the handling of the dynamics and constraints, loosening the connection between the two. We provide sufficient conditions on the formulation of the cooperative problem and the coupling cost for the closed-loop system to asymptotically achieve it. Since the dynamics and the cooperative problem are only loosely connected, classical results from distributed optimization can be used to this end. We illustrate the scheme's application to consensus and formation control.

eess.SY↗

arXiv2024

Transient Performance of MPC for Tracking

We analyse the closed-loop performance of a model predictive control (MPC) for tracking formulation with artificial references. It has been shown that such a scheme guarantees closed-loop stability and recursive feasibility for any externally supplied reference, even if it is unreachable or time-varying. The basic idea is to consider an artificial reference as an additional decision variable and to formulate generalised terminal ingredients with respect to it. In addition, its offset is penalised in the MPC optimisation problem, leading to closed-loop convergence to the best reachable reference. In this paper, we provide a transient performance bound on the closed loop using MPC for tracking. We employ mild assumptions on the offset cost and scale it with the prediction horizon. In this case, an increasing horizon in MPC for tracking recovers the infinite horizon optimal solution.

math.OC↗

arXiv2023

Data-driven distributed MPC of dynamically coupled linear systems

In this paper, we present a data-driven distributed model predictive control (MPC) scheme to stabilise the origin of dynamically coupled discrete-time linear systems subject to decoupled input constraints. The local optimisation problems solved by the subsystems rely on a distributed adaptation of the Fundamental Lemma by Willems et al., allowing to parametrise system trajectories using only measured input-output data without explicit model knowledge. For the local predictions, the subsystems rely on communicated assumed trajectories of neighbours. Each subsystem guarantees a small deviation from these trajectories via a consistency constraint. We provide a theoretical analysis of the resulting non-iterative distributed MPC scheme, including proofs of recursive feasibility and (practical) stability. Finally, the approach is successfully applied to a numerical example.

eess.SY↗

arXiv2023

Distributed Model Predictive Control for Periodic Cooperation of Multi-Agent Systems

We consider multi-agent systems with heterogeneous, nonlinear agents subject to individual constraints that want to achieve a periodic, dynamic cooperative control goal which can be characterised by a set and a suitable cost. We propose a sequential distributed model predictive control (MPC) scheme in which agents sequentially solve an individual optimisation problem to track an artificial periodic output trajectory. The optimisation problems are coupled through these artificial periodic output trajectories, which are communicated and penalised using the cost that characterises the cooperative goal. The agents communicate only their artificial trajectories and only once per time step. We show that under suitable assumptions, the agents can incrementally move their artificial output trajectories towards the cooperative goal, and, hence, their closed-loop output trajectories asymptotically achieve it. We illustrate the scheme with a simulation example.

eess.SY↗