default search action
14th SOCS 2021: Virtual [Jinan, China]
- Hang Ma, Ivan Serina:
Proceedings of the Fourteenth International Symposium on Combinatorial Search, SOCS 2021, Virtual Conference [Jinan, China], July 26-30, 2021. AAAI Press 2021, ISBN 978-1-57735-870-1
Long Papers
- Pablo Araneda, Matias Greco, Jorge A. Baier:
Exploiting Learned Policies in Focal Search. 2-10 - Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier:
A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. 11-19 - Adi Botea, Vadim Bulitko:
Scaling Up Search with Partial Initial States in Optimization Crosswords. 20-27 - Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. 28-36 - Ishani Chatterjee, Tushar Kusnur, Maxim Likhachev:
Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information. 37-45 - Jingkai Chen, Yuening Zhang, Cheng Fang, Brian C. Williams:
Generalized Conflict-Directed Search for Optimal Ordering Problems. 46-54 - Robert Clausecker, Florian Schintke:
A Measure of Quality for IDA* Heuristics. 55-63 - Ofir Gordon, Yuval Filmus, Oren Salzman:
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. 64-72 - Richard E. Korf:
Finding the Exact Diameter of a Graph with Partial Breadth-First Searches. 73-78 - Arthur Mahéo, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace:
Customised Shortest Paths Using a Distributed Reverse Oracle. 79-87 - Ronen Nir, Alexander Shleyfman, Erez Karpas:
Learning-Based Synthesis of Social Laws in STRIPS. 88-96 - Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro, Christian Daniel:
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems. 97-105 - Tamir Yaffe, Shawn Skyler, Ariel Felner:
Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. 106-114
Short Papers
- Abhinav Bhatia, Justin Svegliato, Shlomo Zilberstein:
On the Benefits of Randomly Adjusting Anytime Weighted A. 116-120 - Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish:
The Closed List is an Obstacle Too. 121-125 - Omri Kaduri, Eli Boyarski, Roni Stern:
Experimental Evaluation of Classical Multi Agent Path Finding Algorithms. 126-130 - Thorsten Klößner, Jörg Hoffmann:
Pattern Databases for Stochastic Shortest Path Problems. 131-135 - Tomás Rybecký, Miroslav Kulich, Anton Andreychuk, Konstantin S. Yakovlev:
Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning. 136-140
Extended Abstracts
- Saman Ahmadi
, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-directional A* (Extended Abstract). 142-144 - Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern:
Improving Continuous-time Conflict Based Search. 145-146 - Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. 147-149 - Roman Barták, Marika Ivanová, Jirí Svancara
From Classical to Colored Multi-Agent Path Finding. 150-152 - Martin Capek, Pavel Surynek:
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. 153-155 - Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto:
A Planning-based Approach for In-Station Train Dispatching. 156-158 - Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. 159-161 - Jingwei Chen, Nathan R. Sturtevant:
Avoiding Re-expansions in Suboptimal Best-First Search. 162-163 - Lukás Chrpa, Pavel Rytír
Adversary Strategy Sampling for Effective Plan Generation. 164-166 - Amihay Elboher, Shahaf S. Shperberg, Solomon Eyal Shimony:
Metareasoning for Interleaved Planning and Execution. 167-169 - Aaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue:
Learning Pseudo-Backdoors for Mixed Integer Programs. 170-172 - Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. 173-175 - Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic:
Multi-Target Search in Euclidean Space with Ray Shooting. 176-178 - Jiaoyang Li, Zhe Chen, Yi Zheng
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. 179-181 - Hang Ma:
Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding. 182-184 - Michal Nekvinda, Roman Barták, Meir Kalech:
Contingent Planning for Robust Multi-Agent Path Finding. 185-187 - Patrick Rodler:
Linear-Space Best-First Diagnosis Search. 188-190 - Yaron Shoham, Gal Elidan:
Solving Sokoban with Forward-Backward Reinforcement Learning. 191-193 - Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. 194-196 - Pavel Surynek:
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. 197-199 - Pavel Surynek:
Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. 200-202 - Pavel Surynek:
Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. 203-205 - Xiaohu Wu, Yihao Liu, Xueyan Tang, Wentong Cai, Funing Bai, Gilbert Khonstantine, Guopeng Zhao:
Multi-Agent Pickup and Delivery with Task Deadlines. 206-208 - Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig:
A Hierarchical Approach to Multi-Agent Path Finding. 209-211
Student Papers
- Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Further Improved Heuristics For Conflict-Based Search. 213-215 - Marcelo de Souza:
How to Speed-Up the Automated Configuration of Optimization Algorithms. 216-218 - Matias Greco:
Exploiting Learned Policies and Learned Heuristics in Bounded-Suboptimal Search. 219-221 - Tianyi Gu:
Distributional Metareasoning for Heuristic Search. 222-224 - Zhenjun Liu, Leroy Chew
Avoiding Monochromatic Rectangles Using Shift Patterns. 225-227 - Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski:
Studying Online Multi-Agent Path Finding. 228-230 - Van Nguyen, Tran Cao Son, William Yeoh:
Explainable Problem in clingo-dl Programs. 231-232 - Sergio Poo Hernandez, Vadim Bulitko:
Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar. 233-235 - Shahaf S. Shperberg:
Meta-level Techniques for Planning, Search, and Scheduling. 236-238 - David Vainshtein, Oren Salzman:
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation. 239-241 - Julia Wichlacz, Daniel Höller, Jörg Hoffmann:
Landmark Heuristics for Lifted Planning - Extended Abstract. 242-244
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-01-09 19:39 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: