Distributed Predictive Control under Multiple Sub-formula STL Specifications with Temporal Relaxation

In a Multi-Agent System (MAS), where each agent is assigned with local Signal Temporal Logic (STL) tasks, coupled tasks frequently appear, causing STL violations. To address this issue, a Distributed Model Predictive Control (DMPC) algorithm is proposed to loosen the temporal constraints of non-nested STL specifications with multiple sub-formulae. We use temporal relaxation and task postponement of some sub-formulae to handle task conflicts. First, the online reference trajectories of each subtask are generated that the corresponding STL satisfaction constraints are incorporated into the DMPC problem. Then, we use compatibility constraints to implement synchronous cooperative collision avoidance. Based on the online reference trajectories, the temporal relaxation metric of each sub-formula is given, and is optimized in the DMPC optimization problem. As a result, the optimal controller enforcing STL satisfaction and minimal temporal relaxation is found. Finally, simulations demonstrate the effectiveness of the suggested algorithm.

Authors

Institutions

Publication Details

Published
2024-11-03
DOI
https://doi.org/10.1109/iecon55916.2024.10905703
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Predictive Control under Multiple Sub-formula STL Specifications with Temporal Relaxation

Yuanyuan Zou, Shaoyuan Li, Hongbo Yang
Advanced Control Systems Optimization
article

Distributed Predictive Control under Multiple Sub-formula STL Specifications with Temporal Relaxation

Yuanyuan Zou, Shaoyuan Li, Hongbo Yang
article en

Abstract

In a Multi-Agent System (MAS), where each agent is assigned with local Signal Temporal Logic (STL) tasks, coupled tasks frequently appear, causing STL violations. To address this issue, a Distributed Model Predictive Control (DMPC) algorithm is proposed to loosen the temporal constraints of non-nested STL specifications with multiple sub-formulae. We use temporal relaxation and task postponement of some sub-formulae to handle task conflicts. First, the online reference trajectories of each subtask are generated that the corresponding STL satisfaction constraints are incorporated into the DMPC problem. Then, we use compatibility constraints to implement synchronous cooperative collision avoidance. Based on the online reference trajectories, the temporal relaxation metric of each sub-formula is given, and is optimized in the DMPC optimization problem. As a result, the optimal controller enforcing STL satisfaction and minimal temporal relaxation is found. Finally, simulations demonstrate the effectiveness of the suggested algorithm.

Shanghai Jiao Tong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 65%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.