Sciweavers

AIPS
2000
13 years 6 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
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...
Amnon Lotem, Dana S. Nau
AIPS
2000
13 years 6 months ago
On-line Scheduling via Sampling
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...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
AIPS
2000
13 years 6 months ago
New Results about LCGP, a Least Committed GraphPlan
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...
Michel Cayrol, Pierre Régnier, Vincent Vida...
AIPS
2000
13 years 6 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
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...
Blai Bonet, Hector Geffner
AIPS
2000
13 years 6 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
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...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...
AIPS
2000
13 years 6 months ago
Probabilistic Hybrid Action Models for Predicting Concurrent Percept-Driven Robot Behavior
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...
Michael Beetz, Henrik Grosskreutz