What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask)

[1]  Yaxin Bi,et al.  Combining rough decisions for intelligent text mining using Dempster’s rule , 2006, Artificial Intelligence Review.

[2]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[3]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

[4]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[5]  Lukás Chrpa,et al.  Portfolio-based planning: State of the art, common practice and open challenges , 2015, AI Commun..

[6]  Jorge A. Baier,et al.  Planning with Preferences , 2008, AI Mag..

[7]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[8]  S. Edelkamp,et al.  Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4 , 2006, J. Artif. Intell. Res..

[9]  Martin Gebser,et al.  Design and results of the Fifth Answer Set Programming Competition , 2016, Artif. Intell..

[10]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[11]  Daniel Borrajo,et al.  Using Automated Planning for Traffic Signals Control , 2016 .

[12]  Sergio Jiménez Celorrio,et al.  The deterministic part of the seventh International Planning Competition , 2015, Artif. Intell..

[13]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[14]  Alfonso Gerevini,et al.  Planning through Automatic Portfolio Configuration: The PbP Approach , 2014, J. Artif. Intell. Res..

[15]  Malte Helmert,et al.  Complexity results for standard benchmark domains in planning , 2003, Artif. Intell..

[16]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[17]  Ian Horrocks,et al.  Combinations of Modal Logics , 2002, Artificial Intelligence Review.

[18]  E. Dahlman,et al.  A Critical Assessment of Benchmark Comparison in Planning , 2002, J. Artif. Intell. Res..

[19]  Patrik Haslum,et al.  Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..

[20]  Jörg Hoffmann,et al.  The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..

[21]  Lukás Chrpa,et al.  The Fifth International Competition on Knowledge Engineering for Planning and Scheduling: Summary and Trends , 2017, AI Mag..

[22]  Yixin Chen,et al.  Temporal Planning using Subgoal Partitioning and Resolution in SGPlan , 2006, J. Artif. Intell. Res..

[23]  Carmel Domshlak,et al.  Red-black planning: A new systematic approach to partial delete relaxation , 2015, Artif. Intell..

[24]  Jörg Hoffmann.  Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ , 2011, J. Artif. Intell. Res..

[25]  F. Wilcoxon.  SOME RAPID APPROXIMATE STATISTICAL PROCEDURES , 1950 .

[26]  Tom Bylander,et al.  A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..