Required concurrency can cause actions to interfere with running continuous effects. This interference can modify the rate of change, including the polarity, of a continuous effect. In this work, we propose a mechanism to support discrete interference of rates of change caused by instantaneous actions, the start and end endpoints of other durative actions, and numeric timed initial fluents. Current temporal planners have very limited support for such numeric dynamics. COLIN reduces a temporal numeric planning problem to a linear program (LP), but operates on an implicit assumption that the rate of change of a durative action’s continuous effect is constant throughout its execution. In this work we propose some enhancements to the...
Current temporal planners have a hard time solving large, real-world problems which involve dealing ...
International audienceThis paper describes a polynomially-solvable class of temporal planning proble...
International audienceRelaxation is ubiquitous in the practical resolution of combinatorial problems...
Temporal planning often involves numeric effects that are directly proportional to their action’s du...
We consider planning domains with both discrete and continuous changes. Continuous change occurs esp...
Non-linear continuous change is common in realworld problems, especially those that model physical ...
To correctly model certain real-world planning problems, it is essential to take into account time. ...
AbstractMetric temporal planning involves both selecting and organising actions to satisfy the goals...
Abstract Our focus in this paper is on natural exogenous actions (Pinto [8]), namely those which oc...
We describe a polynomially-solvable class of temporal planning problems. Polynomiality follows from ...
In this paper we describe two novel algorithms for temporal planning. The first algorithm, TP, is an...
Automated temporal planning is the technology of choice when controlling systems that can execute mo...
We present zeno, a least commitment planner that handles actions occurring over extended intervals o...
Current temporal planners have a hard time solving large, real-world problems which involve dealing ...
Few temporal planners handle both concurrency and uncer-tain durations, but these features commonly ...
Current temporal planners have a hard time solving large, real-world problems which involve dealing ...
International audienceThis paper describes a polynomially-solvable class of temporal planning proble...
International audienceRelaxation is ubiquitous in the practical resolution of combinatorial problems...
Temporal planning often involves numeric effects that are directly proportional to their action’s du...
We consider planning domains with both discrete and continuous changes. Continuous change occurs esp...
Non-linear continuous change is common in realworld problems, especially those that model physical ...
To correctly model certain real-world planning problems, it is essential to take into account time. ...
AbstractMetric temporal planning involves both selecting and organising actions to satisfy the goals...
Abstract Our focus in this paper is on natural exogenous actions (Pinto [8]), namely those which oc...
We describe a polynomially-solvable class of temporal planning problems. Polynomiality follows from ...
In this paper we describe two novel algorithms for temporal planning. The first algorithm, TP, is an...
Automated temporal planning is the technology of choice when controlling systems that can execute mo...
We present zeno, a least commitment planner that handles actions occurring over extended intervals o...
Current temporal planners have a hard time solving large, real-world problems which involve dealing ...
Few temporal planners handle both concurrency and uncer-tain durations, but these features commonly ...
Current temporal planners have a hard time solving large, real-world problems which involve dealing ...
International audienceThis paper describes a polynomially-solvable class of temporal planning proble...
International audienceRelaxation is ubiquitous in the practical resolution of combinatorial problems...