Sciweavers

408 search results - page 4 / 82
» A lookahead strategy for solving large planning problems
Sort
View
JAIR
2011
134views more  JAIR 2011»
13 years 21 days ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
EVOW
2007
Springer
13 years 12 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
IDA
2005
Springer
13 years 11 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...
AAAI
1998
13 years 7 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
ML
1998
ACM
220views Machine Learning» more  ML 1998»
13 years 5 months ago
Learning to Improve Coordinated Actions in Cooperative Distributed Problem-Solving Environments
Abstract. Coordination is an essential technique in cooperative, distributed multiagent systems. However, sophisticated coordination strategies are not always cost-effective in all...
Toshiharu Sugawara, Victor R. Lesser