Configurable Heuristic Adaptation for Improving Best First Search in AI Planning
暂无分享,去创建一个
[1] Lukás Chrpa,et al. What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask) , 2018, Knowl. Eng. Rev..
[2] Carlos Ansótegui,et al. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms , 2009, CP.
[3] Ivan Serina,et al. Best-First Width Search for Multi Agent Privacy-preserving Planning , 2019, ICAPS.
[4] Lukás Chrpa,et al. On the Evolution of Planner-Specific Macro Sets , 2017, AI*IA.
[5] Jörg Hoffmann,et al. The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..
[6] Andrew Coles,et al. Marvin: A Heuristic Search Planner with Online Macro-Action Learning , 2011, J. Artif. Intell. Res..
[7] Ivan Serina,et al. Plan Stability: Replanning versus Plan Repair , 2006, ICAPS.
[8] Alfonso Gerevini,et al. Planning through Automatic Portfolio Configuration: The PbP Approach , 2014, J. Artif. Intell. Res..
[9] Ivan Serina,et al. Progress in Case-Based Planning , 2015, ACM Comput. Surv..
[10] Ivan Serina,et al. A General Approach for Configuring PDDL Problem Models , 2018, ICAPS.
[11] Peter J. Stuckey,et al. Planning for Mining Operations with Time and Resource Constraints , 2014, ICAPS.
[12] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[13] Ivan Serina,et al. Kernel functions for case-based planning , 2010, Artif. Intell..
[14] Ivan Serina,et al. A Privacy-preserving Model for the Multi-agent Propositional Planning Problem , 2014, ECAI.
[15] Robert C. Holte,et al. Adding Local Exploration to Greedy Best-First Search in Satisficing Planning , 2014, AAAI.
[16] Lukás Chrpa,et al. On the effective configuration of planning domain models , 2015 .
[17] Ivan Serina,et al. Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval , 2012, ECAI.
[18] Carleton Coffrin,et al. Planning with MIP for Supply Restoration in Power Distribution Systems , 2013, IJCAI.
[19] Mohit Sewak,et al. Deep Reinforcement Learning , 2020, Deep Reinforcement Learning in Unity.
[20] Thomas Stützle,et al. MADS/F-Race: Mesh Adaptive Direct Search Meets F-Race , 2010, IEA/AIE.
[21] Kevin Leyton-Brown,et al. Improved Features for Runtime Prediction of Domain-Independent Planners , 2014, ICAPS.
[22] Ivan Serina,et al. Efficient Plan Adaptation through Replanning Windows and Heuristic Goals , 2010, RCRA.
[23] Ivan Serina,et al. Generating and Exploiting Cost Predictions in Heuristic State-Space Planning , 2020, ICAPS.
[24] Alex S. Fukunaga,et al. Exploration among and within Plateaus in Greedy Best-First Search , 2017, ICAPS.
[25] Jörg Hoffmann,et al. Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.
[26] Ivan Serina,et al. Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning , 2015, ICAPS.
[27] Ivan Serina,et al. Planning and Execution in a Personalised E-Learning Setting , 2011, CAEPIA.
[28] Ivan Serina,et al. Novelty Messages Filtering for Multi Agent Privacy-preserving Planning , 2019, SOCS.
[29] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[30] F. Wilcoxon. Individual Comparisons by Ranking Methods , 1945 .
[31] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[32] Tim Miller,et al. Integrated Hybrid Planning and Programmed Control for Real Time UAV Maneuvering , 2018, AAMAS.
[33] Akihiro Kishimoto,et al. A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning , 2011, SOCS.
[34] Malte Helmert,et al. Landmarks Revisited , 2008, AAAI.
[35] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[36] Patrik Haslum,et al. Landmarks for Numeric Planning Problems , 2017, IJCAI.
[37] Maximilian Fickert. Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning , 2018, SOCS.
[38] Ivan Serina,et al. An approach to efficient planning with numerical fluents and multi-criteria plan quality , 2008, Artif. Intell..
[39] Alex S. Fukunaga,et al. Tie-Breaking Strategies for Cost-Optimal Best First Search , 2017, J. Artif. Intell. Res..
[40] Ivan Serina,et al. Using AI Planning to Enhance E-Learning Processes , 2012, ICAPS.
[41] Jörg Hoffmann. Where Ignoring Delete Lists Works, Part II: Causal Graphs , 2011, ICAPS.
[42] Ivan Serina,et al. An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs , 2011, Fundam. Informaticae.
[43] Jendrik Seipp,et al. Automatic Configuration of Sequential Planning Portfolios , 2015, AAAI.
[44] Enrico Scala,et al. Numeric Kernel for Reasoning about Plans Involving Numeric Fluents , 2013, AI*IA.
[45] Ruishi Liang. A Survey of Heuristics for Domain-Independent Planning , 2012, J. Softw..
[46] Jörg Hoffmann,et al. Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization , 2016, J. Artif. Intell. Res..
[47] Kevin Leyton-Brown,et al. Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.
[48] Ivan Serina,et al. MEvo: a framework for effective macro sets evolution , 2020, J. Exp. Theor. Artif. Intell..
[49] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[50] Robert C. Holte,et al. Type-Based Exploration with Multiple Search Queues for Satisficing Planning , 2014, AAAI.
[51] Kevin Leyton-Brown,et al. An Efficient Approach for Assessing Hyperparameter Importance , 2014, ICML.
[52] Patrik Haslum,et al. Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions , 2014, J. Artif. Intell. Res..
[53] Kevin Leyton-Brown,et al. Algorithm runtime prediction: Methods & evaluation , 2012, Artif. Intell..
[54] T. L. McCluskey,et al. Embedding Automated Planning within Urban Traffic Management Operations , 2017, ICAPS.
[55] Richard Anthony Valenzano,et al. On the Completeness of Best-First Search Variants That Use Random Exploration , 2016, AAAI.