Enhancing electric vehicle charging infrastructure: A framework for efficient charging point management
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
• Created a real-time dataset containing 1100 charging points information with parameters such as IMEI number, voltage, current, power, energy, frequency, time stamp, status of the charging point and firmware version. • Analysis of various parameters of the real-time dataset including charging station information and charging point status; the EV charging points are categorized into clusters. • The road traffic pattern is analysed by leveraging GPS modules installed in the EVs. The approximate time for EVs to reach the charging stations is estimated. • By exploiting the existing scheduler data, the availability of the charging point to accommodate dynamic demand charging requests and provide uninterrupted service is forecasted. • Combining these insights, charging point operators can anticipate the EV charging patterns and customer behavior, enabling them to optimize resource allocation and prevent underutilization of charging points. The rise of electric vehicles (EVs) in the transportation sector aids in curbing global greenhouse gas emissions yet efficiently integrating them into the existing infrastructure presents challenges in guaranteeing the real-time availability of charging points and the dynamic nature of electric mobility. This paper presents a novel dynamic demand scheduling framework that utilizes predictive analytics to address the issue of emergency charging requests; situations where an EV urgently require to reach a charging point due to critically low battery levels. The framework is integrated with advanced dynamic demand scheduling algorithm (ADDSA), which utilizes real-time charging data collected from Trivandrum, Kerala state, India. Using the comprehensive dataset, the framework identifies delayed EVs and considers the charging point status (active, idle or faulty) and charging point pricing to optimize the charging station allocation. By employing the K-Means clustering algorithm, the ADDSA categorizes charging points based on their performance and availability. To evaluate the effectiveness of these clusters, we utilize internal metrics such as the Silhouette score, Calinski-Harabasz (CH) index, and Davies-Bouldin (DB) index. Our findings demonstrate that K-Means outperforms other clustering algorithms, including DBSCAN, K-Medoids, Agglomerative clustering, and Gaussian mixture models (GMM), with a CH score of 1200, a Silhouette score of 0.45, and a DB score of 0.74. In the final stage of ADDSA, groups of available charging points along with their pricing information is generated, facilitating informed decision-making for EV users. With the rapid growth of the EV population, our unique dynamic demand scheduling framework, featuring real-time constraints, offers a promising solution for efficiently addressing the emergency charging needs of EVs.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it