Accepted Papers

Proceeding of SoCS 2023 are published by AAAI Press as Vol. 16 No. 1: Sixteenth International Symposium on Combinatorial Search (ISBN-10 1-57735-882-1, ISBN-13 978-1-57735-882-4). Acceepted papers are available here.

• A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations
  Hanlan Yang, Shohin Mukherjee and Maxim Likhachev

• Using machine learning classifiers in SAT branching
  Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan and Gregory Provan

• GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations
  Shohin Mukherjee and Maxim Likhachev

• Adapting to Planning Failures in Lifelong Multi-Agent Path Finding
  Jonathan Morag, Roni Stern and Ariel Felner

• A Fast Rescheduling Algorithm for Real-time Multi-robot Coordination
  Adittyo Paul, Ying Feng and Jiaoyang Li. 

• Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding
  Shao-Hung Chan, Roni Stern, Ariel Felner and Sven Koenig

• On the Notion of Fixability of PDDL+ Plans
  Francesco Percassi, Enrico Scala and Mauro Vallati

• On K* Search for Top-k Planning
  Junkyu Lee, Michael Katz and Shirin Sohrabi

• Towards an Effective Framework Combining Planning and Scheduling
  Andrii Nyporko and Lukáš Chrpa

• Real-world Pickup and Delivery Problem with Transfers
  Václav Sobotka and Hana Rudová

• A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements
  Conny Olz and Pascal Bercher

• Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding
  Zhongqiang Ren, Sivakumar Rathinam and Howie Choset

• Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+
  Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern and Shiwali Mohan

• Efficient Multi Agent Path Finding with Turn Actions
  Yue Zhang, Daniel Harabor, Pierre Le Bodic and Peter J. Stuckey

• Multi-agent Pathfinding With Predefined Paths: To Wait, or Not to Wait, That is the Question
  Jiří Švancara, Etienne Tignon, Roman Barták, Torsten Schaub, Philipp Wanko and Roland Kaminski

• Novelty and Lifted Helpful Actions in Generalized Planning
  Chao Lei, Nir Lipovetzky and Krista A. Ehinger

• Generating SAS+ Planning Tasks of Specified Causal Structure
  Michael Katz, Junkyu Lee and Shirin Sohrabi

• Must-Expand Nodes in Multi-Objective Search
  Shawn Skyler, Shahaf Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Keonig, William Yeoh and Carlos Hernández Ulloa. 

• Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search
  Takumi Shimoda and Alex Fukunaga

• SAT feature analysis for machine learning classification tasks
  Marco Dalla, Benjamin Provan-Bessell, Andrea Visentin and Barry O'Sullivan

• Terraforming – Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery
  David Vainshtein, Yaakov Sherma, Kiril Solovey and Oren Salzman

• Towards Effective Multi-valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics
  Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa and Sven Koenig

• Comparing Front-to-front and Front-to-end Heuristics in Bidirectional Search
  Lior Siag, Shahaf Shperberg, Ariel Felner and Nathan Sturtevant

• Improvements to CPCES
  Xiaodi Zhang and Alban Grastien

• Core Expansion in Optimization Crosswords
  Adi Botea and Vadim Bulitko

• K∗ and Partial Order Reduction for Top-quality Planning
  Michael Katz and Junkyu Lee

• Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
  Tzvika Geft

• Reducing Redundant Work in Jump Point Search
  Shizhe Zhao, Daniel Harabor and Peter J. Stuckey

• Voxel Benchmarks for 3D Pathfinding
  Thomas Nobes, Daniel Harabor, Michael Wybrow and Stuart Walsh