Robust Temporal Logic Planning Under Contingency Constraints

In dynamic and uncertain environments, robots are often required not only to complete their primary tasks but also to be able to switch to a contingency mode that facilitates a safe and effective response in the face of an unpredictable event. In this paper, we address the problem of synthesizing optimal high-level control policies for a robot 1) to satisfy a desired task and 2) to be able to respond safely in the face of an unexpected event. We model the dynamics of the robot as a Stochastic Transition System. We express the primary task as a Time Window Temporal Logic (TWTL) specification, and we consider the contingency behavior to be reaching a safe region in at most k time steps with a probability greater than a desired threshold. We propose an automata-theoretic framework to compute optimal policies for task satisfaction and contingency behavior. While the contingency behavior is always ensured, the task satisfaction probability is maintained by minimally extending the mission horizon when necessary. We demonstrate the performance of the proposed method through simulations and experiments.

Authors

Institutions

Publication Details

Published
2025-08-17
DOI
https://doi.org/10.1109/case58245.2025.11163815
Citations
1
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Temporal Logic Planning Under Contingency Constraints

Serdar Yüksel, Yasin Yazıcıoğlu, Derya Aksaray, Azizollah Taheri
1 citations
Logic, Reasoning, and Knowledge
2.48
article

Robust Temporal Logic Planning Under Contingency Constraints

Serdar Yüksel, Yasin Yazıcıoğlu, Derya Aksaray, Azizollah Taheri
article en
1 citations

Abstract

In dynamic and uncertain environments, robots are often required not only to complete their primary tasks but also to be able to switch to a contingency mode that facilitates a safe and effective response in the face of an unpredictable event. In this paper, we address the problem of synthesizing optimal high-level control policies for a robot 1) to satisfy a desired task and 2) to be able to respond safely in the face of an unexpected event. We model the dynamics of the robot as a Stochastic Transition System. We express the primary task as a Time Window Temporal Logic (TWTL) specification, and we consider the contingency behavior to be reaching a safe region in at most k time steps with a probability greater than a desired threshold. We propose an automata-theoretic framework to compute optimal policies for task satisfaction and contingency behavior. While the contingency behavior is always ensured, the task satisfaction probability is maintained by minimally extending the mission horizon when necessary. We demonstrate the performance of the proposed method through simulations and experiments.

Northeastern University (US)
Openalex Percentile: Top 8%
Logic, Reasoning, and Knowledge
2.48
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.

Robust Temporal Logic Planning Under Contingency Constraints — Serdar Yüksel, Yasin Yazıcıoğlu, et al. · (2025) | TGRS Research Map | TGRS