A Forward Collision Warning System Using Deep Reinforcement Learning
Bibliographic record
Abstract
Forward collision warning is one of the most challenging concerns in the safety of autonomous vehicles. A cooperation between many sensors such as LIDAR, Radar and camera helps to enhance the safety. Apart from the importance of having a reliable object detector, the safety system should have requisite capabilities to make reasonable decisions in the moment. In this work, we concentrate on detecting front vehicles of autonomous cars using a monocular camera, beyond only a detection method. In fact, we devise a solution based on a cooperation between a deep object detector and a reinforcement learning method to provide forward collision warning signals. The proposed method models the relation between acceleration, distance and collision point using the area of the bounding box related to the front vehicle. An agent of learning automata as a reinforcement learning method interacts with the environment to learn how to behave in eclectic hazardous situations. The agent follows a deterministic but variable structure learning automata in order to find the collision point in different status. The proposed learning automata method has a nested structure in its states and every state has a memory to place the time duration between the entrance and the collision point. The Agent makes decisions based on a specific number of previous data to engross the impact of time. Since it is almost impossible to capture the data of hazardous situations, we design the essential scenarios via a virtual simulation environment. Eventually, after some trails and errors the algorithm reaches to a convergence point and extracts the model of front vehicle motions.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".