A Novel ANFIS-Based Approach for Optimizing Energy Efficiency in Autonomous Vehicles
Bibliographic record
Abstract
Autonomous vehicles (AVs) promise improved safety and sustainability, yet their sophisticated sensing, computing, and communication systems impose auxiliary power loads of 1.5–3.2 kW, risking an increase of up to 45% in global transport energy demand by 2040 if left unaddressed. Existing energy management strategies fail to jointly optimize propulsion and autonomy subsystems under real-world dynamic traffic, treat ADAS loads as static, and lack statistically rigorous validation. This paper proposes a novel Adaptive Neuro-Fuzzy Inference System (ANFIS)-PID framework that integrates (i) 5 s V2X traffic preview, (ii) online PID gain scheduling, and (iii) energy-aware rule pruning for real-time energy allocation. Validated on a real-world trajectory dataset, the approach consistently reduces fuel consumption by up to 4.4% over pure fuzzy logic, 0.05% over FL-RWOA, 1.16% over FL-GWO, and 2.39% over FL-PSO across 25–100 km segments (paired t-test, p ≤ 0.001 on 50 random segments). Additional benefits include 18% faster transient response and 18% lower inference computational load compared to metaheuristic baselines. Scaled to fleet level, the 0.51 L/100 km average saving equates to over CAD 100 million annual savings in Canada. The hybrid neuro-fuzzy architecture offers a deployable, adaptive solution for sustainable autonomous transportation.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".