Fetching the paper…
Reading the bibliography…
We investigate learning heuristics for domain-specific planning.
Ridge regression: Biased estimation for nonorthogonal problems
Arthur E Hoerl and Robert W Kennard · 1970
Earlier work this paper cites.
STRIPS: A new approach to the application of theorem proving to problem solving
Richard E. Fikes and Nils J. Nilsson · 1971
Earlier work this paper cites.
Complexity results for sas+ planning
Christer Bäckström and Bernhard Nebel · 1995
Earlier work this paper cites.
The FF planning system: Fast plan generation through heuristic search
Jörg Hoffmann and Bernhard Nebel · 2001
Earlier work this paper cites.
Optimizing search engines using clickthrough data
Thorsten Joachims · 2002
Earlier work this paper cites.
Where’ignoring delete lists’ works: local search topology in planning benchmarks
Jörg Hoffmann · 2005
Earlier work this paper cites.
The fast downward planning system
Malte Helmert · 2006
Earlier work this paper cites.
Training linear svms in linear time
Thorsten Joachims · 2006
Earlier work this paper cites.
Learning heuristic functions from relaxed plans
Sung Wook Yoon, Alan Fern, and Robert Givan · 2006
Earlier work this paper cites.
Discriminative learning of beam-search heuristics for planning
Yuehua Xu, Alan Fern, and Sung Wook Yoon · 2007
Cited alongside, same era.
Unifying the causal graph and additive heuristics
Malte Helmert and Héctor Geffner · 2008
Cited alongside, same era.
Learning control knowledge for forward search planning
Sungwook Yoon, Alan Fern, and Robert Givan · 2008
Cited alongside, same era.
Optimized cutting plane algorithm for large-scale risk minimization
Vojtěch Franc and Sören Sonnenburg · 2009
Cited alongside, same era.
Dlib-ml: A machine learning toolkit
Davis E King · 2009
Cited alongside, same era.
Preferred operators and deferred evaluation in satisficing planning
Silvia Richter and Malte Helmert · 2009
Cited alongside, same era.
Learning heuristic functions for large state spaces
Shahab Jabbari Arfaee, Sandra Zilles, and Robert C Holte · 2011
Later among the works it cites.
Fast downward stone soup
Malte Helmert, Gabriele Röger, Jendrik Seipp, Erez Karpas, Jörg Hoffmann, Emil Keyder, Raz Nissim, Silvia Richter, and Matthias Westphal · 2011
Later among the works it cites.
Where ignoring delete lists works, part ii: Causal graphs
Jörg Hoffmann · 2011
Later among the works it cites.
A review of machine learning for automated planning
Sergio Jiménez, Tomás De la Rosa, Susana Fernández, Fernando Fernández, and Daniel Borrajo · 2012
Later among the works it cites.
When does weighted a* fail?
Christopher Makoto Wilt and Wheeler Ruml · 2012
Later among the works it cites.
Learning heuristic functions for cost-based planning
Jesús Virseda, Daniel Borrajo, and Vidal Alcázar · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Learning linear ranking functions for beam search with application to planning
Yuehua Xu, Alan Fern, and Sungwook Yoon · 2009
Cited alongside, same era.
Action elimination and plan neighborhood graph search: Two algorithms for plan improvement
Hootan Nakhost · 2010
Cited alongside, same era.
Iterative learning of weighted rule sets for greedy search
Yuehua Xu, Alan Fern, and Sung Wook Yoon · 2010
Cited alongside, same era.
The 2014 international planning competition: Progress and trends
M. Vallati, L. Chrpa, M. Grzes, T.L. McCluskey, M. Roberts, and S. Sanner · 2015
Later among the works it cites.
Building a heuristic for greedy search
Christopher Makoto Wilt and Wheeler Ruml · 2015
Later among the works it cites.