Login / Signup
Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search.
Jonathan D. Gammell
Timothy D. Barfoot
Siddhartha S. Srinivasa
Published in:
Int. J. Robotics Res. (2020)
Keyphrases
</>
asymptotically optimal
asymptotic optimality
search algorithm
arrival rate
search space
heavy traffic
online algorithms
multi agent systems
lower bound
special case
service rates