Search

Search Results

• Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)

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

  323-325

  2022-07-17

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

  Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev

  326-328

  2022-07-17

• 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

  2022-07-17

• Deep RRT*

  Xuzhe Dang, Lukáš Chrpa, Stefan Edelkamp

  333-335

  2022-07-17

• Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search

  Matias Greco, Jorge A. Baier

  336-338

  2022-07-17

• Beyond Markov Decision Process with Scalar Markovian Rewards

  Shuwa Miura

  339-340

  2022-07-17

• Core Expansion in Optimization Crosswords

  Adi Botea, Vadim Bulitko

  2-10

  2023-07-02

• Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding

  Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig

  11-19

  2023-07-02

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

  Tzvika Geft

  20-28

  2023-07-02

• Generating SAS+ Planning Tasks of Specified Causal Structure

  Michael Katz, Junkyu Lee, Shirin Sohrabi

  29-37

  2023-07-02

• On K* Search for Top-K Planning

  Junkyu Lee, Michael Katz, Shirin Sohrabi

  38-46

  2023-07-02

• Adapting to Planning Failures in Lifelong Multi-Agent Path Finding

  Jonathan Morag, Roni Stern, Ariel Felner

  47-55

  2023-07-02

• Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants

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

  56-64

  2023-07-02

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

  Conny Olz, Pascal Bercher

  65-73

  2023-07-02

• Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search

  Takumi Shimoda, Alex Fukunaga

  74-82

  2023-07-02

• Real-World Pickup and Delivery Problem with Transfers

  Václav Sobotka, Hana Rudová

  83-91

  2023-07-02

• Terraforming – Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery

  David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman

  92-100

  2023-07-02

• 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, Sven Koenig

  101-109

  2023-07-02

• Improvements to CPCES

  Xiaodi Zhang, Alban Grastien

  110-118

  2023-07-02

• Efficient Multi Agent Path Finding with Turn Actions

  Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey

  119-127

  2023-07-02

• Reducing Redundant Work in Jump Point Search

  Shizhe Zhao, Daniel Harabor, Peter J. Stuckey

  128-136

  2023-07-02

• SAT Feature Analysis for Machine Learning Classification Tasks

  Marco Dalla, Benjamin Provan-Bessell, Andrea Visentin, Barry O'Sullivan

  138-142

  2023-07-02

• K∗ and Partial Order Reduction for Top-Quality Planning

  Michael Katz, Junkyu Lee

  143-147

  2023-07-02

• Novelty and Lifted Helpful Actions in Generalized Planning

  Chao Lei, Nir Lipovetzky, Krista A. Ehinger

  148-152

  2023-07-02

• GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations

  Shohin Mukherjee, Maxim Likhachev

  153-157

  2023-07-02