Skip to main navigation Skip to search Skip to main content

Peak-load shaving in smart homes via online scheduling

  • Giuseppe Tommaso Costanzo
  • , J. Kheir
  • , Guchuan Zhu
    • Polytechnique Montreal

    Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

    1 Downloads (Orbit)

    Abstract

    This paper addresses the problem of load-shaving in Smart Homes in view of improving energy efficiency in Smart Grids. An architecture of home power management systems, allowing the separation of domestic power load control from grid dynamics, is introduced. In this framework, the operation of appliances is modeled as a finite state machine which enables the implementation of online scheduling borrowed from the techniques developed in real-time computing systems. A scheduling algorithm is developed for peak-load shaving and the simulation results confirm the effectiveness and the efficiency of the proposed approach.
    Original languageEnglish
    Title of host publicationIndustrial Electronics
    PublisherIEEE
    Publication date2011
    Pages1347-1352
    ISBN (Print)9781424493104
    DOIs
    Publication statusPublished - 2011
    Event20th International Symposium on Industrial Electronics (ISIE 2011) - Gdansk University of Technology, Gdansk, Poland
    Duration: 27 Jun 201130 Jun 2011

    Conference

    Conference20th International Symposium on Industrial Electronics (ISIE 2011)
    LocationGdansk University of Technology
    Country/TerritoryPoland
    CityGdansk
    Period27/06/201130/06/2011

    UN SDGs

    This output contributes to the following UN Sustainable Development Goals (SDGs)

    1. SDG 7 - Affordable and Clean Energy
      SDG 7 Affordable and Clean Energy

    Keywords

    • Building management systems
    • Energy conservation
    • Finite state machines
    • Scheduling
    • Smart power grids

    Fingerprint

    Dive into the research topics of 'Peak-load shaving in smart homes via online scheduling'. Together they form a unique fingerprint.

    Cite this