• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the International Symposium on Combinatorial Search /

Vol. 11 No. 1 (2020): Thirteenth Annual Symposium on Combinatorial Search

Long Papers

  • An Atom-Centric Perspective on Stubborn Sets

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

    57-65

    PDF
  • On the Differences and Similarities of fMM and GBFHS

    Shahaf Shperberg,Ariel Felner

    66-74

    PDF
  • A Guide to Budgeted Tree Search

    Nathan Sturtevant,Malte Helmert

    75-81

    PDF
  • Applying Monte-Carlo Tree Search in HTN Planning

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

    82-90

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

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

    91-99

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

    Behrouz Babaki,Gilles Pesant,Claude-Guy Quimper

    44967

    PDF
  • From Multi-Agent Pathfinding to 3D Pipe Routing

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

    45249

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

    Lukas Chrpa,Pavel Rytir,Rostislav Horcik

    20-28

    PDF
  • Multi-Resolution A*

    Wei Du,Fahad Islam,Maxim Likhachev

    29-37

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

    Florian Geißer,David Speck,Thomas Keller

    38-47

    PDF
  • Embedding Directed Graphs in Potential Fields Using FastMap-D

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

    48-56

    PDF

Short Papers

  • Generalizing Multi-Agent Path Finding for Heterogeneous Agents

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

    101-105

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

    Jihee Han,Tansel Uras,Sven Koenig

    106-110

    PDF
  • Surrogate Assisted Optimisation for Travelling Thief Problems

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

    111-115

    PDF

Extended Abstracts

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

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

    141-142

    PDF
  • Computing Plan-Length Bounds Using Lengths of Longest Paths

    Mohammad Abdulaziz, Dominik Berger

    117-118

    PDF
  • Transition to eBuses with Minimal Timetable Disruptions

    Alejandro Arbelaez,Laura Climent

    119-120

    PDF
  • Multi-Directional Search

    Dor Atzmon,Jiaoyang Li,Ariel Felner,Eliran Nachmani,Shahaf Shperberg,Nathan Sturtevant,Sven Koenig

    121-122

    PDF
  • F-Cardinal Conflicts in Conflict-Based Search

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

    123-124

    PDF
  • A Simple and Fast Bi-Objective Search Algorithm

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

    125-126

    PDF
  • Heuristic AND/OR Search for Solving Influence Diagram

    Junkyu Lee,Radu Marinescu,Rina Dechter

    127-128

    PDF
  • 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

    PDF
  • Moving Agents in Formation in Congested Environments

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

    131-132

    PDF
  • Cooperative Path Planning for Heterogeneous Agents

    Keisuke Otaki,Satoshi Koide,Ayano Okoso,Tomoki Nishi

    133-134

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

    Patrick Rodler

    135-136

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

    Raad Salman,Fredrik Ekstedt,Peter Damaschke

    137-138

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

    Shawn Seiref,Tamir Jaffey,Margarita Lopatin,Ariel Felner

    139-140

    PDF

Primary Sidebar