Zeng Zhaoyang, Hu Bowen, Chang Yufang. Optimal rapidly-exploring random tree via discrete hierarchical exploration. // Journal of King Saud University Computer and Information Sciences. – 2025. – DOI: 10.1007/s44443-025-00211-2. – URL: https://doi.org/10.1007/s44443-025-00211-2
Zeng Zhaoyang, Hu Bowen, & Chang Yufang (2025). Optimal rapidly-exploring random tree via discrete hierarchical exploration. Journal of King Saud University Computer and Information Sciences. https://doi.org/10.1007/s44443-025-00211-2
Zeng Zhaoyang, et al. “Optimal rapidly-exploring random tree via discrete hierarchical exploration.” Journal of King Saud University Computer and Information Sciences, 2025. doi:10.1007/s44443-025-00211-2.
@article{Zhaoyang2025,
title = {Optimal rapidly-exploring random tree via discrete hierarchical exploration},
author = {Zhaoyang, Zeng and Bowen, Hu and Yufang, Chang},
journal = {Journal of King Saud University Computer and Information Sciences},
year = {2025},
doi = {10.1007/s44443-025-00211-2},
url = {https://doi.org/10.1007/s44443-025-00211-2}
}