English
Related papers

Related papers: Sampling-Based Planning Under STL Specifications: …

200 papers

Symbolic control problems aim to synthesize control policies for dynamical systems under complex temporal specifications. For such problems, Signal Temporal Logic (STL) is increasingly used as the formal specification language due to its…

Systems and Control · Electrical Eng. & Systems 2023-05-17 Shirantha Welikala , Hai Lin , Panos J. Antsaklis

Sampling-based algorithms solve the path planning problem by generating random samples in the search-space and incrementally growing a connectivity graph or a tree. Conventionally, the sampling strategy used in these algorithms is biased…

Robotics · Computer Science 2021-02-26 Sagar Suhas Joshi , Seth Hutchinson , Panagiotis Tsiotras

This paper explores continuous-time control synthesis for target-driven navigation to satisfy complex high-level tasks expressed as linear temporal logic (LTL). We propose a model-free framework using deep reinforcement learning (DRL) where…

Robotics · Computer Science 2023-03-17 Mingyu Cai , Makai Mann , Zachary Serlin , Kevin Leahy , Cristian-Ioan Vasile

Efficient scheduling is crucial for interactive Large Language Model (LLM) applications, where low request completion time directly impacts user engagement. Size-based scheduling algorithms like Shortest Remaining Process Time (SRPT) aim to…

Machine Learning · Computer Science 2024-10-03 Rana Shahout , Eran Malach , Chunwei Liu , Weifan Jiang , Minlan Yu , Michael Mitzenmacher

Planning safe trajectories under uncertain and dynamic conditions makes the autonomous driving problem significantly complex. Current sampling-based methods such as Rapidly Exploring Random Trees (RRTs) are not ideal for this problem…

Robotics · Computer Science 2020-11-11 Kaleb Ben Naveed , Zhiqian Qiao , John M. Dolan

We propose a new specification language and control synthesis technique for single and multi-robot high-level tasks; these tasks include timing constraints and reaction to environmental events. Specifically, we define Event-based Signal…

Robotics · Computer Science 2021-04-01 David Gundana , Hadas Kress-Gazit

In this paper, we develop approximate dynamic programming methods for stochastic systems modeled as Markov Decision Processes, given both soft performance criteria and hard constraints in a class of probabilistic temporal logic called…

Optimization and Control · Mathematics 2018-10-08 Lening Li , Jie Fu

The reliability of autonomous systems depends on their robustness, i.e., their ability to meet their objectives under uncertainty. In this paper, we study spatiotemporal robustness of temporal logic specifications evaluated over…

Artificial Intelligence · Computer Science 2026-05-19 Oliver Schön , Lars Lindemann

Robust motion planning entails computing a global motion plan that is safe under all possible uncertainty realizations, be it in the system dynamics, the robot's initial position, or with respect to external disturbances. Current approaches…

Robotics · Computer Science 2022-11-02 Albert Wu , Thomas Lew , Kiril Solovey , Edward Schmerling , Marco Pavone

The objective of this study is to enable fast and safe manipulation tasks in home environments. Specifically, we aim to develop a system that can recognize its surroundings and identify target objects while in motion, enabling it to plan…

Robotics · Computer Science 2026-02-25 Keisuke Takeshita , Takahiro Yamazaki , Tomohiro Ono , Takashi Yamamoto

We present a framework to interpret signal temporal logic (STL) formulas over discrete-time stochastic processes in terms of the induced risk. Each realization of a stochastic process either satisfies or violates an STL formula. In fact, we…

Systems and Control · Electrical Eng. & Systems 2022-03-08 Lars Lindemann , Nikolai Matni , George J. Pappas

Efficient and reliable generation of global path plans are necessary for safe execution and deployment of autonomous systems. In order to generate planning graphs which adequately resolve the topology of a given environment, many…

Robotics · Computer Science 2022-05-24 Alexander Lambert , Brian Hou , Rosario Scalise , Siddhartha S. Srinivasa , Byron Boots

Processing graphs with temporal information (the temporal graphs) has become increasingly important in the real world. In this paper, we study efficient solutions to temporal graph applications using new algorithms for Incremental Minimum…

Data Structures and Algorithms · Computer Science 2025-05-13 Xiangyun Ding , Yan Gu , Yihan Sun

This paper presents algorithms for performing data-driven reachability analysis under temporal logic side information. In certain scenarios, the data-driven reachable sets of a robot can be prohibitively conservative due to the inherent…

Robotics · Computer Science 2022-03-31 Amr Alanwar , Frank J. Jiang , Maryam Sharifi , Dimos V. Dimarogonas , Karl H. Johansson

This paper extends the RRT* algorithm, a recently developed but widely-used sampling-based optimal motion planner, in order to effectively handle nonlinear kinodynamic constraints. Nonlinearity in kinodynamic differential constraints often…

Robotics · Computer Science 2016-03-15 Jung-Su Ha , Han-Lim Choi , Jeong hwan Jeon

Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring. Given a set of positive and negative examples,…

Software Engineering · Computer Science 2025-01-03 Changjian Zhang , Parv Kapoor , Ian Dardik , Leyi Cui , Romulo Meira-Goes , David Garlan , Eunsuk Kang

Autonomous agents often operate in uncertain environments where their decisions are made based on beliefs over states of targets. We are interested in controller synthesis for complex tasks defined over belief spaces. Designing such…

Systems and Control · Computer Science 2015-10-30 Chanyeol Yoo , Calin Belta

In an environment where a manipulator needs to execute multiple consecutive tasks, the act of object manoeuvre will change the underlying configuration space, affecting all subsequent tasks. Previously free configurations might now be…

Robotics · Computer Science 2022-09-07 Tin Lai , Fabio Ramos

Sparse residual tree (SRT) is an adaptive exploration method for multivariate scattered data approximation. It leads to sparse and stable approximations in areas where the data is sufficient or redundant, and points out the possible local…

Numerical Analysis · Mathematics 2019-05-15 Xin Xu , Xiaopeng Luo

Spatio-temporal forecasting is crucial in many domains, such as transportation, meteorology, and energy. However, real-world scenarios frequently present challenges such as signal anomalies, noise, and distributional shifts. Existing…

Machine Learning · Computer Science 2025-10-30 Wei Chen , Yuxuan Liang