Driving Time Trial Laps using Neuroevolution

Examensarbete för kandidatexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/245173
Download file(s):
File Description SizeFormat 
245173.pdfFulltext1.44 MBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAlpsten, Gabriel
dc.contributor.authorEineving, Daniel
dc.contributor.authorNilsson, Martin
dc.contributor.authorPetersson, Simon
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.description.abstractDriving a race car competitively is a complex task. Programming a computer capable of solving this task optimally in every scenario is also difficult. Therefore it is interesting to investigate how well a machine learning algorithm is able to learn the most important behaviours from first principles. A simulator with simplified physics is utilised to train and assess the performance of the system. An algorithm called Neuroevolution of Augmenting Topologies (NEAT) was used to train artificial neural networks. When the system steered a car which travelled at a constant speed, NEAT managed to find a reasonably effective behaviour that resembles professional racing tactics such as positioning and distance optimisation. However, when the system was used to both control the steering and the speed of the car, it drove cautiously and resembled professional tactics less. More efficient behaviours were found when the system was trained on shorter tracks. Additionally, a system that was trained on one track showed a considerable improvement in training times when migrated to a new track. Some limitations of NEAT are discussed. The algorithm progresses gradually by a series of small improvements. It is observed that NEAT performs poorly when a composition of behaviours must be implemented simultaneously in order for the algorithm to progress. It is therefore advantageous if the problem is modelled to allow the algorithm to progress in gradual steps.
dc.subjectInformations- och kommunikationsteknik
dc.subjectData- och informationsvetenskap
dc.subjectInformation & Communication Technology
dc.subjectComputer and Information Science
dc.titleDriving Time Trial Laps using Neuroevolution
dc.type.degreeExamensarbete för kandidatexamensv
dc.type.degreeBachelor Thesisen
Collection:Examensarbeten för kandidatexamen // Bachelor Theses

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