← Search

Yihan Zhou

7 accepted papers

2026

Learning to Drift with Individual Wheel Drive: Maneuvering Autonomous Vehicle at the Handling Limits

ICRA 2026poster

Drifting, characterized by controlled vehicle motion at high sideslip angles, is crucial for safely handling emergency scenarios at the friction limits. While recent reinforcement learning approaches show promise for drifting control, they struggle with the significant simulation-to-reality gap, as …

2025

Learning to Drift With Individual Wheel Drive: Maneuvering Autonomous Vehicle at the Handling Limits

RA-L 2025

Drifting, characterized by controlled vehicle motion at high sideslip angles, is crucial for safely handling emergency scenarios at the friction limits. While recent reinforcement learning approaches show promise for drifting control, they struggle with the significant simulation-to-reality gap, as

Cited by 0SourceScholar
2024

FactorSim: Generative Simulation via Factorized Representation

NeurIPS 2024poster

Generating simulations to train intelligent agents in game-playing and robotics from natural language input, user input, or task documentation remains an open-ended challenge. Existing approaches focus on parts of this challenge, such as generating reward functions or task hyperparameters. Unlike pr…

Cited by 0SourcePDFScholar
2023

Consecutive Inertia Drift of Autonomous RC Car via Primitive-Based Planning and Data-Driven Control

IROS 2023poster

Inertia drift is an aggressive transitional driving maneuver, which is challenging due to the high nonlinearity of the system and the stringent requirement on control and planning performance. This paper presents a solution for the consecutive inertia drift of an autonomous RC car based on primitive…

Cited by 4SourceScholar
2020

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses

NeurIPS 2020poster

In online convex optimization (OCO), Lipschitz continuity of the functions is commonly assumed in order to obtain sublinear regret. Moreover, many algorithms have only logarithmic regret when these functions are also strongly convex. Recently, researchers from convex optimization proposed the notion…

Cited by 23SourcePDFScholar