Search

Search Results

• Frontmatter

  Maxim Likhachev, Hana Rudová, Enrico Scala

  2025-07-29

• Surrogate Assisted Optimisation for Travelling Thief Problems

  Majid Namazi, Conrad Sanderson, M.A. Newton, Abdul Sattar

  111-115

  2020-05-26

• Toward a String-Pulling Approach to Path Smoothing on Grid Graphs

  Jihee Han, Tansel Uras, Sven Koenig

  106-110

  2020-05-26

• Generalizing Multi-Agent Path Finding for Heterogeneous Agents

  Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner

  101-105

  2020-05-26

• Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP

  Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar

  91-99

  2020-05-26

• Applying Monte-Carlo Tree Search in HTN Planning

  Julia Wichlacz, Daniel Höller, Alvaro Torralba, Jörg Hoffmann

  82-90

  2020-05-26

• A Guide to Budgeted Tree Search

  Nathan Sturtevant, Malte Helmert

  75-81

  2020-05-26

• On the Differences and Similarities of fMM and GBFHS

  Shahaf Shperberg, Ariel Felner

  66-74

  2020-05-26

• An Atom-Centric Perspective on Stubborn Sets

  Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers

  57-65

  2020-05-26

• Embedding Directed Graphs in Potential Fields Using FastMap-D

  Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Kumar

  48-56

  2020-05-26

• Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces

  Florian Geißer, David Speck, Thomas Keller

  38-47

  2020-05-26

• Multi-Resolution A*

  Wei Du, Fahad Islam, Maxim Likhachev

  29-37

  2020-05-26

• Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions

  Lukas Chrpa, Pavel Rytir, Rostislav Horcik

  20-28

  2020-05-26

• From Multi-Agent Pathfinding to 3D Pipe Routing

  Gleb Belov, Wenbo Du, Maria Garcia De La Banda, Daniel Harabor, Sven Koenig, Xinrui Wei

  11-19

  2020-05-26

• Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search

  Behrouz Babaki, Gilles Pesant, Claude-Guy Quimper

  2-10

  2020-05-26

• On Modelling Multi-Agent Path Finding as a Classical Planning Problem

  Jindřich Vodrážka, Roman Barták, Jiří Švancara

  141-142

  2020-05-26

• Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree

  Patrick Rodler

  135-136

  2020-05-26

• Cooperative Path Planning for Heterogeneous Agents

  Keisuke Otaki, Satoshi Koide, Ayano Okoso, Tomoki Nishi

  133-134

  2020-05-26

• Moving Agents in Formation in Congested Environments

  Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Kumar, Sven Koenig

  131-132

  2020-05-26

• New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding

  Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter Stuckey, Hang Ma, Sven Koenig

  129-130

  2020-05-26

• Heuristic AND/OR Search for Solving Influence Diagram

  Junkyu Lee, Radu Marinescu, Rina Dechter

  127-128

  2020-05-26

• Solving the Watchman Route Problem on a Grid with Heuristic Search

  Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner

  139-140

  2020-05-26

• A Simple and Fast Bi-Objective Search Algorithm

  Carlos Hernández Ulloa, William Yeoh, Jorge Baier, Luis Suazo, Han Zhang, Sven Koenig

  125-126

  2020-05-26

• Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem

  Raad Salman, Fredrik Ekstedt, Peter Damaschke

  137-138

  2020-05-26

• F-Cardinal Conflicts in Conflict-Based Search

  Eli Boyarski, Daniel Harabor, Peter Stuckey, Pierre Le Bodic, Ariel Felner

  123-124

  2020-05-26