Presentations and Authors


Last name A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Track:
 

Long Papers

Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search PDF
Behrouz Babaki, Gilles Pesant, Claude-Guy Quimper
From Multi-Agent Pathfinding to 3D Pipe Routing PDF
Gleb Belov, Wenbo Du, Maria Garcia De La Banda, Daniel Harabor, Sven Koenig, Xinrui Wei
Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions PDF
Lukas Chrpa, Pavel Rytir, Rostislav Horcik
Multi-Resolution A* PDF
Wei Du, Fahad Islam, Maxim Likhachev
Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces PDF
Florian Geißer, David Speck, Thomas Keller
Embedding Directed Graphs in Potential Fields Using FastMap-D PDF
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar
An Atom-Centric Perspective on Stubborn Sets PDF
Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers
On the Differences and Similarities of fMM and GBFHS PDF
Shahaf Shperberg, Ariel Felner
A Guide to Budgeted Tree Search PDF
Nathan Sturtevant, Malte Helmert
Applying Monte-Carlo Tree Search in HTN Planning PDF
Julia Wichlacz, Daniel Höller, Alvaro Torralba, Jörg Hoffmann
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP PDF
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar

Short Papers

Generalizing Multi-Agent Path Finding for Heterogeneous Agents PDF
Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner
Toward a String-Pulling Approach to Path Smoothing on Grid Graphs PDF
Jihee Han, Tansel Uras, Sven Koenig
Surrogate Assisted Optimisation for Travelling Thief Problems PDF
Majid Namazi, Conrad Sanderson, M.A. Hakim Newton, Abdul Sattar

Extended Abstracts

Computing Plan-Length Bounds Using Lengths of Longest Paths PDF
Mohammad Abdulaziz, Dominik Berger
Transition to eBuses with Minimal Timetable Disruptions PDF
Alejandro Arbelaez, Laura Climent
Multi-Directional Search PDF
Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg, Nathan Sturtevant, Sven Koenig
F-Cardinal Conflicts in Conflict-Based Search PDF
Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner
A Simple and Fast Bi-Objective Search Algorithm PDF
Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig
Heuristic AND/OR Search for Solving Influence Diagram PDF
Junkyu Lee, Radu Marinescu, Rina Dechter
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding PDF
Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
Moving Agents in Formation in Congested Environments PDF
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Cooperative Path Planning for Heterogeneous Agents PDF
Keisuke Otaki, Satoshi Koide, Ayano Okoso, Tomoki Nishi
Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree PDF
Patrick Rodler
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem PDF
Raad Salman, Fredrik Ekstedt, Peter Damaschke
Solving the Watchman Route Problem on a Grid with Heuristic Search PDF
Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner
On Modelling Multi-Agent Path Finding as a Classical Planning Problem PDF
Jindřich Vodrážka, Roman Barták, Jiří Švancara