• Published 2003

Landmark Extraction via Planning Graph Propagation

@inproceedings{Zhu2003LandmarkEV,
  title={Landmark Extraction via Planning Graph Propagation},
  author={Lin Zhu and Robert Givan},
  year={2003}
}
The planner GRAPHPLAN is based on an efficient propagation of reachability information which then effectively gu ides a search for a valid plan. We propose a framework in which a broader class of information, including the original reac hability information, can be propagated in the plan graph in polynomial time. As an example, we exhibit an algorithm for propagating “landmark” information, where a landmark is a proposition or action that must occur in any correct plan . This algorithm computes… CONTINUE READING

Figures and Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 46 CITATIONS

Planning with preferences, specification and search

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On the Use of Landmarks in LPG

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Full Extraction of Landmarks in Propositional Planning Tasks

VIEW 4 EXCERPTS
CITES RESULTS & METHODS
HIGHLY INFLUENCED

Sound and Complete Landmarks for And/Or Graphs

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.