default search action
13th SOCS 2020: Online [Vienna, Austria]
- Daniel Harabor, Mauro Vallati:
Proceedings of the Thirteenth International Symposium on Combinatorial Search, SOCS 2020, Online Conference [Vienna, Austria], 26-28 May 2020. AAAI Press 2020, ISBN 978-1-57735-822-0
Long Papers
- Behrouz Babaki, Gilles Pesant, Claude-Guy Quimper:
Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search. 2-10 - Gleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei:
From Multi-Agent Pathfinding to 3D Pipe Routing. 11-19 - Lukás Chrpa, Pavel Rytír, Rostislav Horcík:
Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions. 20-28 - Wei Du, Fahad Islam, Maxim Likhachev:
Multi-Resolution A. 29-37 - Florian Geißer, David Speck, Thomas Keller:
Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces. 38-47 - Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. 48-56 - Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers:
An Atom-Centric Perspective on Stubborn Sets. 57-65 - Shahaf S. Shperberg, Ariel Felner:
On the Differences and Similarities of fMM and GBFHS. 66-74 - Nathan R. Sturtevant, Malte Helmert:
A Guide to Budgeted Tree Search. 75-81 - Julia Wichlacz, Daniel Höller, Álvaro Torralba
, Jörg Hoffmann:
Applying Monte-Carlo Tree Search in HTN Planning. 82-90 - Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. 91-99
Short Papers
- Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner:
Generalizing Multi-Agent Path Finding for Heterogeneous Agents. 101-105 - Jihee Han, Tansel Uras, Sven Koenig:
Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. 106-110 - Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, Abdul Sattar:
Surrogate Assisted Optimisation for Travelling Thief Problems. 111-115
Extended Abstracts
- Mohammad Abdulaziz
Computing Plan-Length Bounds Using Lengths of Longest Paths. 117-118 - Alejandro Arbelaez
Transition to eBuses with Minimal Timetable Disruptions. 119-120 - Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. 121-122 - Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner:
F-Cardinal Conflicts in Conflict-Based Search. 123-124 - Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm. 125-126 - Junkyu Lee, Radu Marinescu, Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram. 127-128 - Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. 129-130 - Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. 131-132 - Keisuke Otaki, Satoshi Koide, Ayano Okoso, Tomoki Nishi
Cooperative Path Planning for Heterogeneous Agents. 133-134 - Patrick Rodler:
Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree. 135-136 - Raad Salman, Fredrik Ekstedt, Peter Damaschke:
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. 137-138 - Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner:
Solving the Watchman Route Problem on a Grid with Heuristic Search. 139-140 - Jindrich Vodrázka, Roman Barták, Jirí Svancara
On Modelling Multi-Agent Path Finding as a Classical Planning Problem. 141-142
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 2024-12-12 20:47 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: