Temporal Planning with Temporal Metric Trajectory Constraints
نویسندگان
چکیده
منابع مشابه
Deductive Planning with Temporal Constraints
Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction technology to facilitate such reasoning through temporal constraint networks. Extensions are introduced that make generation of actio...
متن کاملPlanning with Disjunctive Temporal Constraints
Many real-world problems contain elements of both planning and scheduling problems. In response, many frameworks and systems have been developed that add scheduling abilities to planning systems. We continue this trend by presenting a framework and algorithm for planning with disjunctive temporal constraints. We define a constraint-based interval (CBI) framework for describing a planning proble...
متن کاملPath planning with spatial and temporal constraints
In this thesis we consider different problems arising in the context of planning the movement of objects. The common aspect of these problems is the interaction of spatial and temporal constraints. The three main problems analyzed are: ∙ The first problem is a pursuit-evasion problem where some lions have the task to clear a grid graph whose nodes are initially contaminated. The contamination s...
متن کاملTemporal Multiagent Planning with Concurrent Action Constraints
This paper investigates how centralised, cooperative, multiagent planning problems with concurrent action constraints and heterogeneous agents can be encoded with some minor additions to PDDL, and how such encoded domains can be solved via a translation to temporal planning. Concurrency constraints are encoded on affordances (object-action tuples) and determine the conditions under which a part...
متن کاملEvaluating Consistency Algorithms for Temporal Metric Constraints
We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the 4STP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that 4STP is the most efficient for dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33017675