Topic
Control reconfiguration
About: Control reconfiguration is a research topic. Over the lifetime, 22423 publications have been published within this topic receiving 334217 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, a new approach based on the "path-to-node" concept is presented, allowing both topological and electrical constraints to be algebraically formulated before the actual radial configuration is determined.
Abstract: This paper is devoted to efficiently modeling the connectivity of distribution networks, which are structurally meshed but radially operated. A new approach, based on the "path-to-node" concept, is presented, allowing both topological and electrical constraints to be algebraically formulated before the actual radial configuration is determined. In order to illustrate the possibilities of the proposed framework, the problem of network reconfiguration for power loss reduction is considered. Two different optimization algorithms-one resorting to a genetic algorithm and the other solving a conventional mixed-integer linear problem-are fully developed. The validity and effectiveness of the path-based distribution network modeling are demonstrated on different test systems.
163 citations
TL;DR: The performance achieved suggests that the proposed methodology can provide an efficient alternative for reconfiguration problems, and an efficient data structure for tree representation may significantly increase the performance of evolutionary-based approaches for network reconfigured systems.
Abstract: Distribution system problems, such as planning, loss minimization, and energy restoration, usually involve network reconfiguration procedures. The determination of an optimal network configuration is, in general, a combinatorial optimization problem. Several Evolutionary Algorithms (EAs) have been proposed to deal with this complex problem. Encouraging results have been achieved by using such approaches. However, the running time may be very high or even prohibitive in applications of EAs to large-scale networks. This limitation may be critical for problems requiring online solutions. The performance obtained by EAs for network reconfiguration is drastically affected by the adopted computational tree representation. Inadequate representations may drastically reduce the algorithm performance. Thus, the employed representation for chromosome encoding and the corresponding operators are very important for the performance achieved. An efficient data structure for tree representation may significantly increase the performance of evolutionary-based approaches for network reconfiguration problems. The present paper proposes a tree encoding and two genetic operators to improve the EA performance for network reconfiguration problems. The corresponding EA approach was applied to reconfigure large-scale systems. The performance achieved suggests that the proposed methodology can provide an efficient alternative for reconfiguration problems.
163 citations
TL;DR: In this paper, the problem of finding the optimal topological configuration of a power transmission system is considered with the aim of providing system operators with a tool suited for congestion management, and the solution of the resulting large-scale mixed-integer programming problem is carried out both by a deterministic branch-and-bound algorithm included in the CPLEX optimization package and by a genetic algorithm.
162 citations
17 Apr 1996
TL;DR: Algorithms, design tools, and implementation strategies that are being used in a configurable computing system for ATR, using FPGAs to build systems for automatic target recognition (ATR), are described.
Abstract: FPGAs can be used to build systems for automatic target recognition (ATR) that achieve an order of magnitude increase in performance over systems built using general purpose processors. This improvement is possible because the bit-level operations that comprise much of the ATR computational burden map extremely efficiently into FPGAs, and because the specificity of ATR target templates can be leveraged via fast reconfiguration. We describe here algorithms, design tools, and implementation strategies that are being used in a configurable computing system for ATR.
162 citations
13 Jun 2005
TL;DR: A meta-framework called Plastik is proposed which supports the specification and creation of runtime component-framework-based software systems and facilitates and manages the runtime reconfiguration of such systems while ensuring integrity across changes.
Abstract: We propose a meta-framework called ‘Plastik' which i) supports the specification and creation of runtime component-framework-based software systems and ii) facilitates and manages the runtime reconfiguration of such systems while ensuring integrity across changes. The meta-framework is fundamentally an integration of an architecture description language (an extension of ACME/Armani) and a reflective component runtime (OpenCOM). Plastikgenerated component frameworks can be dynamically reconfigured either through programmed changes (which are foreseen at design time and specified at the ADL level); or through ad-hoc changes (which are unforeseen at design time but which are nevertheless constrained by invariants specified at the ADL level). We provide in the paper a case study that illustrates the operation and benefits of Plastik.
162 citations