Lim, Jaein, and Tsiotras, Panagiotis. CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding. Retrieved from https://par.nsf.gov/biblio/10653719. Artificial Intelligence 346.C Web. doi:10.1016/j.artint.2025.104349.

Lim, Jaein, & Tsiotras, Panagiotis. CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding. Artificial Intelligence, 346 (C). Retrieved from https://par.nsf.gov/biblio/10653719. https://doi.org/10.1016/j.artint.2025.104349

Lim, Jaein, and Tsiotras, Panagiotis. "CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding". Artificial Intelligence 346 (C). Country unknown/Code not available: www.elsevier.com/locate/artint. https://doi.org/10.1016/j.artint.2025.104349. https://par.nsf.gov/biblio/10653719.

@article{osti_10653719,
place = {Country unknown/Code not available}, title = {CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding}, url = {https://par.nsf.gov/biblio/10653719}, DOI = {10.1016/j.artint.2025.104349}, abstractNote = {Not Available}, journal = {Artificial Intelligence}, volume = {346}, number = {C}, publisher = {www.elsevier.com/locate/artint}, author = {Lim, Jaein and Tsiotras, Panagiotis}, }