Arthur Queffelec, Ocan Sankur, François Schwarzentruber. Complexity of planning for connected agents in a partially known environment. Theoretical Computer Science, 941:202-220, 2023. [doi]
@article{QueffelecSS23,
title = {Complexity of planning for connected agents in a partially known environment},
author = {Arthur Queffelec and Ocan Sankur and François Schwarzentruber},
year = {2023},
doi = {10.1016/j.tcs.2022.11.015},
url = {https://doi.org/10.1016/j.tcs.2022.11.015},
researchr = {https://researchr.org/publication/QueffelecSS23},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {941},
pages = {202-220},
}