Abstract is missing.
- Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and SearchBehrouz Babaki, Gilles Pesant, Claude-Guy Quimper. 2-10 [doi]
- From Multi-Agent Pathfinding to 3D Pipe RoutingGleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei. 11-19 [doi]
- Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical ActionsLukás Chrpa, Pavel Rytír, Rostislav Horcík. 20-28 [doi]
- Multi-Resolution AWei Du, Fahad Islam, Maxim Likhachev. 29-37 [doi]
- Trial-Based Heuristic Tree Search for MDPs with Factored Action SpacesFlorian Geißer, David Speck, Thomas Keller 0001. 38-47 [doi]
- Embedding Directed Graphs in Potential Fields Using FastMap-DSriram Gopalakrishnan, Liron Cohen 0002, Sven Koenig, T. K. Satish Kumar. 48-56 [doi]
- An Atom-Centric Perspective on Stubborn SetsGabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers. 57-65 [doi]
- On the Differences and Similarities of fMM and GBFHSShahaf S. Shperberg, Ariel Felner. 66-74 [doi]
- A Guide to Budgeted Tree SearchNathan Sturtevant, Malte Helmert. 75-81 [doi]
- Applying Monte-Carlo Tree Search in HTN PlanningJulia Wichlacz, Daniel Höller, Álvaro Torralba, Jörg Hoffmann. 82-90 [doi]
- Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSPHong Xu 0003, Kexuan Sun 0002, Sven Koenig, T. K. Satish Kumar. 91-100 [doi]
- Generalizing Multi-Agent Path Finding for Heterogeneous AgentsDor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner. 101-105 [doi]
- Toward a String-Pulling Approach to Path Smoothing on Grid GraphsJihee Han, Tansel Uras, Sven Koenig. 106-110 [doi]
- Surrogate Assisted Optimisation for Travelling Thief ProblemsMajid Namazi, Conrad Sanderson, M. A. Hakim Newton, Abdul Sattar 0001. 111-115 [doi]
- Computing Plan-Length Bounds Using Lengths of Longest PathsMohammad Abdulaziz, Dominik Berger. 117-118 [doi]
- Transition to eBuses with Minimal Timetable DisruptionsAlejandro Arbelaez, Laura Climent. 119-120 [doi]
- Multi-Directional SearchDor Atzmon, Jiaoyang Li 0001, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan Sturtevant, Sven Koenig. 121-122 [doi]
- F-Cardinal Conflicts in Conflict-Based SearchEli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner. 123-124 [doi]
- A Simple and Fast Bi-Objective Search AlgorithmCarlos Hernández Ulloa, William Yeoh 0001, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig. 125-126 [doi]
- Heuristic AND/OR Search for Solving Influence DiagramJunkyu Lee, Radu Marinescu 0002, Rina Dechter. 127-128 [doi]
- New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path FindingJiaoyang Li 0001, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma 0001, Sven Koenig. 129-130 [doi]
- Moving Agents in Formation in Congested EnvironmentsJiaoyang Li 0001, Kexuan Sun 0002, Hang Ma 0001, Ariel Felner, T. K. Satish Kumar, Sven Koenig. 131-132 [doi]
- Cooperative Path Planning for Heterogeneous AgentsKeisuke Otaki, Satoshi Koide, Ayano Okoso, Tomoki Nishi. 133-134 [doi]
- Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set TreePatrick Rodler. 135-136 [doi]
- Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman ProblemRaad Salman, Fredrik Ekstedt, Peter Damaschke. 137-138 [doi]
- Solving the Watchman Route Problem on a Grid with Heuristic SearchShawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner. 139-140 [doi]
- On Modelling Multi-Agent Path Finding as a Classical Planning ProblemJindrich Vodrázka, Roman Barták, Jirí Svancara. 141-142 [doi]