A model predictive control framework that treats feasibility repair as a Pareto optimization problem to explicitly characterize tradeoffs among agent objectives is proposed and a probabilistic certificate on STL violation rate is provided to formally quantify uncertainty under stochastic and uncontrollable agents.
Abstract
Temporal logic is a formal language for reasoning about system behaviors over time. Signal temporal logic (STL), in particular, has been used to encode spatio-temporal requirements for control synthesis in multi-agent systems, often under the assumption that agents are cooperative and their dynamics are known. However, real-world multi-agent applications, such as autonomous driving, typically involve stochastic and uncontrollable agents. Recent work explored robust control with worst-case or probabilistic formulations, but remains limited in that it either (1) certifies strict satisfaction of STL constraints without addressing feasibility recovery, or (2) relaxes infeasible constraints with ego-centric objectives. In this paper, we propose a model predictive control (MPC) framework that treats feasibility repair as a Pareto optimization problem to explicitly characterize tradeoffs among agent objectives. We further provide a probabilistic certificate on STL violation rate to formally quantify uncertainty under stochastic and uncontrollable agents. The proposed framework is evaluated on two autonomous driving scenarios. Results show that the framework recovers feasible control with demonstrated safe behaviors.
A new diffusion method for multi-agent planning with STL specifications is introduced, making the approach generalizable to novel formulas whose predicates are placed anywhere within the goal region covered during training, while achieving the same scalability as existing learning-based methods.
Joe Eappen, Zikang Xiong, S. Iyengar et al.· IEEE Robotics and Automation...· 0 citations
This work introduces a novel automata-based approach that provides an efficient memory mechanism and associated Markovian rewards suitable for RL frameworks and empirically demonstrates that this approach learns policies that achieve higher robustness scores and satisfaction rates than those learned by existing approac...
A. Bozkurt, Shang-Tong Zhang, Yuichi Motai· 0 citations
Safety-aware motion planning remains a challenge in robotics, especially when missions are time-critical and are under complex specifications. In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints e...
Yi-Qi Zhao, Taekyung Kim, Hideki Okamoto et al.· 0 citations
This paper addresses the control problem for robotic systems, including non-holonomic and underactuated platforms operating under unknown dynamics and strict actuator limits to satisfy complex high-level specifications. We denote these high-level specifications using Signal Temporal Logic (STL) and propose a novel time...
Vaishnavi Jagabathula, P. Sangeerth, Pushpak Jagtap· 0 citations
A novel end-to-end model-based Reinforcement Learning (RL) algorithm for efficient policy synthesis under given Linear Temporal Logic (LTL) specifications in unknown environments is presented and a successful application is showcased for \textit{cautious} RL, namely to reduce the number of task violations incurred duri...
Design-space exploration of configurable Cyber-Physical Systems (CPS) requires executable evaluation when design choices affect timing, fault propagation, recovery behavior, and temporal-property satisfaction. Repeated stochastic executions make exhaustive exploration impractical for large design spaces. This paper pre...
T. Fabarisov, Maxime Cordy· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.