Corpus ID: 5526093

Problem Splitting Using Heuristic Search in Landmark Orderings

@inproceedings{Vernhes2013ProblemSU,
  title={Problem Splitting Using Heuristic Search in Landmark Orderings},
  author={Simon Vernhes and G. Infantes and V. Vidal},
  booktitle={IJCAI},
  year={2013}
}
In this paper, we revisit the idea of splitting a planning problem into subproblems hopefully easier to solve with the help of landmark analysis. While this technique initially proposed in the first approaches related to landmarks has been outperformed by landmark-based heuristics, we believe that it is still a promising research direction. To this end, we propose a new method for problem splitting based on landmarks which has two advantages over the original technique: it is complete (if a… Expand
10 Citations
On the Use of Landmarks in LPG
  • PDF
A new goal ordering for incremental planning
Planning with preferences, specification and search
  • PDF
Scalable and optimal planning based on Pregel
A quality and distance guided hybrid algorithm for the vertex separator problem
  • 3
Monotone Temporal Planning: Tractability, Extensions and Applications
  • 10
  • PDF
Automated Planning and Acting
  • 188
  • PDF

References

SHOWING 1-10 OF 35 REFERENCES
Ordered Landmarks in Planning
  • 330
  • Highly Influential
  • PDF
Landmark Extraction via Planning Graph Propagation
  • 58
Landmarks Revisited
  • 240
  • PDF
Planning as heuristic search
  • 985
  • PDF
A Lookahead Strategy for Heuristic Search Planning
  • V. Vidal
  • Computer Science, Mathematics
  • ICAPS
  • 2004
  • 158
  • PDF
Sound and Complete Landmarks for And/Or Graphs
  • 94
  • PDF
YAHSP 2 : Keep It Simple , Stupid
  • 36
  • PDF
Preferred Operators and Deferred Evaluation in Satisficing Planning
  • 98
  • PDF
The FF Planning System: Fast Plan Generation Through Heuristic Search
  • 2,060
  • PDF
...
1
2
3
4
...