Search

Search Results

• Multi-Train Path Finding Revisited

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

  38-46

  2022-07-17

• Effective Planning in Resource-Competition Problems by Task Decomposition

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

  47-55

  2022-07-17

• Generalized Longest Path Problems

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

  56-64

  2022-07-17

• 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

  2022-07-17

• 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

  2022-07-17

• 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

  2022-07-17

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

  Kilian Hu, David Speck

  91-99

  2022-07-17

• On Producing Shortest Cost-Optimal Plans

  Michael Katz, Gabriele Röger, Malte Helmert

  100-108

  2022-07-17

• Optimal Search with Neural Networks: Challenges and Approaches

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

  109-117

  2022-07-17

• Leveraging Experience in Lifelong Multi-Agent Pathfinding

  Nitzan Madar, Kiril Solovey, Oren Salzman

  118-126

  2022-07-17

• Heuristic Search for SSPs with Lexicographic Preferences over Multiple Costs

  Shuwa Miura, Kyle Hollins Wray, Shlomo Zilberstein

  127-135

  2022-07-17

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

  Shohin Mukherjee, Sandip Aine, Maxim Likhachev

  136-144

  2022-07-17

• The JPS Pathfinding System in 3D

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

  145-152

  2022-07-17

• Trajectory Constraint Heuristics for Optimal Probabilistic Planning

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

  153-161

  2022-07-17

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

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

  162-170

  2022-07-17

• Scaling-Up Generalized Planning as Heuristic Search with Landmarks

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

  171-179

  2022-07-17

• Additive Pattern Databases for Decoupled Search

  Silvan Sievers, Daniel Gnad, Álvaro Torralba

  180-189

  2022-07-17

• Which MAPF Model Works Best for Automated Warehousing?

  Sumanth Varambally, Jiaoyang Li, Sven Koenig

  190-198

  2022-07-17

• Anytime Approximate Bi-Objective Search

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

  199-207

  2022-07-17

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

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

  208-216

  2022-07-17

• Benchmarks for Pathfinding Search: Iron Harvest

  Daniel Harabor, Ryan Hechenberger, Thomas Jahn

  218-222

  2022-07-17

• Neural Network Heuristic Functions: Taking Confidence into Account

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

  223-228

  2022-07-17

• Online Multi-Agent Path Finding: New Results

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

  229-233

  2022-07-17

• Light Contraction Hierarchies: Hierarchical Search Without Shortcuts

  Claudius Proissl

  234-238

  2022-07-17

• 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

  2022-07-17