TY - GEN
T1 - Safe Planning Through Incremental Decomposition of Signal Temporal Logic Specifications
AU - Kapoor, Parv
AU - Kang, Eunsuk
AU - Meira-Góes, Rômulo
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
PY - 2024
Y1 - 2024
N2 - Trajectory planning is a critical process that enables autonomous systems to safely navigate complex environments. Signal temporal logic (STL) specifications are an effective way to encode complex, temporally extended objectives for trajectory planning in cyber-physical systems (CPS). However, the complexity of planning with STL using existing techniques scales exponentially with the number of nested operators and the time horizon of a given specification. Additionally, poor performance is exacerbated at runtime due to limited computational budgets and compounding modeling errors. Decomposing a complex specification into smaller subtasks and incrementally planning for them can remedy these issues. In this work, we present a method for decomposing STL specifications to improve planning efficiency and performance. The key insight in our work is to encode all specifications as a set of basic constraints called reachability and invariance constraints, and schedule these constraints sequentially at runtime. Our experiment shows that the proposed technique outperforms the state-of-the-art trajectory planning techniques for both linear and non-linear dynamical systems.
AB - Trajectory planning is a critical process that enables autonomous systems to safely navigate complex environments. Signal temporal logic (STL) specifications are an effective way to encode complex, temporally extended objectives for trajectory planning in cyber-physical systems (CPS). However, the complexity of planning with STL using existing techniques scales exponentially with the number of nested operators and the time horizon of a given specification. Additionally, poor performance is exacerbated at runtime due to limited computational budgets and compounding modeling errors. Decomposing a complex specification into smaller subtasks and incrementally planning for them can remedy these issues. In this work, we present a method for decomposing STL specifications to improve planning efficiency and performance. The key insight in our work is to encode all specifications as a set of basic constraints called reachability and invariance constraints, and schedule these constraints sequentially at runtime. Our experiment shows that the proposed technique outperforms the state-of-the-art trajectory planning techniques for both linear and non-linear dynamical systems.
UR - http://www.scopus.com/inward/record.url?scp=85195492240&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85195492240&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-60698-4_23
DO - 10.1007/978-3-031-60698-4_23
M3 - Conference contribution
AN - SCOPUS:85195492240
SN - 9783031606977
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 377
EP - 396
BT - NASA Formal Methods - 16th International Symposium, NFM 2024, Proceedings
A2 - Benz, Nathaniel
A2 - Gopinath, Divya
A2 - Shi, Nija
PB - Springer Science and Business Media Deutschland GmbH
T2 - 16th International Symposium on NASA Formal Methods, NFM 2024
Y2 - 4 June 2024 through 6 June 2024
ER -