Real-Time Smart Parking Systems Integration in Distributed ITS for Smart Cities
Bibliographic record
Abstract
Intelligent Transportation Systems (ITS) have evolved as a key research topic in recent years, revolutionizing the overall traffic and travel experience by providing a set of advanced services and applications. These data-driven services contribute to mitigate major problems arising from the ever growing need of transport in our daily lives. Despite the progress, there is still need for an enhanced and distributed solution that can exploit the data from the available systems and provide an appropriate and real-time reaction on transportation systems. Therefore, in this paper, we present a new architecture where the intelligence is distributed and the decisions are decentralized. The proposed architecture is scalable since the incremental addition of new peripheral subsystems is supported by the introduction of gateways which requires no reengineering of the communication infrastructure. The proposed architecture is deployed to tackle the problem of traffic management inefficiency in urban areas, where traffic load is substantially increased, by vehicles moving around unnecessarily, to find a free parking space. This can be significantly reduced through the availability and diffusion of local information regarding vacant parking slots to drivers in a given area. Two types of parking systems, magnetic and vision sensor based, have been introduced, deployed, and tested in different scenarios. The effectiveness of the proposed architecture, together with the proposed algorithms, is assessed in field trials.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".