Gammell, J., Barfoot, T., & Srinivasa, S. (2020). Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search. SAGE Publications.
Citación estilo ChicagoGammell, JD, TD Barfoot, and SS Srinivasa. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
Cita MLAGammell, JD, et al. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
Warning: These citations may not always be 100% accurate.