72 search results - page 3 / 15 » Fast Planning by Search in Domain Transition Graph |
95
Voted
AIPS
2008
15 years 1 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
182
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
103
Voted
STAIRS
2008
15 years 1 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
90
Voted
AAAI
2006
15 years 1 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
90
Voted
AIPS
2008
15 years 1 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...