We analyze the complexity of Conflict-Based Search by setting up a bivariate recurrence and estimating its asymptotic rate of growth using the methods of Pemantle and Wilson.
BibTeX
@inproceedings{GFS21,
title = {Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds},
author = {Ofir Gordon and Yuval Filmus and Oren Salzman},
booktitle = {SOCS'21},
year = {2021}
}
Papers
copy to clipboard
