default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th SOCS 2019: Napa, California, USA
- Pavel Surynek, William Yeoh:
Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019. AAAI Press 2019, ISBN 978-1-57735-808-4
Long Papers
- Kalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev:
Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing. 2-9 - Roman Barták, Jirí Svancara
:
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. 10-17 - Jingwei Chen, Nathan R. Sturtevant, William J. Doyle, Wheeler Ruml:
Revisiting Suboptimal Search. 18-25 - Chung-Yao Chuang, Stephen F. Smith:
Learning and Utilizing Interaction Patterns among Neighborhood-Based Heuristics. 26-34 - Robert Clausecker, Alexander Reinefeld:
Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles. 35-43 - Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. 44-51 - Stefan Edelkamp:
Challenging Human Supremacy in Skat. 52-60 - Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. 61-69 - Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber:
PASAR - Planning as Satisfiability with Abstraction Refinement. 70-78 - Alfonso Emilio Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin. 79-87 - Tim Schulte, Bernhard Nebel:
Trial-Based Heuristic Tree-Search for Distributed Multi-Agent Planning. 88-96 - William Shen, Felipe W. Trevizan, Sam Toyer, Sylvie Thiébaux, Lexing Xie:
Guiding Search with Generalized Policies for Probabilistic Planning. 97-105 - Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun:
Improving Bidirectional Heuristic Search by Bounds Propagation. 106-114 - Marco Verzeletti, Adi Botea, Marina Zanella:
Repairing Compressed Path Databases on Maps with Dynamic Changes. 115-123
Short Papers
- Dor Atzmon, Amit Diei, Daniel Rave:
Multi-Train Path Finding. 125-129 - Santiago Franco, Álvaro Torralba:
Interleaving Search and Heuristic Improvement. 130-134 - Robert C. Holte, Rubén Majadas, Alberto Pozanco, Daniel Borrajo:
Error Analysis and Correction for Weighted A*'s Suboptimality. 135-139 - Majid Namazi, M. A. Hakim Newton, Abdul Sattar, Conrad Sanderson:
A Profit Guided Coordination Heuristic for Travelling Thief Problems. 140-144 - Edward C. Sewell, John Pavlik, Sheldon H. Jacobson:
An Improved Meet in the Middle Algorithm for Graphs with Unit Costs. 145-149
Position Papers
- Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. 151-158
Extended Abstracts
- Vidal Alcázar, Mike Barley, Patricia J. Riddle:
A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS. 160-161 - Dor Atzmon, Ariel Felner, Roni Stern:
Probabilistic Robust Multi-Agent Path Finding. 162-163 - Nawal Benabbou, Thibaut Lust:
A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. 164-165 - Narayan Changder, Samir Aknine, Animesh Dutta:
An Improved Algorithm for Optimal Coalition Structure Generation. 166-167 - Chao Chi Cheng, Wheeler Ruml:
Real-Time Heuristic Search in Dynamic Environments. 168-169 - Liat Cohen, Tal Grinshpoun, Roni Stern:
Assigning Suppliers to Meet a Deadline. 170-171 - Bence Cserna, Kevin C. Gall, Wheeler Ruml:
Improved Safe Real-Time Heuristic Search. 172-173 - Rodrigo N. Gómez, Carlos Hernández, Jorge A. Baier:
Compiling Cost-Optimal Multi-Agent Pathfinding to ASP. 174-175 - Alban Grastien:
Brigitte, a Bridge-Based Grid Path-Finder. 176-177 - Carlos Hernández Ulloa, Jorge A. Baier, William Yeoh, Vadim Bulitko, Sven Koenig:
A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results. 178-179 - Ryo Kuroiwa, Alex Fukunaga:
A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics. 180-181 - Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. 182-183 - Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. 184-185 - Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. 186-187 - Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. 188-189 - Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. 190-191 - Ramkumar Natarajan, Muhammad Suhail Saleem, Sandip Aine, Maxim Likhachev, Howie Choset:
A-MHA*: Anytime Multi-Heuristic A. 192-193 - Van Nguyen, Philipp Obermeier, Tran Cao Son, Torsten Schaub, William Yeoh:
Generalized Target Assignment and Path Finding Using Answer Set Programming. 194-195 - Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. 196-197 - Sabine Storandt, Stefan Funke:
Algorithms for Average Regret Minimization. 198-199 - Pavel Surynek:
Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). 200-201 - Pavel Surynek:
Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. 202-203 - Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. 204-205 - Haoze Wu, Raghuram Ramanujan:
Learning to Generate Industrial SAT Instances. 206-207 - Rotem Yoeli, Roni Stern, Dor Atzmon:
Measuring the Vulnerability of a Multi-Agent Pathfinding Solution. 208-209
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
