Sciweavers

80 search results - page 5 / 16
» On the application of least-commitment and heuristic search ...
Sort
View
IJCAI
1989
13 years 8 months ago
Goal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par­ tially ordered plan is an operator precondition that is not yet achieved; operators,...
Mark Drummond, Ken Currie
ATAL
2009
Springer
14 years 2 months ago
Adversarial search with procedural knowledge heuristic
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
Viliam Lisý, Branislav Bosanský, Mic...
AIPS
2008
13 years 10 months ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
ECAI
2008
Springer
13 years 9 months ago
Learning in Planning with Temporally Extended Goals and Uncontrollable Events
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
André A. Ciré, Adi Botea
AAAI
1998
13 years 9 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...