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...

Celý popis

Podrobná bibliografie
Hlavní autoři: Gammell, JD, Barfoot, TD, Srinivasa, SS
Médium: Journal article
Jazyk:English
Vydáno: SAGE Publications 2020