Name
Abstract | ||
|---|---|---|
The increasing penetration of renewable sources like solar energy add new dimensions in planning power grid operations. We study the problem of curtailing a subset of prosumers generating solar power with the twin goals of being close to a target collection and maintaining fairness across prosumers. The problem is complicated by the uncertainty in the amount of energy fed-in by each prosumer and the large problem size in terms of number of prosumers. To meet these challenges, we propose an algorithm based on the Combinatorial Multi-Armed Bandit problem with an approximate Knapsack based oracle. With real-data on solar panel output across multiple prosumers, we are able to demonstrate the effectiveness of the proposed algorithm. |
Year | Venue | Field |
|---|---|---|
2016 | Proceedings of the International Conference on Automated Planning and Scheduling | Prosumer,Mathematical optimization,Renewable energy,Computer science,Oracle,Solar energy,Power grid,Solar power,Renewable generation,Knapsack problem |
DocType | ISSN | Citations |
Conference | 2334-0835 | 2 |
PageRank | References | Authors |
0.51 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sambaran Bandyopadhyay | 1 | 14 | 9.52 |
| Pratyush Kumar | 2 | 263 | 19.69 |
| Vijay Arya | 3 | 541 | 41.32 |