A Three-Step Methodology to Improve Domestic Energy Efficiency

Increasing energy prices and the greenhouse effect lead to more awareness of energy efficiency of electricity supply. During the last years, a lot of technologies have been developed to improve this efficiency. Next to large scale technologies such as windturbine parks, domestic technologies are developed. These domestic technologies can be divided in 1) Distributed Generation (DG), 2) Energy Storage and 3) Demand Side Load Management. Control algorithms optimizing a combination of these techniques can raise the energy reduction potential of the individual techniques. In this paper an overview of current research is given and a general concept is deducted. Based on this concept, a three-step optimization methodology is proposed using 1) offline local prediction, 2) offline global planning and 3) online local scheduling. The paper ends with results of simulations and field tests showing that the methodology is promising.\u

Management and Control of Domestic Smart Grid Technology

Emerging new technologies like distributed generation, distributed storage, and demand-side load management will change the way we consume and produce energy. These techniques enable the possibility to reduce the greenhouse effect and improve grid stability by optimizing energy streams. By smartly applying future energy production, consumption, and storage techniques, a more energy-efficient electricity supply chain can be achieved. In this paper a three-step control methodology is proposed to manage the cooperation between these technologies, focused on domestic energy streams. In this approach, (global) objectives like peak shaving or forming a virtual power plant can be achieved without harming the comfort of residents. As shown in this work, using good predictions, in advance planning and real-time control of domestic appliances, a better matching of demand and supply can be achieved.\ud \u

Model checking probabilistic epistemic logic for probabilistic multiagent systems

© 2018 International Joint Conferences on Artificial Intelligence.All right reserved. In this work we study the model checking problem for probabilistic multiagent systems with respect to the probabilistic epistemic logic PETL, which can specify both temporal and epistemic properties. We show that under the realistic assumption of uniform schedulers, i.e., the choice of every agent depends only on its observation history, PETL model checking is undecidable. By restricting the class of schedulers to be memoryless schedulers, we show that the problem becomes decidable. More importantly, we design a novel algorithm which reduces the model checking problem into a mixed integer non-linear programming problem, which can then be solved by using an SMT solver. The algorithm has been implemented in an existing model checker and experiments are conducted on examples from the IPPC competitions