59
Voted
AIPS
2000
15 years 29 days ago
2000
105
click to vote
AIPS
2000
15 years 29 days ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
AIPS
2000
15 years 29 days ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
AIPS
2000
15 years 29 days ago
2000
AIPS
2000
15 years 29 days ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
AIPS
2000
15 years 29 days ago
2000
AIPS
2000
15 years 29 days ago
2000
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
AIPS
2000
15 years 29 days ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
71
Voted
AIPS
2000
15 years 29 days ago
2000
100
Voted
AIPS
2000
15 years 29 days ago
2000
This paper develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern concurrent percept-driven robot plans. PHA...