Gammell, J., Barfoot, T., & Srinivasa, S. (2020). Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search. SAGE Publications.
Chicago (17e ed.) BronvermeldingGammell, JD, TD Barfoot, en SS Srinivasa. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
MLA (9e ed.) BronvermeldingGammell, JD, et al. Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search. SAGE Publications, 2020.
Let op: Deze citaties zijn niet altijd 100% accuraat.