Monte-Carlo Tree Search in Continuous Action Spaces for Autonomous Racing: F1-tenth
2020 (English) Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE credits
Student thesis
Abstract [en]
Autonomous cars involve problems with control and planning. In thispaper, we implement and evaluate an autonomous agent based ona Monte-Carlo Tree Search in continuous action space. To facilitatethe algorithm, we extend an existing simulation framework and usea GPU for faster calculations. We compare three action generatorsand two rewards functions. The results show that MCTS convergesto an effective driving agent in static environments. However, it onlysucceeds at driving slow speeds in real-time. We discuss the problemsthat arise in dynamic and static environments and look to future workin improving the simulation tool and the MCTS algorithm. See code, https://github.com/felrock/PyRacecarSimulator
Place, publisher, year, edition, pages 2020.
Keywords [en]
mcts monte-carlo tree search ai machine learning regression neural network autonoumous vehicle f1tenth computer science master
National Category
Computer Engineering
Identifiers URN: urn:nbn:se:hh:diva-42442 OAI: oai:DiVA.org:hh-42442 DiVA, id: diva2:1441410
Subject / course Computer science and engineering
Educational program Computer Science and Engineering, 300 credits
Presentation
2020-05-28, Halmstad, 09:00 (English)
Supervisors
Examiners
2020-06-232020-06-162020-06-23 Bibliographically approved