Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Adi Botea
2010 – today
- 2013
[j4]Akihiro Kishimoto, Alex Fukunaga, Adi Botea: Evaluation of a simple, scalable, parallel best-first search strategy. Artif. Intell. 195: 222-248 (2013)- 2012
[j3]Adi Botea, Jussi Rintanen, Debdeep Banerjee: Optimal Reconfiguration for Supply Restoration With Informed A* Search. IEEE Trans. Smart Grid 3(2): 583-593 (2012)
[c25]Alex Fukunaga, Akihiro Kishimoto, Adi Botea: Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters. AAAI 2012
[c24]
[c23]Alex Fukunaga, Akihiro Kishimoto, Adi Botea: Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). SOCS 2012
[i3]Akihiro Kishimoto, Alex Fukunaga, Adi Botea: Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy. CoRR abs/1201.3204 (2012)- 2011
[j2]Ko-Hsin Cindy Wang, Adi Botea: MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. J. Artif. Intell. Res. (JAIR) 42: 55-90 (2011)
[c22]Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby: Solution Quality Improvements for Massively Multi-Agent Pathfinding. AAAI 2011
[c21]
[c20]Daniel Damir Harabor, Adi Botea, Philip Kilby: Path Symmetries in Undirected Uniform-Cost Grids. SARA 2011
[c19]Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby: On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding. SOCS 2011
[i2]Daniel Harabor, Adi Botea, Philip Kilby: Symmetry-Based Search Space Reduction For Grid Maps. CoRR abs/1106.4083 (2011)
[i1]Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer: Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. CoRR abs/1109.2154 (2011)- 2010
[c18]
[c17]Ko-Hsin Cindy Wang, Adi Botea: Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees. ECAI 2010: 977-978
[c16]
2000 – 2009
- 2009
[c15]Jorge A. Baier, Adi Botea: Improving Planning Performance Using Low-Conflict Relaxed Plans. ICAPS 2009
[c14]Akihiro Kishimoto, Alex S. Fukunaga, Adi Botea: Scalable, Parallel Best-First Search for Optimal Sequential Planning. ICAPS 2009
[c13]Adi Botea, André A. Ciré: Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events. IJCAI 2009: 1647-1652
[c12]Ko-Hsin Cindy Wang, Adi Botea: Tractable Multi-Agent Path Planning on Grid Maps. IJCAI 2009: 1870-1875- 2008
[c11]John Paul Kelly, Adi Botea, Sven Koenig: Offline Planning with Hierarchical Task Networks in Video Games. AIIDE 2008
[c10]Ko-Hsin Cindy Wang, Adi Botea: Fast and Memory-Efficient Multi-Agent Pathfinding. ICAPS 2008: 380-387
[c9]Daniel Harabor, Adi Botea: Hierarchical path planning for multi-size agents in heterogeneous environments. CIG 2008: 258-265
[c8]
[c7]André A. Ciré, Adi Botea: Learning in Planning with Temporally Extended Goals and Uncontrollable Events. ECAI 2008: 578-582- 2007
[c6]Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig: Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007: 1007-1012
[c5]Adi Botea, Martin Müller, Jonathan Schaeffer: Fast Planning with Iterative Macros. IJCAI 2007: 1828-1833- 2005
[j1]Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer: Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. J. Artif. Intell. Res. (JAIR) 24: 581-621 (2005)
[c4]Adi Botea, Martin Müller, Jonathan Schaeffer: Learning Partial-Order Macros from Solutions. ICAPS 2005: 231-240- 2004
[c3]Adi Botea, Martin Müller, Jonathan Schaeffer: Using Component Abstraction for Automatic Generation of Macro-Actions. ICAPS 2004: 181-190- 2002
[c2]Adi Botea, Martin Müller, Jonathan Schaeffer: Using Abstraction for Planning in Sokoban. Computers and Games 2002: 360-375
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-13 21:45 CET by the dblp team



