Smoothed Least-laxity-first Algorithm for EV Charging
Authors:
Open Access
- 16 May 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 242-251
Abstract
We formulate EV charging as a feasibility problem that meets all EVs' energy demands before departure under charging rate constraints and total power constraint. We propose an online algorithm, the smoothed least-laxity-first (sLLF) algorithm, that decides on the current charging rates based on only the information up to the current time. We characterize the performance of the sLLF algorithm analytically and numerically. Numerical experiments with real-world data show that it has significantly higher rate of generating feasible EV charging than several other common EV charging algorithms.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors2014
- Electric Vehicle Charging in Smart Grid: Optimality and Valley-Filling AlgorithmsIEEE Journal of Selected Topics in Signal Processing, 2014
- Competitive algorithms from competitive equilibria2014
- A survey of hard real-time scheduling for multiprocessor systemsACM Computing Surveys, 2011
- Real Time Scheduling Theory: A Historical PerspectiveReal-Time Systems, 2004
- Optimal Time-Critical Scheduling via Resource AugmentationAlgorithmica, 2002
- Speed is as powerful as clairvoyanceJournal of the ACM, 2000
- Multiprocessor online scheduling of hard-real-time tasksIEEE Transactions on Software Engineering, 1989
- Restless bandits: activity allocation in a changing worldJournal of Applied Probability, 1988
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973