Cita APA (7a ed.)

Gammell, J., Barfoot, T., & Srinivasa, S. (2020). Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search. SAGE Publications.

Cita Chicago Style (17a ed.)

Gammell, JD, TD Barfoot, y SS Srinivasa. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.

Cita MLA (9a ed.)

Gammell, JD, et al. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.

Precaución: Estas citas no son 100% exactas.