Show simple item record

dc.contributor.authorKapania, Nitin R.
dc.contributor.authorSubosits, John
dc.contributor.authorChristian Gerdes, J.
dc.date.accessioned2017-05-09T01:27:11Z
dc.date.available2017-05-09T01:27:11Z
dc.date.issued2016
dc.identifier.issn0022-0434
dc.identifier.otherds_138_09_091011.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/160718
dc.description.abstractThe problem of maneuvering a vehicle through a race course in minimum time requires computation of both longitudinal (brake and throttle) and lateral (steering wheel) control inputs. Unfortunately, solving the resulting nonlinear optimal control problem is typically computationally expensive and infeasible for realtime trajectory planning. This paper presents an iterative algorithm that divides the path generation task into two sequential subproblems that are significantly easier to solve. Given an initial path through the race track, the algorithm runs a forward–backward integration scheme to determine the minimumtime longitudinal speed profile, subject to tire friction constraints. With this fixed speed profile, the algorithm updates the vehicle's path by solving a convex optimization problem that minimizes the resulting path curvature while staying within track boundaries and obeying affine, timevarying vehicle dynamics constraints. This twostep process is repeated iteratively until the predicted lap time no longer improves. While providing no guarantees of convergence or a globally optimal solution, the approach performs very well when validated on the Thunderhill Raceway course in Willows, CA. The predicted lap time converges after four to five iterations, with each iteration over the full 4.5 km race course requiring only 30 s of computation time on a laptop computer. The resulting trajectory is experimentally driven at the race circuit with an autonomous Audi TTS test vehicle, and the resulting lap time and racing line are comparable to both a nonlinear gradient descent solution and a trajectory recorded from a professional racecar driver. The experimental results indicate that the proposed method is a viable option for online trajectory planning in the near future.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleA Sequential Two Step Algorithm for Fast Generation of Vehicle Racing Trajectories
dc.typeJournal Paper
dc.journal.volume138
dc.journal.issue9
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.4033311
dc.journal.fristpage91005
dc.journal.lastpage91005
dc.identifier.eissn1528-9028
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2016:;volume( 138 ):;issue: 009
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record