Abstract
Devices capable of bidirectional charging, such as electric vehicles and home batteries, play a crucial role in decentralized energy management (DEM) to help balance loads locally. Most methods for scheduling such assets assume that they can charge and discharge at any rate between given maximum rates. However, in practice (dis)charging at low rates close to zero is undesirable or even impossible due to technical limitations. Therefore, this paper presents a heuristic algorithm for scheduling bidirectional charging of batteries that takes into account minimum (dis)charging thresholds. We show that the resulting schedules generally have only a few time intervals where (dis)charging happens below the thresholds, which greatly improves upon common approaches for battery scheduling that ignore the thresholds. In particular, our approach computes optimal schedules satisfying the minimum threshold constraints for more than 70% of the considered problem instances.
| Original language | English |
|---|---|
| Title of host publication | 2025 IEEE Kiel PowerTech |
| Publisher | IEEE |
| Number of pages | 6 |
| ISBN (Electronic) | 979-8-3315-4397-6 |
| DOIs | |
| Publication status | Published - 6 Oct 2025 |
| Event | 2025 IEEE Kiel PowerTech - Kiel, Germany Duration: 29 Jun 2025 → 3 Jul 2025 |
Conference
| Conference | 2025 IEEE Kiel PowerTech |
|---|---|
| Country/Territory | Germany |
| City | Kiel |
| Period | 29/06/25 → 3/07/25 |
Keywords
- bidirectional charging
- electric vehicle
- battery scheduling
- algorithm
- minimum charging threshold