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
11 Jun 2008
TL;DR: This paper describes a decentralized estimation procedure that allows each agent to track the algebraic connectivity of a time-varying graph and proposes a decentralized gradient controller for eachAgent to maintain global connectivity during motion.
Abstract: The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for swarm motion towards a goal, for biological systems to avoid predators, or for mobile buoys to clean up oil spills. In many situations, auxiliary constraints, such as connectivity between team members and limits on the maximum hop-count, must be satisfied during reconfiguration. In this paper, we show that both the estimation and control of the graph connectivity can be accomplished in a decentralized manner. We describe a decentralized estimation procedure that allows each agent to track the algebraic connectivity of a time-varying graph. Based on this estimator, we further propose a decentralized gradient controller for each agent to maintain global connectivity during motion.
184 citations
26 Apr 2004
TL;DR: This contribution presents a first approach for a flexible versatile FPGA-based run-time system supporting a resource saving function multiplex for a growing number of engine control units.
Abstract: Summary form only given. The handling of an increasing number of automotive comfort functionalities has become a significant problem for the most automobile manufacturers since communication, power consumption, available space and cost become important issues for a growing number of engine control units. Our contribution presents a first approach for a flexible versatile FPGA-based run-time system supporting a resource saving function multiplex.
184 citations
12 Mar 2016
TL;DR: Heterogeneous Reconfigurable Logic (HRL), a reconfigurable array for NDP systems that improves on both FPGA and CGRA arrays, and achieves 92% of the peak performance of an NDP system based on custom accelerators for each application.
Abstract: The energy constraints due to the end of Dennard scaling, the popularity of in-memory analytics, and the advances in 3D integration technology have led to renewed interest in near-data processing (NDP) architectures that move processing closer to main memory. Due to the limited power and area budgets of the logic layer, the NDP compute units should be area and energy efficient while providing sufficient compute capability to match the high bandwidth of vertical memory channels. They should also be flexible to accommodate a wide range of applications. Towards this goal, NDP units based on fine-grained (FPGA) and coarse-grained (CGRA) reconfigurable logic have been proposed as a compromise between the efficiency of custom engines and the flexibility of programmable cores. Unfortunately, FPGAs incur significant area overheads for bit-level reconfiguration, while CGRAs consume significant power in the interconnect and are inefficient for irregular data layouts and control flows. This paper presents Heterogeneous Reconfigurable Logic (HRL), a reconfigurable array for NDP systems that improves on both FPGA and CGRA arrays. HRL combines both coarse-grained and fine-grained logic blocks, separates routing networks for data and control signals, and uses specialized units to effectively support branch operations and irregular data layouts in analytics workloads. HRL has the power efficiency of FPGA and the area efficiency of CGRA. It improves performance per Watt by 2.2x over FPGA and 1.7x over CGRA. For NDP systems running MapReduce, graph processing, and deep neural networks, HRL achieves 92% of the peak performance of an NDP system based on custom accelerators for each application.
184 citations
TL;DR: Using existing tie and sectionalizing switches, reconfiguration of the distribution system represents an attractive method of loss reduction as it can be implemented at minimal cost to the utility.
182 citations
14 Dec 1994
TL;DR: It is shown that simple algorithms can be obtained if full state feedback is assumed and the objective is to design automatically a flight control law in the presence of actuator failures or surface damage.
Abstract: The application of multivariable adaptive control techniques to flight control reconfiguration is considered. The paper first discusses three adaptation mechanisms for model reference control. It is shown that simple algorithms can be obtained if full state feedback is assumed. The respective advantages and disadvantages of the three algorithms are discussed in general terms, considering their complexity and the assumptions that they require. Next, the application of the adaptive algorithms to reconfigurable flight control is investigated. The objective is to design automatically a flight control law in the presence of actuator failures or surface damage. Design considerations for the adaptive algorithms are discussed in this context. Simulations obtained using a full nonlinear simulation of a twin-engine jet aircraft are included to illustrate the results. >
182 citations