Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search

Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular approximations include graphs and random samples, as used by i...

Descripción completa

Detalles Bibliográficos
Autores principales: Gammell, JD, Barfoot, TD, Srinivasa, SS
Formato: Journal article
Lenguaje:English
Publicado: SAGE Publications 2020

Ejemplares similares