APA引文

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

Chicago Style (17th ed.) Citation

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

MLA引文

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