AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm

Maciej Przybylski. AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm. In Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs T. J. Spaan, editors, Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018. pages 494-499, AAAI Press, 2018. [doi]

Abstract

Abstract is missing.