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]
@inproceedings{Przybylski18-0,
title = {AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm},
author = {Maciej Przybylski},
year = {2018},
url = {https://aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/view/17767},
researchr = {https://researchr.org/publication/Przybylski18-0},
cites = {0},
citedby = {0},
pages = {494-499},
booktitle = {Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018},
editor = {Mathijs de Weerdt and Sven Koenig and Gabriele Röger and Matthijs T. J. Spaan},
publisher = {AAAI Press},
isbn = {978-1-57735-797-1},
}