YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    A Sequential Two Step Algorithm for Fast Generation of Vehicle Racing Trajectories

    Source: Journal of Dynamic Systems, Measurement, and Control:;2016:;volume( 138 ):;issue: 009::page 91005
    Author:
    Kapania, Nitin R.
    ,
    Subosits, John
    ,
    Christian Gerdes, J.
    DOI: 10.1115/1.4033311
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: The 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.
    • Download: (1.962Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Statistics

      A Sequential Two Step Algorithm for Fast Generation of Vehicle Racing Trajectories

    URI
    https://yetl.yabesh.ir/yetl1/handle/yetl/160718
    Collections
    • Journal of Dynamic Systems, Measurement, and Control

    Show full item record

    contributor authorKapania, Nitin R.
    contributor authorSubosits, John
    contributor authorChristian Gerdes, J.
    date accessioned2017-05-09T01:27:11Z
    date available2017-05-09T01:27:11Z
    date issued2016
    identifier issn0022-0434
    identifier otherds_138_09_091011.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/160718
    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.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleA Sequential Two Step Algorithm for Fast Generation of Vehicle Racing Trajectories
    typeJournal Paper
    journal volume138
    journal issue9
    journal titleJournal of Dynamic Systems, Measurement, and Control
    identifier doi10.1115/1.4033311
    journal fristpage91005
    journal lastpage91005
    identifier eissn1528-9028
    treeJournal of Dynamic Systems, Measurement, and Control:;2016:;volume( 138 ):;issue: 009
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian