scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: An optimal operational scheduling framework to be taken in use in the distribution management system (DMS) as the heart of smart active distribution networks (ADNs) seeking to minimize the day-ahead total operation costs is proposed.
Abstract: This paper proposes an optimal operational scheduling framework to be taken in use in the distribution management system (DMS) as the heart of smart active distribution networks (ADNs). The proposed algorithm targets to optimally control active elements of the network, distributed generations (DGs) and responsive loads (RLs), seeking to minimize the day-ahead total operation costs. The technical constraints of the components and the whole system are accommodated in the ac power flow fashion. As an innovative point, the DMS effectively utilizes the hourly network reconfiguration capabilities being realized by the deployment of remotely controlled switches (RCSs). Accordingly, besides the optimal schedule of active elements, the optimal topology of the network associated with each hour of the scheduling time horizon is determined as well. The effect of hourly reconfiguration on the capacity release of DGs and RLs is highlighted, which could be envisaged as a new trend in the reserve scheduling problem. Considering practical issues, the maximum daily switching actions of RCSs as well as switching costs are judicially included. The optimization procedure is formulated as a mixed-integer nonlinear problem and tackled with the genetic algorithm. To validate the satisfactory performance of the proposed framework, a 33-bus ADN is thoroughly interrogated.

128 citations

Journal ArticleDOI
TL;DR: This paper describes recent approaches that are suitable for on-line application that lead to a redesign of the controller or augment the control loop with a reconfiguration block that adapts the nominal controller to the dynamical properties of the faulty plant.

128 citations

Journal ArticleDOI
TL;DR: It is proved that the overall system resulted from the developed control framework has the same control performance of the nominal closed-loop system, including certain system dynamics and the nominal control effort.
Abstract: This paper studies a key issue of developing reconfigurable fault-tolerant control to retain a nominal feedback controller and simultaneously handles actuator faults and system uncertainty, while the closed-loop system is stabilized with all control objectives achieved. A theoretical architecture of a reconfigurable control design is presented for a class of uncertain mechanical systems by using an observer technique. As a stepping stone, a nonlinear observer-based estimation mechanism is designed to reconstruct uncertain dynamics and actuator faults with the estimation error converging to zero within finite time. A reconfigurable control effort is then synthesized from the reconstructed knowledge. This control power operates as a compensation control part, and it is added to the nominal control part to accommodate system uncertainties and actuator faults. It is proved that the overall system resulted from the developed control framework has the same control performance of the nominal closed-loop system, including certain system dynamics and the nominal control effort. The effectiveness of the scheme is validated on a serial robotic manipulator.

127 citations

Proceedings ArticleDOI
13 Mar 2001
TL;DR: Using a graph-theoretic characterization of feasible packings, this work considers the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities, where modules are modeled as three-dimensional boxes in space
Abstract: We consider the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities, where modules are modeled as three-dimensional boxes in space and time. Using a graph-theoretic characterization of feasible packings, we are able to solve the following problems. (a) Find the minimal execution time of the given problem on an FPGA of fixed size, (b) Find the FPGA of minimal size to accomplish the tasks within a fired time limit. Furthermore, our approach is perfectly suited for the treatment of precedence constraints for the sequence of tasks, which are present in virtually all practical instances. Additional mathematical structures are developed that lead to a powerful framework for completing optimal solutions. The usefulness is illustrated by computational results.

127 citations

Journal ArticleDOI
TL;DR: This paper reports on an investigation of new CAD tools and the development of a new simulation technique, called dynamic circuit switching (DCS), for dynamically reconfigurable systems.
Abstract: The emergence of static memory-based field programmable gate arrays (FPGAs) that are capable of being dynamically reconfigured, i.e., partially reconfigured while active, has initiated research into new methods of digital systems synthesis. At present, however, there are virtually no specific CAD tools to support the design and investigation of digital systems using dynamic reconfiguration. This paper reports on an investigation of new CAD tools and the development of a new simulation technique, called dynamic circuit switching (DCS), for dynamically reconfigurable systems. The principles of DCS are presented and examples of its application are described.

127 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
85% related
Software
130.5K papers, 2M citations
85% related
Wireless sensor network
142K papers, 2.4M citations
84% related
Network packet
159.7K papers, 2.2M citations
83% related
Optimization problem
96.4K papers, 2.1M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023784
20221,765
2021778
2020958
2019976
20181,060