REVIEW 2 cited by
Reinforcement Learning with Probabilistic Guarantees for Autonomous Driving
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
Signed reviews
read the original abstract
Designing reliable decision strategies for autonomous urban driving is challenging. Reinforcement learning (RL) has been used to automatically derive suitable behavior in uncertain environments, but it does not provide any guarantee on the performance of the resulting policy. We propose a generic approach to enforce probabilistic guarantees on an RL agent. An exploration strategy is derived prior to training that constrains the agent to choose among actions that satisfy a desired probabilistic specification expressed with linear temporal logic (LTL). Reducing the search space to policies satisfying the LTL formula helps training and simplifies reward design. This paper outlines a case study of an intersection scenario involving multiple traffic participants. The resulting policy outperforms a rule-based heuristic approach in terms of efficiency while exhibiting strong guarantees on safety.
Forward citations
Cited by 2 Pith papers
-
Neural Simplex Architecture
NSA couples a pre-certified safe fallback controller with online retraining and reverse switching so that neural controllers of safety-critical systems can be returned to control after unsafe proposals.
-
Turn-based Multi-Agent Reinforcement Learning Model Checking
A wrapper-based method verifies PCTL properties of turn-based multi-agent reinforcement learning policies via single-policy probabilistic model checking.
Discussion (0). Continue with ORCID to comment.