Search

Search Results

• Multi-Directional Search

  Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg, Nathan Sturtevant, Sven Koenig

  121-122

  2020-05-26

• Transition to eBuses with Minimal Timetable Disruptions

  Alejandro Arbelaez, Laura Climent

  119-120

  2020-05-26

• Computing Plan-Length Bounds Using Lengths of Longest Paths

  Mohammad Abdulaziz, Dominik Berger

  117-118

  2020-05-26

• Multi-Train Path Finding

  Dor Atzmon, Amit Diei, Daniel Rave

  125-129

  2019-07-16

• An Improved Meet in the Middle Algorithm for Graphs with Unit Costs

  Edward Sewell, John Pavlik, Sheldon Jacobson

  145-149

  2019-07-16

• A Profit Guided Coordination Heuristic for Travelling Thief Problems

  Majid Namazi, M.A. Newton, Abdul Sattar, Conrad Sanderson

  140-144

  2019-07-16

• Error Analysis and Correction for Weighted A*’s Suboptimality

  Robert Holte, Rubén Majadas, Alberto Pozanco, Daniel Borrajo

  135-139

  2019-07-16

• Interleaving Search and Heuristic Improvement

  Santiago Franco, Alvaro Torralba

  130-134

  2019-07-16

• Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

  Roni Stern, Nathan Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Kumar, Roman Barták, Eli Boyarski

  151-158

  2019-07-16

• Repairing Compressed Path Databases on Maps with Dynamic Changes

  Marco Verzeletti, Adi Botea, Marina Zanella

  115-123

  2019-07-16

• Improving Bidirectional Heuristic Search by Bounds Propagation

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

  106-114

  2019-07-16

• Guiding Search with Generalized Policies for Probabilistic Planning

  William Shen, Felipe Trevizan, Sam Toyer, Sylvie Thiebaux, Lexing Xie

  97-105

  2019-07-16

• Trial-Based Heuristic Tree-Search for Distributed Multi-Agent Planning

  Tim Schulte, Bernhard Nebel

  88-96

  2019-07-16

• Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin

  Alfonso Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina

  79-87

  2019-07-16

• PASAR — Planning as Satisfiability with Abstraction Refinement

  Nils Froleyks, Tomas Balyo, Dominik Schreiber

  70-78

  2019-07-16

• Finding Optimal Longest Paths by Dynamic Programming in Parallel

  Kai Fieger, Tomas Balyo, Christian Schulz, Dominik Schreiber

  61-69

  2019-07-16

• Challenging Human Supremacy in Skat

  Stefan Edelkamp

  52-60

  2019-07-16

• Optimal and Bounded-Suboptimal Multi-Agent Motion Planning

  Liron Cohen, Tansel Uras, T. K. Kumar, Sven Koenig

  44-51

  2019-07-16

• Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles

  Robert Clausecker, Alexander Reinefeld

  35-43

  2019-07-16

• Learning and Utilizing Interaction Patterns among Neighborhood-Based Heuristics

  Chung-Yao Chuang, Stephen Smith

  26-34

  2019-07-16

• Revisiting Suboptimal Search

  Jingwei Chen, Nathan Sturtevant, William Doyle, Wheeler Ruml

  18-25

  2019-07-16

• On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective

  Roman Barták, Jiří Švancara

  10-17

  2019-07-16

• Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing

  Kalyan Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev

  2-9

  2019-07-16

• A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS

  Vidal Alcazar, Mike Barley, Pat Riddle

  160-161

  2019-07-16

• Measuring the Vulnerability of a Multi-Agent Pathfinding Solution

  Rotem Yoeli, Roni Stern, Dor Atzmon

  208-209

  2019-07-16