File Download

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.contributor.advisor Au, Tsz-Chiu -
dc.contributor.author NGUYEN TYVAN -
dc.date.accessioned 2024-01-25T13:31:43Z -
dc.date.available 2024-01-25T13:31:43Z -
dc.date.issued 2016-08 -
dc.description.abstract Intelligent transportation systems and autonomous vehicles can improve how we drive, save energy and avoid traffic accidents. However, we still need to make
more effort on the process of interdisciplinary research to turn these systems into reality. My work, aimed to contribute to this process, consists of two parts. In the first part, I address a longitudinal motion planning problem in
which a vehicle aims to arrive at a given position on a road segmented based on various driving conditions at a given time and velocity. I show that it is possible to fully describe the set of all reachable arrival configurations
using a table of closed-form equations, under a simplified model of vehicles with linear acceleration. Then I devise a sampling-based algorithm to solve this motion planning problem, using the table to check whether a feasible plan
exist. The simulation results showed that the proposed sampling-based algorithmwith heuristics has a higher probability of success than the simple random
sampling approach. After that, I will discuss how to use the feasible set on real vehicles. In this part, the task of planning on a segment is executed by using the bisection method, which utilizes the dynamics model of a vehicle.
This model, however, is not always available and empirically expensive to obtain. Therefore, in the second part, I focus on the problem of learning a vehicle dynamics model. I introduce an instance-based learning method to learn
a performance model automatically, and compare it with the artificial neural network and matrix factorization methods. Furthermore, an exploration strategy
called plan-based exploration, based on planning using the reference model is given to speed up the learning process. Our experimental results demonstrated
that the instance-based learning method coupled with the plan-based exploration strategy has the fastest learning rate.
-
dc.description.degree Master -
dc.description Department of Electrical and Computer Engineering -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/72083 -
dc.identifier.uri http://unist.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002300482 -
dc.language eng -
dc.publisher Ulsan National Institute of Science and Technology (UNIST) -
dc.rights.embargoReleaseTerms 9999-12-31 -
dc.title VEHICLE DYNAMICS MODELING AND MOTION PLANNING WITH PREDICTABLE TIMING AND VELOCITY -
dc.type Thesis -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.