ITSC 2024 Paper Abstract

Close

Paper FrBT3.6

Hoshino, Hikaru (University of Hyogo), Li, Jiaxing (Carnegie Mellon University), Menon, Arnav (Carnegie Mellon University), Dolan, John (Carnegie Mellon University), nakahira, yorie (CMU)

Autonomous Drifting Based on Maximal Safety Probability Learning

Scheduled for presentation during the Regular Session "Autonomous driving" (FrBT3), Friday, September 27, 2024, 15:10−15:30, Salon 6

2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC), September 24- 27, 2024, Edmonton, Canada

This information is tentative and subject to change. Compiled on October 8, 2024

Keywords Automated Vehicle Operation, Motion Planning, Navigation, Theory and Models for Optimization and Control

Abstract

This paper proposes a novel learning-based framework for autonomous driving based on the concept of maximal safety probability. Efficient learning requires rewards that are informative of desirable/undesirable states, but such rewards are challenging to design manually due to the difficulty of differentiating better states among many safe states. On the other hand, learning policies that maximize safety probability does not require laborious reward shaping but is numerically challenging because the algorithms must optimize policies based on binary rewards sparse in time. Here, we show that physics-informed reinforcement learning can efficiently learn this form of maximally safe policy. Unlike existing drift control methods, our approach does not require a specific reference trajectory or complex reward shaping, and can learn safe behaviors only from sparse binary rewards. This is enabled by the use of the physics loss that plays an analogous role to reward shaping. The effectiveness of the proposed approach is demonstrated through lane keeping in a normal cornering scenario and safe drifting in a high-speed racing scenario.

 

 

All Content © PaperCept, Inc.


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-10-08  13:30:35 PST  Terms of use