Control reconfiguration

About: Control reconfiguration is a research topic. Over the lifetime, 22423 publications have been published within this topic receiving 334217 citations.

Configuration relocation and defragmentation for run-time reconfigurable computing

Abstract: Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. By mapping the compute-intensive sections of an application to reconfigurable hardware, custom computing systems exhibit significant speedups over traditional microprocessors. However, this potential acceleration is limited by the requirement that the speedups provided must outweigh the considerable cost of reconfiguration. The ability to relocate and defragment configurations on field programmable gate arrays (FPGAs) can dramatically decrease the overall reconfiguration overhead incurred by the use of the reconfigurable hardware. We therefore present hardware solutions to provide relocation and defragmentation support with a negligible area increase over a generic partially reconfigurable FPGA, as well as software algorithms for controlling this hardware. This results in factors of 8 to 12 improvement in the configuration overheads displayed by traditional serially programmed FPGAs.

Training a wireless sensor network

Abstract: The networks considered in this paper consist of tiny energy-constrained commodity sensors massively deployed, along with one or more sink nodes providing interface to the outside world. Our contribution is to propose a scalable energy-efficient training protocol for nodes that are initially anonymous, asynchronous and unaware of their location. Our training protocol imposes a flexible and intuitive coordinate system onto the deployment area and partitions the anonymous nodes into clusters where data can be gathered from the environment and synthesized under local control. An important by-product of the training protocol is a simple and natural data fusion protocol as well as an energy-efficient protocol for routing data from clusters to the sink node. Being energy-efficient, our training protocol can be run on either a scheduled or ad-hoc basis to provide robustness and dynamic reconfiguration. We also outline a way of making the training protocol secure by using a parameterized variant of frequency hopping.

An Efficient Algorithm for Minimum Loss Reconfiguration of Distribution System Based on Sensitivity and Heuristics

Abstract: This paper presents a very efficient, two-stage method for the distribution system reconfiguration for loss minimization. The efficiency of the method stems from the use of real power loss sensitivity with respect to the impedances of the candidate branches. The proposed method uses these sensitivities in the first stage. A branch exchange procedure is used in the second stage to refine the solution. Results for five test systems have been obtained with the proposed method in order to demonstrate the effectiveness of the algorithm.

Terminal Sliding Mode Control for Spacecraft Formation Flying

Abstract: This paper considers the problem of relative motion control for spacecraft formation flying (SFF). Using terminal sliding mode technique, a relative position/velocity tracking control based on the nonlinear model is developed. The presented controller enables rapid formation reconfiguration with feasible fuel cost and strong robustness in the presence of uncertain but bounded disturbances. A nonlinear model with J2 disturbance and bounded uncertainties is used for dynamic simulation.

Fast reconfiguration of distribution systems considering loss minimization

Abstract: This paper addresses the problem of finding the state of switching devices (open or closed) in primary distribution networks so that the total loss is minimum. Radiality and capacity constraints are taken into account. This optimization problem is a mixed-integer nonlinear optimization problem, in which the integer variables represent the state of the switches, and the continuous variables represent the current flowing through the branches. The standard Newton method (with second derivatives) is used to compute branch currents at each stage within the integer search, which, in turn, is implemented as a simple best-first search. Although a best-first search cannot normally guarantee the optimality of the solution, the high quality of the suboptimal solutions found, together with the high processing speed, make this approach very attractive for real-size distribution systems. Results from the application of the proposed methodology to a 1128-branch, 129-switch, real-world distribution system are presented and discussed.