Search

Search Results

• Learning to Generate Industrial SAT Instances

  Haoze Wu, Raghuram Ramanujan

  206-207

  2019-07-16

• Unbounded Sub-Optimal Conflict-Based Search in Complex Domains

  Thayne Walker, Nathan Sturtevant, Ariel Felner

  204-205

  2019-07-16

• Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories

  Pavel Surynek

  202-203

  2019-07-16

• Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)

  Pavel Surynek

  200-201

  2019-07-16

• Algorithms for Average Regret Minimization

  Sabine Storandt, Stefan Funke

  198-199

  2019-07-16

• Enriching Non-Parametric Bidirectional Search Algorithms — Extended Abstract

  Shahaf Shperberg, Ariel Felner, Nathan Sturtevant, Solomon Shimony, Avi Hayoun

  196-197

  2019-07-16

• Generalized Target Assignment and Path Finding Using Answer Set Programming

  Van Nguyen, Philipp Obermeier, Tran Son, Torsten Schaub, William Yeoh

  194-195

  2019-07-16

• A-MHA*: Anytime Multi-Heuristic A*

  Ramkumar Natarajan, Muhammad Saleem, Sandip Aine, Maxim Likhachev, Howie Choset

  192-193

  2019-07-16

• Extended Abstract: Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery

  Hang Ma, Wolfgang Hönig, T. K. Kumar, Nora Ayanian, Sven Koenig

  190-191

  2019-07-16

• Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding

  Hang Ma, Daniel Harabor, Peter Stuckey, Jiaoyang Li, Sven Koenig

  188-189

  2019-07-16

• Multi-Agent Path Finding for Large Agents

  Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Kumar, Sven Koenig

  186-187

  2019-07-16

• Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

  Jiaoyang Li, Daniel Harabor, Peter Stuckey, Hang Ma, Sven Koenig

  184-185

  2019-07-16

• Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results

  Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig

  182-183

  2019-07-16

• A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics

  Ryo Kuroiwa, Alex Fukunaga

  180-181

  2019-07-16

• A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results

  Carlos Ulloa, Jorge Baier, William Yeoh, Vadim Bulitko, Sven Koenig

  178-179

  2019-07-16

• Brigitte, a Bridge-Based Grid Path-Finder

  Alban Grastien

  176-177

  2019-07-16

• Compiling Cost-Optimal Multi-Agent Pathfinding to ASP

  Rodrigo Gómez, Carlos Hernández, Jorge Baier

  174-175

  2019-07-16

• Improved Safe Real-Time Heuristic Search

  Bence Cserna, Kevin Gall, Wheeler Ruml

  172-173

  2019-07-16

• Assigning Suppliers to Meet a Deadline

  Liat Cohen, Tal Grinshpoun, Roni Stern

  170-171

  2019-07-16

• Real-Time Heuristic Search in Dynamic Environments

  Chao Cheng, Wheeler Ruml

  168-169

  2019-07-16

• An Improved Algorithm for Optimal Coalition Structure Generation

  Narayan Changder, Samir Aknine, Animesh Dutta

  166-167

  2019-07-16

• A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences

  Nawal Benabbou, Thibaut Lust

  164-165

  2019-07-16

• Probabilistic Robust Multi-Agent Path Finding

  Dor Atzmon, Ariel Felner, Roni Stern

  162-163

  2019-07-16

• Rapid Randomized Restarts for Multi-Agent Path Finding Solvers

  Liron Cohen, Glenn Wagner, David Chan, Howie Choset, Nathan Sturtevant, Sven Koenig, T. K. Kumar

  148-152

  2018-07-14

• A Neural Network for Decision Making in Real-Time Heuristic Search

  Franco Muñoz, Miguel Fadic, Carlos Hernández, Jorge Baier

  173-177

  2018-07-14