Pith. sign in

REVIEW 1 cited by

End-to-End Model-Free Reinforcement Learning for Urban Driving using Implicit Affordances

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.10868 v2 pith:ORB2PHK6 submitted 2019-11-25 cs.LG cs.AIcs.CVcs.ROstat.ML

End-to-End Model-Free Reinforcement Learning for Urban Driving using Implicit Affordances

classification cs.LG cs.AIcs.CVcs.ROstat.ML
keywords drivinglearningurbanaffordancesdetectionhandlingimplicitlight
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Reinforcement Learning (RL) aims at learning an optimal behavior policy from its own experiments and not rule-based control methods. However, there is no RL algorithm yet capable of handling a task as difficult as urban driving. We present a novel technique, coined implicit affordances, to effectively leverage RL for urban driving thus including lane keeping, pedestrians and vehicles avoidance, and traffic light detection. To our knowledge we are the first to present a successful RL agent handling such a complex task especially regarding the traffic light detection. Furthermore, we have demonstrated the effectiveness of our method by winning the Camera Only track of the CARLA challenge.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Comprehensive Review of Reinforcement Learning for Autonomous Driving in the CARLA Simulator

    cs.RO 2025-09 conditional novelty 4.0

    A survey of roughly 100 CARLA reinforcement learning papers, mapping algorithm families, representations, rewards, evaluation metrics, towns, and open challenges.