Search

Search Results

• Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds

  Ofir Gordon, Yuval Filmus, Oren Salzman

  64-72

  2021-07-21

• Finding the Exact Diameter of a Graph with Partial Breadth-First Searches

  Richard E. Korf

  73-78

  2021-07-21

• Customised Shortest Paths Using a Distributed Reverse Oracle

  Arthur Mahéo, Shizhe Zhao, Afzaal Hassan, Daniel D. Harabor, Peter J. Stuckey, Mark Wallace

  79-87

  2021-07-21

• Learning-Based Synthesis of Social Laws in STRIPS

  Ronen Nir, Alexander Shleyfman, Erez Karpas

  88-96

  2021-07-22

• SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems

  Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro, Christian Daniel

  97-105

  2021-07-21

• Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search

  Tamir Yaffe, Shawn Skyler, Ariel Felner

  106-114

  2021-07-21

• On the Benefits of Randomly Adjusting Anytime Weighted A*

  Abhinav Bhatia, Justin Svegliato, Shlomo Zilberstein

  116-120

  2021-07-21

• The Closed List Is an Obstacle Too

  Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish

  121-125

  2021-07-22

• Experimental Evaluation of Classical Multi Agent Path Finding Algorithms

  Omri Kaduri, Eli Boyarski, Roni Stern

  126-130

  2021-07-21

• Pattern Databases for Stochastic Shortest Path Problems

  Thorsten Klößner, Jörg Hoffmann

  131-135

  2021-07-21

• Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning

  Tomas Rybecky, Miroslav Kulich, Anton Andreychuk, Konstantin Yakovlev

  136-140

  2021-07-21

• Bi-Objective Search with Bi-directional A* (Extended Abstract)

  Saman Ahmadi, Guido Tack, Daniel D. Harabor, Philip Kilby

  142-144

  2021-07-22

• Improving Continuous-Time Conflict Based Search

  Anton Andreychuk, Konstantin Yakovlev, Eli Boyarski, Roni Stern

  145-146

  2021-07-22

• Conflict-Free Multi-Agent Meeting

  Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner

  147-149

  2021-07-21

• From Classical to Colored Multi-Agent Path Finding

  Roman Barták, Marika Ivanová, Jiří Švancara

  150-152

  2021-07-21

• DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies

  Martin Čapek, Pavel Surynek

  153-155

  2021-07-21

• A Planning-Based Approach for In-Station Train Dispatching

  Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto

  156-158

  2021-07-22

• ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding

  Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig

  159-161

  2021-07-21

• Avoiding Re-Expansions in Suboptimal Best-First Search

  Jingwei Chen, Nathan R. Sturtevant

  162-163

  2021-07-22

• Adversary Strategy Sampling for Effective Plan Generation

  Lukáš Chrpa, Pavel Rytíř, Rostislav Horčík, Jan Čuhel, Anastasiia Livochka, Stefan Edelkamp

  164-166

  2021-07-21

• Metareasoning for Interleaved Planning and Execution

  Amihay Elboher, Shahaf S. Shperberg, Solomon E. Shimony

  167-169

  2021-07-21

• Learning Pseudo-Backdoors for Mixed Integer Programs

  Aaron Ferber, Jialin Song, Bistra Dilkina, Yisong Yue

  170-172

  2021-07-21

• Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance

  Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin

  173-175

  2021-07-21

• Multi-Target Search in Euclidean Space with Ray Shooting

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

  176-178

  2021-07-21

• Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge

  Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig

  179-181

  2021-07-21