Abstract
Language | English |
---|---|
Publication status | Published - 2001 |
Event | 6th European Conference on Planning - Toledo, Spain Duration: 12 Sep 2001 → 14 Jul 2016 |
Conference
Conference | 6th European Conference on Planning |
---|---|
Abbreviated title | ECP 2001 |
Country | Spain |
City | Toledo |
Period | 12/09/01 → 14/07/16 |
Fingerprint
Keywords
- landmarks
- planning
- ordering constraints
Cite this
}
On the extraction, ordering, and usage of landmarks in planning. / Porteous, Julie; Sebastia, Laura; Hoffmann, Jorg.
2001. Paper presented at 6th European Conference on Planning, Toledo, Spain.Research output: Contribution to conference › Paper
TY - CONF
T1 - On the extraction, ordering, and usage of landmarks in planning
AU - Porteous, Julie
AU - Sebastia, Laura
AU - Hoffmann, Jorg
N1 - Requires Template change to Chapter in Book/Report/Conference proceeding › Conference contribution: Proceedings of the 6th European Conference on Planning (ECP 01)
PY - 2001
Y1 - 2001
N2 - Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and use them for guiding search, in the hope to speed up the planning process. We go beyond the previous approaches by dening ordering constraints not only over the (top level) goals, but also over the sub-goals that will arise during planning. Landmarks are facts that must be true at some point in every valid solution plan. We show how such landmarks can be found, how their inherent ordering constraints can be approximated, and how this information can be used to decompose a given planning task into severa smaller sub-tasks. Our methodology is completely domain- and planner-independent. The implementation demonstrates that the approach can yield significant performance improvements in both heuristic forward search and GRAPHPLAN-style planning.
AB - Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and use them for guiding search, in the hope to speed up the planning process. We go beyond the previous approaches by dening ordering constraints not only over the (top level) goals, but also over the sub-goals that will arise during planning. Landmarks are facts that must be true at some point in every valid solution plan. We show how such landmarks can be found, how their inherent ordering constraints can be approximated, and how this information can be used to decompose a given planning task into severa smaller sub-tasks. Our methodology is completely domain- and planner-independent. The implementation demonstrates that the approach can yield significant performance improvements in both heuristic forward search and GRAPHPLAN-style planning.
KW - landmarks
KW - planning
KW - ordering constraints
UR - http://www.informatik.uni-freiburg.de/~ki/papers/porteous-et-al-ecp-01.pdf
M3 - Paper
ER -