Gammell, J., Barfoot, T., & Srinivasa, S. (2020). Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search. SAGE Publications.
Chicago-čujuhus (17. p.)Gammell, JD, TD Barfoot, juo SS Srinivasa. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
MLA-čujuhus (9. p.)Gammell, JD, et al. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
Muitte dárkkistit čujuhemiid riektatvuođa, ovdal go geavahat daid iežat deavsttas.