Search

Search Results

• Avoiding Node Re-Expansions Can Break Symmetry Breaking

  Mark Carlson, Daniel Harabor, Peter J. Stuckey

  20-27

  2024-06-01

• Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees

  Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz

  28-36

  2024-06-01

• Introducing Delays in Multi Agent Path Finding

  Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian

  37-45

  2024-06-01

• Solving Facility Location Problems via FastMap and Locality Sensitive Hashing

  Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar

  46-54

  2024-06-01

• Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions

  Songtuan Lin, Daniel Höller, Pascal Bercher

  55-63

  2024-06-01

• Multi-Agent Path Execution with Uncertainty

  Yihao Liu, Xueyan Tang, Wentong Cai, Jingning Li

  64-72

  2024-06-01

• A Deterministic Search Approach for Solving Stochastic Drone Search and Rescue Planning Without Communications

  Evgeny Mishlyakov, Mikhail Gruntov, Alexander Shleyfman, Erez Karpas

  73-81

  2024-06-01

• Prioritised Planning with Guarantees

  Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern

  82-90

  2024-06-01

• Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms

  Sumedh Pendurkar, Levi H. S. Lelis, Nathan R. Sturtevant, Guni Sharon

  91-99

  2024-06-01

• Optimised Variants of Polynomial Compilation for Conditional Effects in Classical Planning

  Francesco Percassi, Enrico Scala, Alfonso Emilio Gerevini

  100-108

  2024-06-01

• Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality

  Yorai Shaoul, Rishi Veerapaneni, Maxim Likhachev, Jiaoyang Li

  109-117

  2024-06-01

• Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP

  Pouya Shati, Eldan Cohen, Sheila McIlraith

  118-126

  2024-06-01

• On the Properties of All-Pair Heuristics

  Shahaf Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant

  127-133

  2024-06-01

• ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem

  Yimin Tang, Sven Koenig, Jiaoyang Li

  134-142

  2024-06-01

• The Bench Transition System and Stochastic Exploration

  Dawson Tomasz, Richard Valenzano

  143-151

  2024-06-01

• Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search

  Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner

  152-160

  2024-06-01

• Real-time Safe Interval Path Planning

  Devin Wild Thomas, Wheeler Ruml, Solomon Eyal Shimony

  161-169

  2024-06-01

• Tunable Suboptimal Heuristic Search

  Stephen Wissow, Fanhao Yu, Wheeler Ruml

  170-178

  2024-06-01

• A-A*pex: Efficient Anytime Approximate Multi-Objective Search

  Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig

  179-187

  2024-06-01

• Bi-Criteria Diverse Plan Selection via Beam Search Approximation

  Shanhe Zhong, Pouya Shati, Eldan Cohen

  188-196

  2024-06-01

• Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning

  Clemens Büchner, Remo Christen, Salomé Eriksson, Thomas Keller

  198-202

  2024-06-01

• Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning

  Dillon Z. Chen, Sylvie Thiébaux

  203-207

  2024-06-01

• Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations

  Carlos Hernández Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman

  208-212

  2024-06-01

• Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning

  Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi

  213-217

  2024-06-01

• Optimal Unlabeled Pebble Motion on Trees

  Pierre Le Bodic, Edward Lam

  218-222

  2024-06-01