New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding (English)
- New search for: Li, Jiaoyang
- New search for: Gange, Graeme
- New search for: Harabor, Daniel
- New search for: Stuckey, Peter J.
- New search for: Ma, Hang
- New search for: Koenig, Sven
- New search for: Li, Jiaoyang
- New search for: Gange, Graeme
- New search for: Harabor, Daniel
- New search for: Stuckey, Peter J.
- New search for: Ma, Hang
- New search for: Koenig, Sven
In:
Proceedings of the Thirteenth International Symposium on Combinatorial Search (SoCS 2020)
; 129-130
;
2020
-
ISBN:
- Conference paper / Print
-
Title:New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding
-
Contributors:Li, Jiaoyang ( author ) / Gange, Graeme ( author ) / Harabor, Daniel ( author ) / Stuckey, Peter J. ( author ) / Ma, Hang ( author ) / Koenig, Sven ( author )
-
Conference:International Symposium on Combinatorial Search ; 13. ; 2020 ; Online
-
Published in:
-
Publisher:
- New search for: AAAI Press
-
Place of publication:Palo Alto, California
-
Publication date:2020
-
ISBN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
- New search for: 85.03 / 54.72 / 31.12
- Further information on Basic classification
-
Keywords:
-
Classification:
-
Source:
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 2
-
Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and SearchBabaki, Behrouz / Pesant, Gilles / Quimper, Claude-Guy et al. | 2020
- 11
-
From Multi-Agent Pathfinding to 3D Pipe RoutingBelov, Gleb / Du, Wenbo / Banda, Maria Garcia De La / Harabor, Daniel / Koenig, Sven / Wei, Xinrui et al. | 2020
- 20
-
Planning against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical ActionsChrpa, Lukas / Rytir, Pavel / Horcik, Rostislav et al. | 2020
- 29
-
Multi-Resolution A*Du, Wei / Islam, Fahad / Likhachev, Maxim et al. | 2020
- 38
-
Trial-Based Heuristic Tree Search for MDPs with Factored Action SpacesGeißer, Florian / Speck, David / Keller, Thomas et al. | 2020
- 48
-
£mbedding Directed Graphs in Potential Fields Using FastMap-DGopalakrishnan, Sriram / Cohen, Liron / Koenig, Sven / Kumar, T. K. Satish et al. | 2020
- 57
-
An Atom-Centric Perspective on Stubborn SetsRöger, Gabriele / Helmert, Malte / Seipp, Jendrik / Sievers, Silvan et al. | 2020
- 66
-
On the Differences and Similarities of fMM and GBFHSShperberg, Shahaf / Felner, Ariel et al. | 2020
- 75
-
A Guide to Budgeted Tree SearchSturtevant, Nathan / Helmert, Malte et al. | 2020
- 82
-
Applying Monte-Carlo Tree Search in HTN PlanningWichlacz, Julia / Höller, Daniel / Torralba, Alvaro / Hoffmann, Jörg et al. | 2020
- 91
-
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSPXu, Hong / Sun, Kexuan / Koenig, Sven / Kumar, T. K. Satish et al. | 2020
- 101
-
Generalizing Multi-Agent Path Finding for Heterogeneous AgentsAtzmon, Dor / Zax, Yonathan / Kivity, Einat / Avitan, Lidor / Morag, Jonathan / Felner, Ariel et al. | 2020
- 106
-
Toward a String-Pulling Approach to Path Smoothing on Grid GraphsHan, Tihee / Uras, Tansel / Koenig, Sven et al. | 2020
- 111
-
Surrogate Assisted Optimisation for Travelling Thief ProblemsNamazi, Majid / Sanderson, Conrad / Newton, M. A. Hakim / Sattar, Abdul et al. | 2020
- 117
-
Computing Plan-Length Bounds Using Lengths of Longest Paths /Abdulaziz, Mohammad / Berger, Dominik et al. | 2020
- 119
-
Transition to eBuses with Minimal Timetable DisruptionsArbelaez, Alejandro / Climent, Laura et al. | 2020
- 121
-
Multi-directional searchAtzmon, Dor / Li, Jiaoyang / Felner, Ariel / Nachmani, Eliran / Shperberg, Shahaf / Sturtevant, Nathan / Koenig, Sven et al. | 2020
- 123
-
f-Cardinal Conflicts in Conflict-Based SearchBoyarski, Eli / Harabor, Daniel / Stuckey, Peter J. / Bodic, Pierre Le / Felner, Ariel et al. | 2020
- 125
-
A Simple and Fast Bi-Objective Search AlgorithmUlloa, Carlos Hernández / Yeoh, William / Baier, Jorge A. / Suazo, Luis / Zhang, Han / Koenig, Sven et al. | 2020
- 127
-
Heuristic AND/OR Search for Solving Influence DiagramLee, Junkyu / Marinescu, Radu / Dechter, Rina et al. | 2020
- 129
-
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path FindingLi, Jiaoyang / Gange, Graeme / Harabor, Daniel / Stuckey, Peter J. / Ma, Hang / Koenig, Sven et al. | 2020
- 131
-
Moving Agents in Formation in Congested EnvironmentsLi, Jiaoyang / Sun, Kexuan / Ma, Hang / Felner, Ariel / Kumar, T. K. Satish / Koenig, Sven et al. | 2020
- 133
-
Cooperative Path Planning for Heterogeneous AgentsOtaki, Keisuke / Koide, Satoshi / Okoso, Ayano / Nishi, Tomoki et al. | 2020
- 135
-
Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set TreeRodler, Patrick et al. | 2020
- 137
-
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman ProblemSalman, Raad / Ekstedt, Fredrik / Damaschke, Peter et al. | 2020
- 139
-
Solving the Watchman Route Problem on a Grid with Heuristic SearchSeiref, Shawn / Jaffey, Tamir / Lopatin, Margarita / Felner, Ariel et al. | 2020
- 141
-
On Modelling Multi-Agent Path Finding as a Classical Planning ProblemVodrázka, Jindrich / Barádk, Roman / Svancara, Jiri et al. | 2020