Cited by 37

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Privacy-Preserving Context-Based Electric Vehicle Dispatching for Energy Scheduling in Microgrids: An Online Learning Approach

Liu, Yichen, Zhou, Pan, Yang, Lei, Wu, Yulei, Xu, Zichuan, Liu, Kai, Wang, Xiumin·2022·IEEE Transactions on Emerging Topics in Computational Intelligence

Abstract

Electric Vehicles (EVs) are beginning to play a key role in the fast developing area of Internet of Things (IoT). Numerous results have shown the feasibility of vehicle-to-building (V2B) mode of charge/discharge, where EVs are considered as dynamically configurable dispersed energy storage units. When properly incorporated into the building energy system, EVs are able to provide ancillary services to the power grid during high demand periods or outage situations. The arising challenge is how to act intelligent behaviors in complex and changing microgrid environments. With the aim of minimizing the cost and maximizing satisfaction degree, this paper, unlike previous works, jointly considers the building energy need and the safety/willingness of EVs to find and dispatch the optimal vehicle to conduct auxiliary or supportive actions. To realize that, we propose an intelligent Privacy-preserving Context-based Online EV Dispatching System (PCOEDS), using a tree-based structure which supports the ever-increasing big metering datasets with context-awareness. Moreover, privacy preservation and security protection on both sides of the the energy transmission process are well guaranteed in our work. Theoretical results validate that our intelligent dispatching system achieves sublinear regret and differential privacy, which outperforms other online learning method when applied to a huge city-level dataset.

Overview

Integrity signals

Registry

Crossref · 10.1109/tetci.2021.3085964

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Show all 3 references

Research works printed but not linked: 36

  1. 10.1109/TETCI.2019.2923426 · DOI
  2. 10.1109/JIOT.2014.2306328 · DOI
  3. 10.1109/JIOT.2018.2876004 · DOI
  4. 10.1109/TSG.2011.2172228 · DOI
  5. 10.1109/TSG.2014.2338794 · DOI
  6. 10.1109/TITS.2019.2914087 · DOI
  7. 10.1109/IranianCEE.2019.8786524 · DOI
  8. 10.1109/MCOM.2017.1700133 · DOI
  9. 10.1109/ICITBS.2018.00011 · DOI
  10. 10.1109/MWC.2016.1600039WC · DOI
  11. 10.1109/TETCI.2019.2902845 · DOI
  12. 10.1109/TETCI.2019.2923426 · DOI
  13. Wu, 2015, Algorithms with logarithmic or sublinear regret for constrained contextual bandits, 433
  14. 10.1109/TSC.2014.2365795 · DOI
  15. 10.1109/FOCS.2007.66 · DOI
  16. 10.1109/JIOT.2019.2903341 · DOI
  17. 10.1007/11681878_14 · DOI · Paper page
  18. 10.1561/0400000042 · DOI · Paper page
  19. 10.1109/JIOT.2016.2560768 · DOI
  20. 10.4236/cn.2017.94020 · DOI
  21. 10.1186/s40537-016-0059-y · DOI
  22. Auer, 2002, Finite-time analysis of the multiarmed bandit problem, Mach. Learn., 47, 235, 10.1023/A:1013689704352 · DOI · Paper page
  23. 10.1109/TPWRD.2012.2186181 · DOI
  24. 2013, Radial Test Feeders IEEE PES distribution system analysis subcommittee
  25. 10.1007/978-3-642-04414-4_7 · DOI
  26. 10.1109/WCNC45663.2020.9120767 · DOI
  27. 10.1109/INFOCOM.2019.8737654 · DOI
  28. 10.1145/1772690.1772758 · DOI · Paper page
  29. 10.2200/s00941ed2v01y201907cnt022 · DOI
  30. 10.1109/EPDC.2014.6867499 · DOI
  31. 10.1109/JIOT.2018.2872444 · DOI
  32. 10.1109/IJCNN.2016.7727361 · DOI
  33. 10.1109/TSG.2017.2703842 · DOI
  34. 10.1109/VPPC46532.2019.8952394 · DOI
  35. 10.1109/EI2.2018.8582136 · DOI
  36. 10.1109/ACCESS.2020.2970272 · DOI

Metadata

Authors
Liu, Y., Zhou, P., Yang, L., Wu, Y., Xu, Z., Liu, K., & Wang, X.
Affiliations
  • Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Hubei, China
  • School of Software Engineering, South China University of Technology, Guangzhou, China
  • College of Engineering, Mathematics, and Physical Sciences, University of Exeter, Exeter, U.K.
  • Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province, School of Software, Dalian University of Technology, Dalian, China
  • College of Computer Science, Chongqing University, Chongqing, China
  • School of Computer Science and Engineering, South China University of Technology, Guangzhou, China
Venue
IEEE Transactions on Emerging Topics in Computational Intelligence
Published
2022-06
Volume
6
Issue
3
Pages
462-478
ISSN
2471-285X
Cited by
37
References
3
Funders
National Natural Science Foundation of China (61972448, 61802048, 61872150)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review