Eleftherios E. Vlahakis

2papers

2 Papers

20.2SYJun 3
Multi-Agent Temporal Logic Planning via Penalty Functions and Block-Coordinate Optimization

Eleftherios E. Vlahakis, Arash Bahari Kordabad, Lars Lindemann et al.

Multi-agent planning under Signal Temporal Logic (STL) is often hindered by collaborative tasks that lead to computational challenges due to the inherent high dimensionality of the problem, preventing scalable synthesis with satisfaction guarantees. To address this, we formulate STL planning as an optimization program under multi-agent STL constraints and introduce a penalty-based unconstrained relaxation that can be efficiently solved via a Block-Coordinate Gradient Descent (BCGD) method, where each block corresponds to a single agent's decision variables, thereby mitigating complexity. By utilizing a quadratic penalty function defined via smooth STL semantics, we show that BCGD iterations converge to a stationary point of the penalized problem under standard regularity assumptions. To enforce feasibility, the BCGD solver is embedded within a two-layer optimization scheme: inner BCGD updates are performed for a fixed penalty parameter, which is then increased in an outer loop to progressively improve multi-agent STL robustness. The proposed framework enables scalable computations and is validated through various complex multi-robot planning scenarios.

42.4SYApr 19
Conformal Prediction-Based MPC for Stochastic Linear Systems

Lukas Vogel, Andrea Carron, Eleftherios E. Vlahakis et al.

We propose a stochastic model predictive control (MPC) framework for linear systems subject to joint-in-time chance constraints under unknown disturbance distributions. Unlike existing approaches that rely on parametric or Gaussian assumptions, or require expensive offline computation, the method uses conformal prediction to construct finite-sample confidence regions for the system's error trajectories with minimal computational effort. These probabilistic sets enable relaxation of the joint-in-time chance constraints into a deterministic closed-loop formulation based on indirect feedback, ensuring recursive feasibility and chance constraint satisfaction. Further, we extend to the output feedback setting and establish analogous guarantees from output measurements alone, given access to noise samples. Numerical examples demonstrate the effectiveness and advantages compared to existing approaches.