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...
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...
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...
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...
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...