Sciweavers

408 search results - page 15 / 82
» A lookahead strategy for solving large planning problems
Sort
View
AIPS
2010
14 years 12 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
AUSAI
2005
Springer
15 years 3 months ago
A Multi-exchange Heuristic for a Production Location Problem
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
Yunsong Guo, Yanzhi Li, Andrew Lim, Brian Rodrigue...
BIRTHDAY
2005
Springer
15 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
IJCAI
1997
14 years 11 months ago
Scaling the Dynamic Approach to Autonomous Path Planning: Planning Horizon Dynamics
In the dynamical systems approach to robot path planning both sensed and remembered information contribute to shape a nonlinear vector eld that governs the behavior of an autonomo...
Edward W. Large, Henrik I. Christensen, Ruzena Baj...
CIE
2009
Springer
15 years 4 months ago
Stability under Strategy Switching
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated...
Soumya Paul, Ramaswamy Ramanujam, Sunil Easaw Simo...