Safe Planning through Incremental Decomposition of Signal Temporal Logic Specifications
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, planning from these specifications using existing techniques scale exponentially with the number of nested operators and the horizon of specification. Additionally, 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 way to decompose STL requirements temporally to improve planning efficiency and performance. The key insight in our work is to encode all specifications as a set of reachability and invariance constraints and scheduling these constraints sequentially at runtime. Our proposed technique outperforms the state-of-the-art trajectory synthesis techniques for both linear and non linear dynamical systems.
Code (0)
등록된 구현이 없습니다.
Tasks
NavigateSchedulingTrajectory PlanningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Safe Feedback Motion Planning in Unknown Environments: An Instantaneous Local Control Barrier Function Approach
Mobile robots are desired with resilience to safely interact with prior-unknown environments and finally accomplish given tasks. This paper utilizes instantaneous local sensory data to stimulate the safe feedback motion …
Autonomous NavigationCollision AvoidanceMotion PlanningOne Word at a Time: Incremental Completion Decomposition Breaks LLM Safety
Large Language Models (LLMs) are trained to refuse harmful requests, yet they remain vulnerable to jailbreak attacks that exploit weaknesses in conversational safety mechanisms. We introduce Incremental Completion Decomp…
Contingency-Aware Planning via Certified Neural Hamilton-Jacobi Reachability
Hamilton-Jacobi (HJ) reachability provides formal safety guarantees for dynamical systems, but solving high-dimensional HJ partial differential equations limits its use in real-time planning. This paper presents a contin…
Learning Sampling Distributions Using Local 3D Workspace Decompositions for Motion Planning in High Dimensions
Earlier work has shown that reusing experience from prior motion planning problems can improve the efficiency of similar, future motion planning queries. However, for robots with many degrees-of-freedom, these methods ex…
Motion PlanningWorldRFT: Latent World Model Planning with Reinforcement Fine-Tuning for Autonomous Driving
Latent World Models enhance scene representation through temporal self-supervised learning, presenting a perception annotation-free paradigm for end-to-end autonomous driving. However, the reconstruction-oriented represe…
Self-Supervised LearningRepresentation LearningReinforcement LearningAutonomous Driving