Achieving Energy-Efficient and Travel Time-Optimized Trajectory and Signal Control for CAEVs
Bibliographic record
Abstract
Electric Vehicles (EVs) are cost-effective and widely recognized for their significant role in reducing greenhouse gas (GHG) emissions. However, concerns surrounding range anxiety and charge anxiety have hindered their widespread adoption. To address these concerns, traffic engineers have been working on developing control strategies to reduce energy consumption (EC). Unlike traditional gasoline-powered vehicles, EVs experience a notable increase in EC at speeds exceeding 25km/h. Consequently, minimizing EC often results in reduced speed and longer total travel time (TTT). In light of this, our paper proposes a novel trajectory and signal control method that leverages connected and automated vehicle (CAV) technology to realize a tradeoff between EC and TTT. Initially, the approach assumes all vehicles are connected and automated electric vehicles (CAEVs) capable of communication and coordination, to which a cooperative adaptive cruise control (CACC) model was applied. Then, the vehicles were controlled to avoid stops and achieve smoother trajectories at the intersections. Finally, the signal control was integrated to further reduce EC and TTT. The proposed method was evaluated with a simulation conducted in SUMO based on a busy corridor in the City of Edmonton, Canada. The developed method successfully balanced energy and traffic efficiency, reducing both EC and TTT by 14% and 38% respectively. More importantly, the computational burden of our method is considerably lighter compared to existing studies, making it highly suitable for real-time applications. Overall, the results presented in our study showcase the potential of achieving a more efficient and sustainable traffic system with the future existence of CAEVs.
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 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.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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".