MétaCan
Menu
Back to cohort
Record W4293863172 · doi:10.1109/siu55565.2022.9864806

Autonomous Driving Systems for Decision-Making Under Uncertainty Using Deep Reinforcement Learning

2022· article· en· W4293863172 on OpenAlexaff
Mehmet Haklıdır, Hakan Temeltaş

Bibliographic record

Venue2022 30th Signal Processing and Communications Applications Conference (SIU) · 2022
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsStantec (Canada)
Fundersnot available
KeywordsPartially observable Markov decision processReinforcement learningMarkov decision processComputer scienceArtificial intelligenceAction (physics)Process (computing)ObservableControl (management)Markov processState (computer science)Autonomous agentMarkov chainMachine learningMarkov modelMathematics

Abstract

fetched live from OpenAlex

Deep reinforcement learning has achieved human-level and even beyond performance on complex tasks like Atari games and Go. However, this performance is not easy to adapt to autonomous driving since real world state spaces are extremely complex and have continuous action spaces. Besides, autonomous driving tasks often require decision making under uncertainty. Hence, the autonomous driving problem can be formulated as a partially observable Markov decision process (POMDP).In this paper, we propose a new approach to solve the autonomous driving problem based on decision making under uncertainty as a partially observable Markov decision process, using Guided Soft Actor-Critic (Guided SAC). Self driving car has been trained for the scenario where it encountered with a pedestrian crossing the road. Experiments show that the control agent exhibits desirable control behavior and performed close to the fully observable state under various uncertainty situations.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.040
GPT teacher head0.308
Teacher spread0.268 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 30th Signal Processing and Communications Applications Conference (SIU)Same topicReinforcement Learning in RoboticsFrench-language works237,207