EUVIMEDEUVIMED entdecken
Crossref

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

Eleftherios E. Vlahakis, Arash Bahari Kordabad, Lars Lindemann, Pantelis Sopasakis, Sadegh Soudjani, Dimos V. Dimarogonas

IEEE Control Systems Letters · 2026 · 10 · 505-510

DOI: 10.1109/lcsys.2026.3699405 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Control Systems Letters, 2026. Verfasst von Eleftherios E. Vlahakis und 5 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben. Gefördert von: Vetenskapsrådet, Knut och Alice Wallenbergs Stiftelse, Horizon Europe Grant SymAware.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Vetenskapsrådet
  • Knut och Alice Wallenbergs Stiftelse
  • Horizon Europe Grant SymAware
  • ERC Consolidator Grant LEAFHOUND
  • Stiftelsen för Kunskaps- och Kompetensutveckling

Zitieren

APA

Vlahakis, E. E., Kordabad, A. B., Lindemann, L., Sopasakis, P., Soudjani, S., & Dimarogonas, D. V. (2026). Multi-Agent Temporal Logic Planning via Penalty Functions and Block-Coordinate Optimization. IEEE Control Systems Letters, 10, 505-510. https://doi.org/10.1109/lcsys.2026.3699405

Vancouver

Vlahakis EE, Kordabad AB, Lindemann L, Sopasakis P, Soudjani S, Dimarogonas DV. Multi-Agent Temporal Logic Planning via Penalty Functions and Block-Coordinate Optimization. IEEE Control Systems Letters. 2026;10:505-510. doi:10.1109/lcsys.2026.3699405

BibTeX
@article{Vlahakis2026,
  author = {Vlahakis, Eleftherios E. and Kordabad, Arash Bahari and Lindemann, Lars and Sopasakis, Pantelis and Soudjani, Sadegh and Dimarogonas, Dimos V.},
  title = {Multi-Agent Temporal Logic Planning via Penalty Functions and Block-Coordinate Optimization},
  journal = {IEEE Control Systems Letters},
  year = {2026},
  volume = {10},
  pages = {505--510},
  doi = {10.1109/lcsys.2026.3699405}
}
Kostenlos starten →