• 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. 12 No. 1 (2021): Fourteenth International Symposium on Combinatorial Search

Long Papers

  • Exploiting Learned Policies in Focal Search

    Pablo Araneda,Matias Greco,Jorge A. Baier

    44967

    PDF
  • A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers

    Roberto Asín Achá,Rodrigo López,Sebastián Hagedorn,Jorge A. Baier

    45249

    PDF
  • Scaling Up Search with Partial Initial States in Optimization Crosswords

    Adi Botea,Vadim Bulitko

    20-27

    PDF
  • Counting Vertex-Disjoint Shortest Paths in Graphs

    Adi Botea,Massimiliano Mattetti,Akihiro Kishimoto,Radu Marinescu,Elizabeth Daly

    28-36

    PDF
  • Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information

    Ishani Chatterjee,Tushar Kusnur,Maxim Likhachev

    37-45

    PDF
  • Generalized Conflict-Directed Search for Optimal Ordering Problems

    Jingkai Chen,Yuening Zhang,Cheng Fang,Brian C. Williams

    46-54

    PDF
  • A Measure of Quality for IDA* Heuristics

    Robert K. P. Clausecker,Florian Schintke

    55-63

    PDF
  • Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds

    Ofir Gordon,Yuval Filmus,Oren Salzman

    64-72

    PDF
  • Finding the Exact Diameter of a Graph with Partial Breadth-First Searches

    Richard E. Korf

    73-78

    PDF
  • Customised Shortest Paths Using a Distributed Reverse Oracle

    Arthur Mahéo,Shizhe Zhao,Afzaal Hassan,Daniel D. Harabor,Peter J. Stuckey,Mark Wallace

    79-87

    PDF
  • Learning-Based Synthesis of Social Laws in STRIPS

    Ronen Nir,Alexander Shleyfman,Erez Karpas

    88-96

    PDF
  • SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems

    Joel Oren,Chana Ross,Maksym Lefarov,Felix Richter,Ayal Taitler,Zohar Feldman,Dotan Di Castro,Christian Daniel

    97-105

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

    Tamir Yaffe,Shawn Skyler,Ariel Felner

    106-114

    PDF

Short Papers

  • On the Benefits of Randomly Adjusting Anytime Weighted A*

    Abhinav Bhatia,Justin Svegliato,Shlomo Zilberstein

    116-120

    PDF
  • The Closed List Is an Obstacle Too

    Ariel Felner,Shahaf S. Shperberg,Hadar Buzhish

    121-125

    PDF
  • Experimental Evaluation of Classical Multi Agent Path Finding Algorithms

    Omri Kaduri,Eli Boyarski,Roni Stern

    126-130

    PDF
  • Pattern Databases for Stochastic Shortest Path Problems

    Thorsten Klößner,Jörg Hoffmann

    131-135

    PDF
  • Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning

    Tomas Rybecky,Miroslav Kulich,Anton Andreychuk,Konstantin Yakovlev

    136-140

    PDF

Extended Abstracts

  • Conceptual Comparison of Compilation-Based Solvers for Multi-Agent Path Finding: MIP vs. SAT

    Pavel Surynek

    203-205

    PDF
  • Multi-Agent Pickup and Delivery with Task Deadlines

    Xiaohu Wu,Yihao Liu,Xueyan Tang,Wentong Cai,Funing Bai,Gilbert Khonstantine,Guopeng Zhao

    206-208

    PDF
  • A Hierarchical Approach to Multi-Agent Path Finding

    Han Zhang,Mingze Yao,Ziang Liu,Jiaoyang Li,Lucas Terr,Shao-Hung Chan,T. K. Satish Kumar,Sven Koenig

    209-211

    PDF
  • Improving Continuous-Time Conflict Based Search

    Anton Andreychuk, Konstantin Yakovlev, Eli Boyarski, Roni Stern

    145-146

    PDF
  • Conflict-Free Multi-Agent Meeting

    Dor Atzmon,Shahar Idan Freiman,Oscar Epshtein,Oran Shichman,Ariel Felner

    147-149

    PDF
  • From Classical to Colored Multi-Agent Path Finding

    Roman Barták,Marika Ivanová,Jiří Švancara

    150-152

    PDF
  • DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies

    Martin Čapek,Pavel Surynek

    153-155

    PDF
  • A Planning-Based Approach for In-Station Train Dispatching

    Matteo Cardellini,Marco Maratea,Mauro Vallati,Gianluca Boleto,Luca Oneto

    156-158

    PDF
  • ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding

    Shao-Hung Chan,Jiaoyang Li,Graeme Gange,Daniel Harabor,Peter J. Stuckey,Sven Koenig

    159-161

    PDF
  • Avoiding Re-Expansions in Suboptimal Best-First Search

    Jingwei Chen,Nathan R. Sturtevant

    162-163

    PDF
  • Adversary Strategy Sampling for Effective Plan Generation

    Lukáš Chrpa,Pavel Rytíř,Rostislav Horčík,Jan Čuhel,Anastasiia Livochka,Stefan Edelkamp

    164-166

    PDF
  • Metareasoning for Interleaved Planning and Execution

    Amihay Elboher,Shahaf S. Shperberg,Solomon E. Shimony

    167-169

    PDF
  • Learning Pseudo-Backdoors for Mixed Integer Programs

    Aaron Ferber,Jialin Song,Bistra Dilkina,Yisong Yue

    170-172

    PDF
  • Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance

    Nir Greshler,Ofir Gordon,Oren Salzman,Nahum Shimkin

    173-175

    PDF
  • Multi-Target Search in Euclidean Space with Ray Shooting

    Ryan Hechenberger,Daniel D. Harabor,Muhammad Aamir Cheema,Peter J. Stuckey,Pierre Le Bodic

    176-178

    PDF
  • Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge

    Jiaoyang Li,Zhe Chen,Yi Zheng,Shao-Hung Chan,Daniel Harabor,Peter J. Stuckey,Hang Ma,Sven Koenig

    179-181

    PDF
  • Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding

    Hang Ma

    182-184

    PDF
  • Contingent Planning for Robust Multi-Agent Path Finding

    Michal Nekvinda,Roman Barták,Meir Kalech

    185-187

    PDF
  • Linear-Space Best-First Diagnosis Search

    Patrick Rodler

    188-190

    PDF
  • Solving Sokoban with Forward-Backward Reinforcement Learning

    Yaron Shoham,Gal Elidan

    191-193

    PDF
  • Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory

    Shahaf S. Shperberg,Steven Danishevski,Ariel Felner,Nathan R. Sturtevant

    194-196

    PDF
  • Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering

    Pavel Surynek

    197-199

    PDF
  • Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories

    Pavel Surynek

    200-202

    PDF
  • Bi-Objective Search with Bi-directional A* (Extended Abstract)

    Saman Ahmadi,Guido Tack,Daniel D. Harabor,Philip Kilby

    142-144

    PDF

Student Papers

  • Further Improved Heuristics For Conflict-Based Search

    Eli Boyarski,Ariel Felner,Pierre Le Bodic,Daniel D. Harabor,Peter J. Stuckey,Sven Koenig

    213-215

    PDF
  • How to Speed-Up the Automated Configuration of Optimization Algorithms

    Marcelo de Souza

    216-218

    PDF
  • Exploiting Learned Policies and Learned Heuristics in Bounded-Suboptimal Search

    Matias Greco

    219-221

    PDF
  • Distributional Metareasoning for Heuristic Search

    Tianyi Gu

    222-224

    PDF
  • Avoiding Monochromatic Rectangles Using Shift Patterns

    Zhenjun Liu,Leroy Chew,Marijn J. H. Heule

    225-227

    PDF
  • Studying Online Multi-Agent Path Finding

    Jonathan Morag,Roni Stern,Ariel Felner,Dor Atzmon,Eli Boyarski

    228-230

    PDF
  • Explainable Problem in clingo-dl Programs

    Van Nguyen,Tran Cao Son,William Yeoh

    231-232

    PDF
  • Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar

    Sergio Poo Hernandez,Vadim Bulitko

    233-235

    PDF
  • Meta-Level Techniques for Planning, Search, and Scheduling

    Shahaf S. Shperberg

    236-238

    PDF
  • Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation

    David Vainshtain,Oren Salzman

    239-241

    PDF
  • Landmark Heuristics for Lifted Planning – Extended Abstract

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

    242-244

    PDF

Primary Sidebar