810 search results - page 34 / 162 » Solving Time-Dependent Planning Problems |
AUSAI
2008
Springer
13 years 10 months ago
2008
Springer
In this paper the notion of a partial-order plan is extended to task-hierarchies. We introduce the concept of a partial-order taskhierarchy that decomposes a problem using multi-ta...
ICAI
2004
13 years 9 months ago
2004
We present a framework for coordinating autonomous planning agents. Together, these agents have to achieve a set of interdependent (elementary) tasks. Each of the agents receives a...
IAT
2009
IEEE
14 years 1 days ago
2009
IEEE
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
ICTAI
2009
IEEE
13 years 6 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...