Lecture

Automated PV Hosting Capacity Quantification

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture discusses the development of an open-source tool for automated quantification of PV hosting capacity in distribution networks using Power Factory. By gradually increasing the amount of PV on the network, the tool calculates the hosting capacity, providing rapid, transparent, and accurate results. It also explores the impact of different control techniques on enhancing the hosting capacity, showcasing a significant increase in PV integration with advanced planning techniques and pattern-pending inverter control.

Official source

Related concepts (17)

Quantifier (logic)

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula.

Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

Existential quantification

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier ("∃x" or "∃(x)" or "(∃x)"). Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain.

Open source

Open source is source code that is made freely available for possible modification and redistribution. Products include permission to use the source code, design documents, or content of the product. The open-source model is a decentralized software development model that encourages open collaboration. A main principle of open-source software development is peer production, with products such as source code, blueprints, and documentation freely available to the public.

Branching quantifier

In logic a branching quantifier, also called a Henkin quantifier, finite partially ordered quantifier or even nonlinear quantifier, is a partial ordering of quantifiers for Q ∈ {∀,∃}. It is a special case of generalized quantifier. In classical logic, quantifier prefixes are linearly ordered such that the value of a variable ym bound by a quantifier Qm depends on the value of the variables y1, ..., ym−1 bound by quantifiers Qy1, ..., Qym−1 preceding Qm. In a logic with (finite) partially ordered quantification this is not in general the case.

Related lectures (51)

The Role of Symmetries

Delves into symmetries in physics, covering group theory, perturbation, and quantification.

Data Abstractions in AEC: Connecting with Speckle

By the instructor Claire Kuang explores data abstractions in the AEC industry and the role of Speckle in connecting industry players through an open-source platform.

Predicate Logic: Quantifiers, CNF, DNF

Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.

Physics-guided NMF for STEM/EDXS Data Analysis

Explores Physics-guided NMF for STEM/EDXS data analysis, covering challenges, optimization, constraints, and advantages of the modelization.

Inference Engines: Resolution and Horn Clauses