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: In this paper, the intrinsic short-circuit tolerance of an IGBT multicell inverter when a commutation failure occurs is analyzed and a fail-safe operating may be gained for high power applications.
Abstract: The aim of this paper is to explain the intrinsic short-circuit tolerance of an IGBT multicell inverter when a commutation failure occurs. Such a failure may either be a wrong gate voltage (malfunctioning of the driver board, auxiliary power supply failure, dv/dt disturbance) or an intrinsic IGBT failure (over-voltage/avalanche stress, temperature overshoot). IGBT stresses are studied and show that no opening of the bonding can appear and consequently no risk of explosion. That is why, owing to the imbricated cells structure, an IGBT short-circuit failure may be withstood for a few switching periods, with nevertheless nonoptimized output waveforms. The design, the lab-test of a sensor able to perform monitoring as well as the failure diagnosis are also presented. This real-time diagnosis allows either a safe stop or a remedial control strategy based on the reconfiguration of the PWM modulator. The reconfiguration strategy enables decrease of internal stresses and optimization of the output shape. A fail-safe operating may be gained for high power applications.

130 citations

Journal ArticleDOI
TL;DR: The proposed approach, enhanced integer coded particle swarm optimization (EICPSO), is able to improve the search efficiency for feeder reconfiguration problems by considering the historical local optimal solutions when generating new particles.
Abstract: This paper proposes an effective approach based on the particle swarm optimization with integer coded to determine the switch operation schemes for feeder reconfiguration. The proposed approach, enhanced integer coded particle swarm optimization (EICPSO), is able to improve the search efficiency for feeder reconfiguration problems by considering the historical local optimal solutions when generating new particles. The local optimal solutions found during the evolution process are used when new particle are generated. Three different distribution systems are used in this paper to verify and validate the effectiveness of the proposed method. Simulation results show that the proposed method can find the solutions for feeder reconfiguration problems faster than other approaches such as discrete particle swarm optimization, modified binary particle swarm optimization, and genetic algorithm.

130 citations

Journal ArticleDOI
01 May 2000
TL;DR: It is proposed that a subset of the tasks executing on the FPGA be rearranged when to do so allows the next pending task to be processed sooner, and methods are described and evaluated for overcoming the NP-hard problems of identifying feasible rearrangements and scheduling the rearranger when moving tasks are reloaded from off-chip.
Abstract: Field-programmable gate arrays (FPGAs) which allow partial reconfiguration at run time can be shared among multiple independent tasks. When the sequence of tasks to be performed is unpredictable, the FPGA controller needs to make allocation decisions online. Since online allocation suffers from fragmentation, tasks can end up waiting despite there being sufficient, albeit noncontiguous, resources available to service them. The time to complete tasks is consequently longer and the utilisation of the FPGA is lower than it could be. It is proposed that a subset of the tasks executing on the FPGA be rearranged when to do so allows the next pending task to be processed sooner. Methods are described and evaluated for overcoming the NP-hard problems of identifying feasible rearrangements and scheduling the rearrangements when moving tasks are reloaded from off-chip.

130 citations

Proceedings ArticleDOI
01 Oct 1999
TL;DR: The Optically Programmable Gate Array, an enhanced version of a conventional FPGA, utilizes a holographic memory accessed by an array of VCSELs to program its logic.
Abstract: The high data transfer rate achievable in page-oriented optical memories demands for parallel interfaces to logic circuits able to process efficiently the data. The Optically Programmable Gate Array, an enhanced version of a conventional FPGA, utilizes a holographic memory accessed by an array of VCSELs to program its logic. Combining spatial and shift multiplexing to store the configuration pages in the memory, the OPGA module is very compact and has extremely short configuration time allowing for dynamic reconfiguration. The reconfiguration capability of the OPGA can be applied to solve more efficiently problems in pattern recognition and digit classification.

130 citations

Proceedings ArticleDOI
16 May 1998
TL;DR: A novel concept of self-organizing collective robots with morphogenesis in a vertical plane is presented, potentially applicable to autonomous mobile robots and the algorithms proposed can locally generate specific global formations of robots, with minimum interactions between neighboring robots.
Abstract: This paper presents a novel concept of self-organizing collective robots with morphogenesis in a vertical plane. It is potentially applicable to autonomous mobile robots. For physical reconfiguration of a swarm of robots against gravity, new types of mechanisms and control strategies are proposed and demonstrated. Prototype robots have been fabricated in order to confirm the basic feasibility of the mechanisms. Each robot is composed of a body and a pair of arms. The body can be regarded as a cube with edge length of 90 mm, and is equipped with permanent magnets for bonding with another robot. The arms change the bonding configuration by rotating and sliding motions. As for the control strategies, we proposed the algorithms which can locally generate specific global formations of robots, with minimum interactions between neighboring robots. The overall scheme is similar to cellular automata. The control algorithms proposed have been tested by simulations.

129 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