Sciweavers

170 search results - page 4 / 34
» Solving Simple Planning Problems with More Inference and No ...
Sort
View
EWCBR
2008
Springer
13 years 9 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...
JSC
2010
107views more  JSC 2010»
13 years 6 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eļ...
Volker Gebhardt, Juan González-Meneses
AIPS
2006
13 years 9 months ago
A New Principle for Incremental Heuristic Search: Theoretical Results
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
Sven Koenig, Maxim Likhachev
AIPS
2007
13 years 10 months ago
Temporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artiļ¬cial intelligence. Yet most of the work in this area so far is limited in at...
Yuxiao Hu
AAAI
2000
13 years 9 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith