Control reconfiguration

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

Autonomic self-tuning of database management system in dynamic logical partitioning environment

Abstract: Database partition monitoring and dynamic logical partition reconfiguration in support of an autonomic self-tunable database management system are provided by an automated monitor that monitors one or more resource parameters in a logical partition running a database application in a logically partitioned data processing host. The monitor initiates dynamic logical partition reconfiguration in the event that the parameters vary from predetermined parameter values. In particular, the monitor can initiate removal of resources if one of the resource parameters is being underutilized and initiate addition of resources if one of the resource parameters is being overutilized. The monitor can also calculate an amount of resources to be removed or added. The monitor can interact directly with a dynamic logical partition reconfiguration function of the data processing host or it can utilize an intelligent intermediary that listens for a partition reconfiguration suggestion from the monitor. In the latter configuration, the listener can determine where available resources are located and attempt to fully or partially satisfy the resource needs suggested by the monitor.

Self-repair through scale independent self-reconfiguration

Abstract: Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected, thus changing the overall shape of the robot. This self-reconfiguration process is difficult to control, because it involves the distributed coordination of large numbers of identical modules connected in time-varying ways. We present an approach where a desired shape is grown based on a scalable representation of the desired configuration, which is automatically generated from a 3D CAD model. The size of the configuration is adjusted continually to match the number of modules in the system. This has the advantage that if modules are removed or added, the system automatically adjusts its scale and thus self-repair is obtained as a side effect. This capability is achieved by distributed, local rules for module movement that are independent of the goal configuration. We compare the scale independent approach to one where the desired configuration is grown directly at a fixed scale. We find that the features of the scale independent approach come at the expense of an increased number of moves, messages, and time steps taken to reconfigure.

Reconfigurable hardware SAT solvers: a survey of systems

Abstract: By adapting to computations that are not so well-supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational systems use high-capacity programmable logic devices and are based on processing units customized to the requirements of a particular application. A great deal of the research effort in this area is aimed at accelerating the solution of combinatorial optimization problems. Special attention in this context was given to the Boolean satisfiability (SAT) problem resulting in a considerable number of different architectures being proposed. This paper presents the state-of-the-art in reconfigurable hardware SAT satisfiers. The analysis and classification of existing systems has been performed according to such criteria as algorithmic issues, reconfiguration modes, the execution model, the programming model, logic capacity, and performance.

Stochastic strategies for a swarm robotic assembly system

Abstract: We present a decentralized, scalable approach to assembling a group of heterogeneous parts into different products using a swarm of robots. While the assembly plans are predetermined, the exact sequence of assembly of parts and the allocation of subassembly tasks to robots are determined by the interactions between robots in a decentralized fashion in real time. Our approach is based on developing a continuous abstraction of the system derived from models of chemical reactions and formulating the strategy as a problem of selecting rates of assembly and disassembly. These rates are mapped onto probabilities that determine stochastic control policies for individual robots, which then produce the desired aggregate behavior. This top-down approach to determining robot controllers also allows us to optimize the rates at the abstract level to achieve fast convergence to the specified target numbers of products. Because the method incorporates programs for assembly and disassembly, changes in demand can lead to reconfiguration in a seamless fashion. We illustrate the methodology using a physics-based simulator with examples involving 15 robots and two types of final products.