68 search results - page 11 / 14 » Durative Planning in HTNs |
AAAI
2004
13 years 11 months ago
2004
In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...
TIME
2009
IEEE
14 years 4 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
HICSS
2003
IEEE
14 years 3 months ago
2003
IEEE
We define and develop a solution approach for planning, scheduling and managing project efforts where there is significant uncertainty in the duration, resource requirements and o...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
IJCAI
2003
13 years 11 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...