GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Abstract. This work presents a multiagent framework design for DemandResponsive Transportation, considering a virtual enterprise domain. The agent architecture obtained provides a ...