liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Trajectory Planning for Autonomous Vehicles in Time Varying Environments Using Support Vector Machines
Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-0760-9815
Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-7349-1937
2018 (English)In: 2018 29TH IEEE INTELLIGENT VEHICLES SYMPOSIUM, IEEE , 2018, p. 109-114, China: IEEE conference proceedings, 2018Conference paper, Published paper (Refereed)
Abstract [en]

A novel trajectory planning method is proposedin time varying environments for highway driving scenarios.The main objective is to ensure computational efficiency in theapproach, while still ensuring collision avoidance with movingobstacles and respecting vehicle constraints such as comfortcriteria and roll-over limits. The trajectory planning problemis separated into finding a collision free corridor in space-time domain using a support vector machine (SVM), whichmeans solving a convex optimization problem. After that atime-monotonic path is found in the collision free corridor bysolving a simple search problem that can be solved efficiently.The resulting path in space-time domain corresponds to theresulting planned trajectory of the vehicle. The planner is adeterministic search method associated with a cost functionthat keeps the trajectory kinematically feasible and close to themaximum separating surface, given by the SVM. A kinematicmotion model is used to construct motion primitives in thespace-time domain representing the non-holonomic behavior ofthe vehicle and is used to ensure physical constraints on thestates of the vehicle such as acceleration, speed, jerk, steer andsteer rate. The speed limits include limitations by law and alsorollover speed limits. Two highway maneuvers have been usedas test scenarios to illustrate the performance of the proposedalgorithm.

Place, publisher, year, edition, pages
China: IEEE conference proceedings, 2018.
National Category
Control Engineering Robotics
Identifiers
URN: urn:nbn:se:liu:diva-173936DOI: 10.1109/IVS.2018.8500620ISI: 000719424500092Scopus ID: 2-s2.0-85056780710OAI: oai:DiVA.org:liu-173936DiVA, id: diva2:1536360
Conference
Intelligent Vehicles Symposium
Available from: 2021-03-10 Created: 2021-03-10 Last updated: 2024-02-01Bibliographically approved
In thesis
1. Trajectory Planning for an Autonomous Vehicle in Multi-Vehicle Traffic Scenarios
Open this publication in new window or tab >>Trajectory Planning for an Autonomous Vehicle in Multi-Vehicle Traffic Scenarios
2021 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Tremendous industrial and academic progress and investments have been made in au-tonomous driving, but still many aspects are unknown and require further investigation,development and testing. A key part of an autonomous driving system is an efficient plan-ning algorithm with potential to reduce accidents, or even unpleasant and stressful drivingexperience. A higher degree of automated planning also makes it possible to have a betterenergy management strategy with improved performance through analysis of surroundingenvironment of autonomous vehicles and taking action in a timely manner.

This thesis deals with planning of autonomous vehicles in different urban scenarios, road,and vehicle conditions. The main concerns in designing the planning algorithms, are realtime capability, safety and comfort. The planning algorithms developed in this thesis aretested in simulation traffic situations with multiple moving vehicles as obstacles. The re-search conducted in this thesis falls mainly into two parts, the first part investigates decou-pled trajectory planning algorithms with a focus on speed planning, and the second sectionexplores different coupled planning algorithms in spatiotemporal environments where pathand speed are calculated simultaneously. Additionally, a behavioral analysis is carried outto evaluate different tactical maneuvers the autonomous vehicle can have considering theinitial states of the ego and surrounding vehicles.

Particularly relevant for heavy duty vehicles, the issues addressed in designing a safe speedplanner in the first part are road conditions such as banking, friction, road curvature andvehicle characteristics. The vehicle constraints on acceleration, jerk, steering, steer ratelimitations and other safety limitations such as rollover are further considerations in speedplanning algorithms. For real time purposes, a minimum working roll model is identified us-ing roll angle and lateral acceleration data collected in a heavy duty truck. In the decoupledplanners, collision avoiding is treated using a search and optimization based planner.

In an autonomous vehicle, the structure of the road network is known to the vehicle throughmapping applications. Therefore, this key property can be used in planning algorithms toincrease efficiency. The second part of the thesis, is focused on handling moving obstaclesin a spatiotemporal environment and collision-free planning in complex urban structures.Spatiotemporal planning holds the benefits of exhaustive search and has advantages com-pared to decoupled planning, but the search space in spatiotemporal planning is complex.Support vector machine is used to simplify the search problem to make it more efficient.A SVM classifies the surrounding obstacles into two categories and efficiently calculate anobstacle free region for the ego vehicle. The formulation achieved by solving SVM, con-tains information about the initial point, destination, stationary and moving obstacles.These features, combined with smoothness property of the Gaussian kernel used in SVMformulation is proven to be able to solve complex planning missions in a safe way.

Here, three algorithms are developed by taking advantages of SVM formulation, a greedysearch algorithm, an A* lattice based planner and a geometrical based planner. One general property used in all three algorithms is reduced search space through using SVM. In A*lattice based planner, significant improvement in calculation time, is achieved by using theinformation from SVM formulation to calculate a heuristic for planning. Using this heuristic,the planning algorithm treats a simple driving scenario and a complex urban structureequal, as the structure of the road network is included in SVM solution. Inspired byobserving significant improvements in calculation time using SVM heuristic and combiningthe collision information from SVM surfaces and smoothness property, a geometrical planneris proposed that leads to further improvements in calculation time.

Realistic driving scenarios such as roundabouts, intersections and takeover maneuvers areused, to test the performance of the proposed algorithms in simulation. Different roadconditions with large banking, low friction and high curvature, and vehicles prone to safetyissues, specially rollover, are evaluated to calculate the speed profile limits. The trajectoriesachieved by the proposed algorithms are compared to profiles calculated by optimal controlsolutions.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2021. p. 25
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2126
National Category
Robotics
Identifiers
urn:nbn:se:liu:diva-173940 (URN)10.3384/diss.diva-173940 (DOI)9789179296933 (ISBN)
Public defence
2021-04-28, Online through Zoom (contact maria.hamner@liu.se) and Ada Lovelace, B Building, Campus Valla, Linköping, 14:30 (English)
Opponent
Supervisors
Note

The title on the cover is incorrect. A corrected cover page can be downloaded separately. 

Available from: 2021-03-25 Created: 2021-03-10 Last updated: 2021-12-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Morsali, MahdiÅslund, JanFrisk, Erik

Search in DiVA

By author/editor
Morsali, MahdiÅslund, JanFrisk, Erik
By organisation
Vehicular SystemsFaculty of Science & Engineering
Control EngineeringRobotics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 271 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf