Gammell, J., Barfoot, T., & Srinivasa, S. (2020). Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search. SAGE Publications.
Chicagoスタイル(17版)引用形式Gammell, JD, TD Barfoot, , SS Srinivasa. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
MLA(9版)引用形式Gammell, JD, et al. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
警告: この引用は必ずしも正確ではありません.