A Virtual Method for Optimizing Deployment of Roadside Monitoring Lidars at As-Built Intersections
Bibliographic record
Abstract
Roadside monitoring Lidars (RMLs) will be a crucial part of the future intelligent transportation system. Current approaches for optimizing RMLs’ placement at intersections work in hypothetical environments which do not well reflect real-world situations. This article proposes a new virtual method (VM) for optimizing the deployment of RMLs at as-built intersections. The proposed VM operates in a virtual environment where both static background and dynamic agents are modeled by dense point clouds. The agents are driven by real-world motion data. Using RMLs’ parameters as inputs, a coarse-to-fine subsampling approach is developed to generate laser scans in the virtual world. An objective function is then defined by comparing the agents’ points in the generated laser scan sequences against their original models. Bayesian optimization is applied to maximize the objective function by setting the RMLs’ positions and poses as decision variables. Besides, batch processing strategy and parallel computing are used to accelerate the optimization process. The effectiveness of the proposed VM is demonstrated in a case study. The VM shall help road administrators make decisions on RMLs’ deployment at as-built intersections.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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.001 | 0.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.
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".