English
Related papers

Related papers: Temporal Numeric Planning with Patterns

200 papers

The problem of scheduling under resource constraints is widely applicable. One prominent example is power management, in which we have a limited continuous supply of power but must schedule a number of power-consuming tasks. Such problems…

Artificial Intelligence · Computer Science 2016-02-11 Szymon Sidor , Peng Yu , Cheng Fang , Brian Williams

Formulating the intended behavior of a dynamic system can be challenging. Signal temporal logic (STL) is frequently used for this purpose due to its suitability in formalizing comprehensible, modular, and versatile spatiotemporal…

Systems and Control · Electrical Eng. & Systems 2025-03-04 Patrick Halder , Hannes Homburger , Lothar Kiltz , Johannes Reuter , Matthias Althoff

In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times…

Artificial Intelligence · Computer Science 2024-11-20 Arvid Becker , Pedro Cabalar , Martín Diéguez , Torsten Schaub , Anna Schuhmann

Temporal point process (TPP) models combined with recurrent neural networks provide a powerful framework for modeling continuous-time event data. While such models are flexible, they are inherently sequential and therefore cannot benefit…

Machine Learning · Computer Science 2020-11-11 Oleksandr Shchur , Nicholas Gao , Marin Biloš , Stephan Günnemann

In many applications, accurate class probability estimates are required, but many types of models produce poor quality probability estimates despite achieving acceptable classification accuracy. Even though probability calibration has been…

Machine Learning · Computer Science 2020-02-18 Tim Leathart , Maksymilian Polaczuk

Hand-encoding PDDL domains is generally accepted as difficult, tedious and error-prone. The difficulty is even greater when temporal domains have to be encoded. Indeed, actions have a duration and their effects are not instantaneous. In…

Artificial Intelligence · Computer Science 2021-12-09 Maxence Grand , Damien Pellier , Humbert Fiorino

Translating natural language instructions into executable motion plans is a fundamental challenge in robotics. Traditional approaches are typically constrained by their reliance on domain-specific expertise to customize planners, and often…

Robotics · Computer Science 2025-10-21 Jia Li , Guoxiang Zhao

Temporal planning often involves numeric effects that are directly proportional to their action's duration. These include continuous effects, where a numeric variable is subjected to a rate of change while the action is being executed, and…

Artificial Intelligence · Computer Science 2022-02-01 Josef Bajada , Maria Fox , Derek Long

Recent work in the construction of 3D scene graphs has enabled mobile robots to build large-scale metric-semantic hierarchical representations of the world. These detailed models contain information that is useful for planning, however an…

Robotics · Computer Science 2024-11-12 Aaron Ray , Christopher Bradley , Luca Carlone , Nicholas Roy

State-space models (SSMs) are a highly expressive model class for learning patterns in time series data and for system identification. Deterministic versions of SSMs (e.g. LSTMs) proved extremely successful in modeling complex time series…

In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl+, showing that the language makes convenient the modelling…

Artificial Intelligence · Computer Science 2011-10-12 M. Fox , D. Long

We present some techniques for planning in domains specified with the recent standard language PDDL2.1, supporting 'durative actions' and numerical quantities. These techniques are implemented in LPG, a domain-independent planner that took…

Artificial Intelligence · Computer Science 2011-06-28 A. Gerevini , A. Saetti , I. Serina

Replanning in temporal logic tasks is extremely difficult during the online execution of robots. This study introduces an effective path planner that computes solutions for temporal logic goals and instantly adapts to non-static and…

Robotics · Computer Science 2023-02-23 Yizhou Chen , Ruoyu Wang , Xinyi Wang , Ben M. Chen

In this work, we investigate task planning for mobile robots under linear temporal logic (LTL) specifications. This problem is particularly challenging when robots navigate in continuous workspaces due to the high computational complexity…

Systems and Control · Electrical Eng. & Systems 2023-09-27 Ruijia Liu , Shaoyuan Li , Xiang Yin

We consider the general problem of modeling temporal data with long-range dependencies, wherein new observations are fully or partially predictable based on temporally-distant, past observations. A sufficiently powerful temporal model…

We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, i.e., STCTL is interpreted…

Logic in Computer Science · Computer Science 2023-10-20 Jaime Arias , Wojciech Jamroga , Wojciech Penczek , Laure Petrucci , Teofil Sidoruk

With the fast development of various positioning techniques such as Global Position System (GPS), mobile devices and remote sensing, spatio-temporal data has become increasingly available nowadays. Mining valuable knowledge from…

Machine Learning · Computer Science 2019-06-25 Senzhang Wang , Jiannong Cao , Philip S. Yu

Many safety-critical systems must achieve high-level task specifications with guaranteed safety and correctness. Much recent progress towards this goal has been made through controller synthesis from signal temporal logic (STL)…

Robotics · Computer Science 2018-10-23 Rafael Rodrigues da Silva , Hai Lin

Using LLMs not to predict plans but to formalize an environment into the Planning Domain Definition Language (PDDL) has been shown to improve performance and control. While most existing methodology only applies to fully observable…

Artificial Intelligence · Computer Science 2026-04-10 Liancheng Gong , Wang Zhu , Jesse Thomason , Li Zhang

#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of…

Logic in Computer Science · Computer Science 2015-10-30 Dmitry Chistikov , Rayna Dimitrova , Rupak Majumdar