Inferring state constraints for domain-independent planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Journal of the ACM (JACM)
Breadth-first heuristic search
Artificial Intelligence
Best-first frontier search with delayed duplicate detection
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
External-memory pattern databases using structured duplicate detection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
Proceedings of the 2007 international workshop on Parallel symbolic computation
Dynamic Delayed Duplicate Detection for External Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Parallel structured duplicate detection
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Partitioned external-memory value iteration
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Edge partitioning in external-memory graph search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Best-first heuristic search for multi-core machines
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Domain-independent, automatic partitioning for probabilistic planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Leveraging graph locality via abstraction
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Best-first heuristic search for multicore machines
Journal of Artificial Intelligence Research
Ontology and instance matching
Knowledge-driven multimedia information extraction and ontology evolution
Evaluations of hash distributed A* in optimal sequence alignment
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Evaluation of a simple, scalable, parallel best-first search strategy
Artificial Intelligence
Hi-index | 0.00 |
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 approach to external-memory graph search that limits the number of slow disk I/O operations needed to access search nodes stored on disk by using an abstract representation of the graph to localize memory references. For graphs with sufficient locality, structured duplicate detection outperforms other approaches to external-memory graph search. We develop an automatic method for creating an abstract representation that reveals the local structure of a graph. We then integrate this approach into a domain-independent STRIPS planner and show that it dramatically improves scalability for a wide range of planning problems. The success of this approach strongly suggests that similar local structure can be found in many other graph-search problems.