• 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. 15 No. 1 (2022): Fifteenth International Symposium on Combinatorial Search

Long Papers

  • Generalized Longest Path Problems

    Gal Dahan,Itay Tabib,Eyal Solomon Shimony,Ariel Felner

    56-64

    PDF
  • MA3: Model-Accuracy Aware Anytime Planning with Simulation Verification for Navigating Complex Terrains

    Manash Pratim Das,Damon M Conover,Sungmin Eum,Heesung Kwon,Maxim Likhachev

    65-73

    PDF
  • A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs

    Chao Gao,Jingwei Chen,Tong Mo,Tanvir Sajed,Shangling Jui,Min Qin,Laiyuan Gong,Wei Lu

    74-82

    PDF
  • When to Commit to an Action in Online Planning and Search

    Tianyi Gu,Wheeler Ruml,Shahaf S. Shperberg,Eyal Solomon Shimony,Erez Karpas

    83-90

    PDF
  • On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE*

    Kilian Hu,David Speck

    91-99

    PDF
  • On Producing Shortest Cost-Optimal Plans

    Michael Katz,Gabriele Röger,Malte Helmert

    100-108

    PDF
  • Optimal Search with Neural Networks: Challenges and Approaches

    Tianhua Li,Ruimin Chen,Borislav Mavrin,Nathan R. Sturtevant,Doron Nadav,Ariel Felner

    109-117

    PDF
  • Leveraging Experience in Lifelong Multi-Agent Pathfinding

    Nitzan Madar,Kiril Solovey,Oren Salzman

    118-126

    PDF
  • Heuristic Search for SSPs with Lexicographic Preferences over Multiple Costs

    Shuwa Miura,Kyle Hollins Wray,Shlomo Zilberstein

    127-135

    PDF
  • ePA*SE: Edge-Based Parallel A* for Slow Evaluations

    Shohin Mukherjee,Sandip Aine,Maxim Likhachev

    136-144

    PDF
  • The JPS Pathfinding System in 3D

    Thomas K. Nobes,Daniel Harabor,Michael Wybrow,Stuart D.C. Walsh

    145-152

    PDF
  • Trajectory Constraint Heuristics for Optimal Probabilistic Planning

    John R. Peterson,Anagha Kulkarni,Emil Keyder,Joseph Kim,Shlomo Zilberstein

    153-161

    PDF
  • Enhanced Multi-Objective A* Using Balanced Binary Search Trees

    Zhongqiang Ren,Richard Zhan,Sivakumar Rathinam,Maxim Likhachev,Howie Choset

    162-170

    PDF
  • Scaling-Up Generalized Planning as Heuristic Search with Landmarks

    Javier Segovia-Aguas,Sergio Jiménez Celorrio,Laura Sebastiá,Anders Jonsson

    171-179

    PDF
  • Additive Pattern Databases for Decoupled Search

    Silvan Sievers,Daniel Gnad,Álvaro Torralba

    180-189

    PDF
  • Which MAPF Model Works Best for Automated Warehousing?

    Sumanth Varambally,Jiaoyang Li,Sven Koenig

    190-198

    PDF
  • Anytime Approximate Bi-Objective Search

    Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig

    199-207

    PDF
  • Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding

    Shuyang Zhang,Jiaoyang Li,Taoan Huang,Sven Koenig,Bistra Dilkina

    208-216

    PDF
  • Weight Constrained Path Finding with Bidirectional A*

    Saman Ahmadi,Guido Tack,Daniel Harabor,Philip Kilby

    44967

    PDF
  • On Merging Agents in Multi-Agent Pathfinding Algorithms

    Eli Boyarski,Shao-Hung Chan,Dor Atzmon,Ariel Felner,Sven Koenig

    45249

    PDF
  • Iterative-Deepening Uniform-Cost Heuristic Search

    Zhaoxing Bu,Richard E. Korf

    20-28

    PDF
  • Portability and Explainability of Synthesized Formula-based Heuristics

    Vadim Bulitko,Shuwei Wang,Justin Stevens,Levi H. S. Lelis

    29-37

    PDF
  • Multi-Train Path Finding Revisited

    Zhe Chen,Jiaoyang Li,Daniel Harabor,Peter J. Stuckey,Sven Koenig

    38-46

    PDF
  • Effective Planning in Resource-Competition Problems by Task Decomposition

    Lukáš Chrpa,Pavel Rytíř,Andrii Nyporko,Rostislav Horčík,Stefan Edelkamp

    47-55

    PDF

Short Papers

  • Online Multi-Agent Path Finding: New Results

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

    229-233

    PDF
  • Light Contraction Hierarchies: Hierarchical Search Without Shortcuts

    Claudius Proissl

    234-238

    PDF
  • Bounded-Cost Bi-Objective Heuristic Search

    Shawn Skyler,Dor Atzmon,Ariel Felner,Oren Salzman,Han Zhang,Sven Koenig,William Yeoh,Carlos Hernández Ulloa

    239-243

    PDF
  • Meeting at the Border of Two Separate Domains

    Alexandru Paul Tabacaru,Dor Atzmon,Ariel Felner

    244-248

    PDF
  • Mutex Propagation in Multi-Agent Path Finding for Large Agents

    Han Zhang,Yutong Li,Jiaoyang Li,T. K. Satish Kumar,Sven Koenig

    249-253

    PDF
  • Benchmarks for Pathfinding Search: Iron Harvest

    Daniel Harabor,Ryan Hechenberger,Thomas Jahn

    218-222

    PDF
  • Neural Network Heuristic Functions: Taking Confidence into Account

    Daniel Heller,Patrick Ferber,Julian Bitterwolf,Matthias Hein,Jörg Hoffmann

    223-228

    PDF

Extended Abstracts

  • An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract)

    Elad Levy,Guy Shani,Roni Stern

    299-301

    PDF
  • Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract)

    Yaakov Livne,Dor Atzmon,Shawn Skyler,Eli Boyarski,Amir Shapiro,Ariel Felner

    302-304

    PDF
  • Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract)

    Andrew Murray,Michael Cashmore,Ashwin Arulselvan,Jeremy Frank

    305-307

    PDF
  • Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract)

    Stefan O'Toole,Miquel Ramirez,Nir Lipovetzky,Adrian R. Pearce

    308-310

    PDF
  • A Discussion on the Scalability of Heuristic Approximators (Extended Abstract)

    Sumedh Pendurkar,Taoan Huang,Sven Koenig,Guni Sharon

    311-313

    PDF
  • On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract)

    Francesco Percassi,Enrico Scala,Mauro Vallati

    314-316

    PDF
  • Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract)

    Pavel Surynek

    317-319

    PDF
  • Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract)

    Jiří Švancara,Philipp Obermeier,Matej Husár,Roman Barták,Torsten Schaub

    320-322

    PDF
  • Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)

    Devin Thomas,Tianyi Gu,Wheeler Ruml,Eyal Solomon Shimony

    323-325

    PDF
  • Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS (Extended Abstract)

    Rishi Veerapaneni,Tushar Kusnur,Maxim Likhachev

    326-328

    PDF
  • Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract)

    David Zahradka,Anton Andreychuk,Miroslav Kulich,Konstantin Yakovlev

    329-331

    PDF
  • Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract)

    Jorge A. Baier,Nicolás Rivera,Carlos Hernández Ulloa

    255-257

    PDF
  • Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract)

    Nikhil Chandak,Kenny Chour,Sivakumar Rathinam,R. Ravi

    258-260

    PDF
  • Local Motif Clustering via (Hyper)Graph Partitioning

    Adil Chhabra,Marcelo Fonseca Faraj,Christian Schulz

    261-263

    PDF
  • A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract)

    Vianney Coppé,Pierre Schaus

    264-266

    PDF
  • Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract)

    Ali Davoodi,Mark Wallace,Daniel Harabor

    267-269

    PDF
  • Lazy Compilation in Classical Planning (Extended Abstract)

    Zuzana Fílová,Pavel Surynek

    270-272

    PDF
  • Parallel Beam Search for Combinatorial Optimization (Extended Abstract)

    Nikolaus Frohner,Jan Gmys,Nouredine Melab,Günther R. Raidl,El-ghazali Talbi

    273-275

    PDF
  • On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract)

    Alfonso E. Gerevini,Nir Lipovetzky,Francesco Percassi,Alessandro Saetti,Ivan Serina

    276-278

    PDF
  • K-Focal Search for Slow Learned Heuristics (Extended Abstract)

    Matias Greco,Jorge Toro,Carlos Hernández-Ulloa,Jorge A. Baier

    279-281

    PDF
  • Focal Discrepancy Search for Learned Heuristics (Extended Abstract)

    Matias Greco,Pablo Araneda,Jorge A. Baier

    282-284

    PDF
  • Dual Euclidean Shortest Path Search (Extended Abstract)

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

    285-287

    PDF
  • IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract)

    Irene Hiess,Ludwig Kampel,Michael Wagner,Dimitris E. Simos

    288-290

    PDF
  • Urban Traffic Control via Planning with Global State Constraints (Extended Abstract)

    Franc Ivankovic,Mauro Vallati,Lukáš Chrpa,Marco Roveri

    291-293

    PDF
  • Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract)

    Kristýna Janovská,Pavel Surynek

    294-296

    PDF
  • A Jeep Crossing a Desert of Unknown Width (Extended Abstract)

    Richard E. Korf

    297-298

    PDF

Student Papers

  • Deep RRT*

    Xuzhe Dang,Lukáš Chrpa,Stefan Edelkamp

    333-335

    PDF
  • Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search

    Matias Greco,Jorge A. Baier

    336-338

    PDF
  • Beyond Markov Decision Process with Scalar Markovian Rewards

    Shuwa Miura

    339-340

    PDF

Primary Sidebar