Fast planning through planning graph analysis
Avrim Blum, Merrick L. Furst low
No abstract in the source record.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- The FF Planning System: Fast Plan Generation Through Heuristic Search→Fast planning through planning graph analysisLegacy edge — source detail unavailable
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains→Fast planning through planning graph analysisLegacy edge — source detail unavailable
- Fast planning through planning graph analysis→Introduction to AlgorithmsLegacy edge — source detail unavailable
- Fast planning through planning graph analysis→Strips: A new approach to the application of theorem proving to problem solvingLegacy edge — source detail unavailable
- The FF Planning System: Fast Plan Generation Through Heuristic Search→Strips: A new approach to the application of theorem proving to problem solvingLegacy edge — source detail unavailable
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains→Strips: A new approach to the application of theorem proving to problem solvingLegacy edge — source detail unavailable
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Introduction to Algorithms | 1991 | 17,031 |
| Strips: A new approach to the application of theorem proving to problem solving | 1971 | 4,090 |
What cites it, inside the corpus
Links
Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record
Topics
| AI-based Problem Solving and Planning | Computer Science |
| Logic, Reasoning, and Knowledge | Computer Science |
| Constraint Satisfaction and Optimization | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports2 author record(s) attached.
- supports25 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 b3024609427ad450…