Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Hierarchical Time-Optimal Planning for Multi-Vehicle Racing
by
Lohmann, Boris
, Jank, Georg
, Rowold, Matthias
in
Algorithms
/ Optimization
/ Racing
/ Time optimal control
2023
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Hierarchical Time-Optimal Planning for Multi-Vehicle Racing
by
Lohmann, Boris
, Jank, Georg
, Rowold, Matthias
in
Algorithms
/ Optimization
/ Racing
/ Time optimal control
2023
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Hierarchical Time-Optimal Planning for Multi-Vehicle Racing
Paper
Hierarchical Time-Optimal Planning for Multi-Vehicle Racing
2023
Request Book From Autostore
and Choose the Collection Method
Overview
This paper presents a hierarchical planning algorithm for racing with multiple opponents. The two-stage approach consists of a high-level behavioral planning step and a low-level optimization step. By combining discrete and continuous planning methods, our algorithm encourages global time optimality without being limited by coarse discretization. In the behavioral planning step, the fastest behavior is determined with a low-resolution spatio-temporal visibility graph. Based on the selected behavior, we calculate maneuver envelopes that are subsequently applied as constraints in a time-optimal control problem. The performance of our method is comparable to a parallel approach that selects the fastest trajectory from multiple optimizations with different behavior classes. However, our algorithm can be executed on a single core. This significantly reduces computational requirements, especially when multiple opponents are involved. Therefore, the proposed method is an efficient and practical solution for real-time multi-vehicle racing scenarios.
Publisher
Cornell University Library, arXiv.org
Subject
MBRLCatalogueRelatedBooks
Related Items
Related Items
This website uses cookies to ensure you get the best experience on our website.