This study provides an empirical analysis aiming to answer the currently active discussions on how to accept a compressed driving policy, so as to achieve a safe and statistically reliable deployment of automated driving functions.
Abstract
Many automobile and mobility companies deploy learned driving policies on embedded computers with limited memory and power. Pruning, knowledge distillation, and quantization are the standard methods to reduce the size and the inference cost of these policies. However, these methods are commonly assessed by aggregate numerical scores, and such scores may not reflect the ability of the policy to drive safely when interacting with other road users. In this study, we propose a stage-wise closed-loop evaluation approach to follow a driving policy through a compression pipeline. We formulate the driving task as a partially observable Markov decision process (POMDP) and train a belief-state policy with proximal policy optimization (PPO) in Gym-Duckietown. We then extract the actor, compress it one stage at a time, and evaluate it on five driving curricula. We show that structured pruning is the stage at which the driving capability is first lost. Meanwhile, distillation improves the pruned actor, but the improvement is limited by its rehearsal data. Integer quantization of the improved actor loses some of the curricula that require the vehicle to stop and then resume. Interestingly, the same procedure on the unpruned actor preserves all five curricula. Our study thus provides an empirical analysis aiming to answer the currently active discussions on how to accept a compressed driving policy, so as to achieve a safe and statistically reliable deployment of automated driving functions.
Closed-loop autonomous driving at 10 Hz leaves approximately 100 ms for perception and control inference, making fullprecision 7B large language models unsuitable for deployment. This paper evaluates whether GPTQ 4-bit quantization and paged inference can reduce decision latency enough for BEV-to-text driving control a...
Gaosong Shi, Pengkai Guo, Xiao-Fan Sun et al.· International Conference on...· 0 citations
This work studies how much closed-loop driving competence a compact multimodal policy can acquire from offline demonstrations in the CARLA simulator, and reports offline metrics and distinguish measured results from qualitative closed-loop observations.
The Proxy-to-Decision Transfer (PDT) Framework is proposed, an analysis framework that evaluates when learned future information supports a reliable driving-performance improvement claim, and identifies where decision transfer fails or remains indeterminate across proxy, subset, aggregate, and selection evidence.
This survey examines RL-based AD in modular and end-to-end pipelines and relates reported methods to task formulation and deployment evidence and examines deployment barriers, including safety, Sim2Real generalization, data efficiency, computation, embodied alignment, and evaluation readiness.
B. Shuai, Min Hua, Le-Tian Tao et al.· Communications in Transporta...· 0 citations
This work proposes OPTED (on-policy fine-tuning for end-to-end driving) which decouples reinforcement learning from the post-training of the end-to-end policy: a privileged teacher is trained using RL on vectorized inputs (HD-map and bounding boxes) which provides supervision to the pre-trained student during closed-lo...
D. Da Col, M. Igl, Peter Karkus et al.· 1 citation
On-policy distillation (OPD) provides dense teacher supervision on student-generated trajectories, but generating and evaluating long rollouts incurs substantial training cost. Existing acceleration methods reduce this cost through open-loop rollout schedules or closed-loop horizon adaptation. However, supervision comp...
Wei Chen, Junle Chen, Yi-Tong Yang et al.· 0 citations
Known for his clear and elegant writing style, Bertsekas shaped fields from control and optimization to large-scale computation and artificial intelligence.