Abstract is missing.
- Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based RoutingKalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev. 2-9 [doi]
- On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs ObjectiveRoman Barták, Jirí Svancara. 10-17 [doi]
- Revisiting Suboptimal SearchJingwei Chen, Nathan R. Sturtevant, William J. Doyle, Wheeler Ruml. 18-25 [doi]
- Learning and Utilizing Interaction Patterns among Neighborhood-Based HeuristicsChung-Yao Chuang, Stephen F. Smith. 26-34 [doi]
- Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile PuzzlesRobert Clausecker, Alexander Reinefeld. 35-43 [doi]
- Optimal and Bounded-Suboptimal Multi-Agent Motion PlanningLiron Cohen 0002, Tansel Uras, T. K. Satish Kumar, Sven Koenig. 44-51 [doi]
- Challenging Human Supremacy in SkatStefan Edelkamp. 52-60 [doi]
- Finding Optimal Longest Paths by Dynamic Programming in ParallelKai Fieger, Tomás Balyo, Christian Schulz 0003, Dominik Schreiber. 61-69 [doi]
- PASAR - Planning as Satisfiability with Abstraction RefinementNils Christian Froleyks, Tomás Balyo, Dominik Schreiber. 70-78 [doi]
- Novelty Messages Filtering for Multi Agent Privacy-Preserving PlanninAlfonso Emilio Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina. 79-87 [doi]
- Trial-Based Heuristic Tree-Search for Distributed Multi-Agent PlanningTim Schulte, Bernhard Nebel. 88-96 [doi]
- Guiding Search with Generalized Policies for Probabilistic PlanningWilliam Shen, Felipe W. Trevizan, Sam Toyer, Sylvie Thiébaux, Lexing Xie. 97-105 [doi]
- Improving Bidirectional Heuristic Search by Bounds PropagationShahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun. 106-114 [doi]
- Repairing Compressed Path Databases on Maps with Dynamic ChangesMarco Verzeletti, Adi Botea, Marina Zanella. 115-124 [doi]
- Multi-Train Path FindingDor Atzmon, Amit Diei, Daniel Rave. 125-129 [doi]
- Interleaving Search and Heuristic ImprovementSantiago Franco, Álvaro Torralba. 130-134 [doi]
- Error Analysis and Correction for Weighted A*'s SuboptimalityRobert C. Holte, Rubén Majadas, Alberto Pozanco, Daniel Borrajo. 135-139 [doi]
- A Profit Guided Coordination Heuristic for Travelling Thief ProblemsMajid Namazi, M. A. Hakim Newton, Abdul Sattar 0001, Conrad Sanderson. 140-144 [doi]
- An Improved Meet in the Middle Algorithm for Graphs with Unit CostsEdward C. Sewell, John Pavlik, Sheldon H. Jacobson. 145-150 [doi]
- Multi-Agent Pathfinding: Definitions, Variants, and BenchmarksRoni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma 0001, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen 0002, T. K. Satish Kumar, Roman Barták, Eli Boyarski. 151-159 [doi]
- A Theoretical Comparison of the Bounds of MM, NBS, and GBFHSVidal Alcázar, Mike Barley, Patricia J. Riddle. 160-161 [doi]
- Probabilistic Robust Multi-Agent Path FindingDor Atzmon, Ariel Felner, Roni Stern. 162-163 [doi]
- A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise PreferencesNawal Benabbou, Thibaut Lust. 164-165 [doi]
- An Improved Algorithm for Optimal Coalition Structure GenerationNarayan Changder, Samir Aknine, Animesh Dutta. 166-167 [doi]
- Real-Time Heuristic Search in Dynamic EnvironmentsChao Chi Cheng, Wheeler Ruml. 168-169 [doi]
- Assigning Suppliers to Meet a DeadlineLiat Cohen, Tal Grinshpoun, Roni Stern. 170-171 [doi]
- Improved Safe Real-Time Heuristic SearchBence Cserna, Kevin C. Gall, Wheeler Ruml. 172-173 [doi]
- Compiling Cost-Optimal Multi-Agent Pathfinding to ASPRodrigo N. Gómez, Carlos Hernández, Jorge A. Baier. 174-175 [doi]
- Brigitte, a Bridge-Based Grid Path-FinderAlban Grastien. 176-177 [doi]
- A Learning-Based Framework for Memory-Bounded Heuristic Search: First ResultsCarlos Hernández Ulloa, Jorge A. Baier, William Yeoh 0001, Vadim Bulitko, Sven Koenig. 178-179 [doi]
- A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent HeuristicsRyo Kuroiwa 0002, Alex Fukunaga. 180-181 [doi]
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary ResultsJiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma 0001, Sven Koenig. 182-183 [doi]
- Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path FindingJiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma 0001, Sven Koenig. 184-185 [doi]
- Multi-Agent Path Finding for Large AgentsJiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma 0001, T. K. Satish Kumar, Sven Koenig. 186-187 [doi]
- Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path FindingHang Ma 0001, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig. 188-189 [doi]
- Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and DeliveryHang Ma 0001, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig. 190-191 [doi]
- A-MHA*: Anytime Multi-Heuristic ARamkumar Natarajan, Muhammad Suhail Saleem, Sandip Aine, Maxim Likhachev, Howie Choset. 192-193 [doi]
- Generalized Target Assignment and Path Finding Using Answer Set ProgrammingVan Nguyen, Philipp Obermeier, Tran Cao Son, Torsten Schaub, William Yeoh 0001. 194-195 [doi]
- Enriching Non-Parametric Bidirectional Search Algorithms - Extended AbstractShahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun. 196-197 [doi]
- Algorithms for Average Regret MinimizationSabine Storandt, Stefan Funke. 198-199 [doi]
- Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)Pavel Surynek. 200-201 [doi]
- Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo TheoriesPavel Surynek. 202-203 [doi]
- Unbounded Sub-Optimal Conflict-Based Search in Complex DomainsThayne T. Walker, Nathan R. Sturtevant, Ariel Felner. 204-205 [doi]
- Learning to Generate Industrial SAT InstancesHaoze Wu, Raghuram Ramanujan. 206-207 [doi]
- Measuring the Vulnerability of a Multi-Agent Pathfinding SolutionRotem Yoeli, Roni Stern, Dor Atzmon. 208-209 [doi]