99 search results - page 6 / 20 » On the Hardness of Planning Problems with Simple Causal Grap... |
AAAI
1994
13 years 9 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
AAAI
1990
13 years 8 months ago
1990
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
JAIR
2006
13 years 7 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...