Gain‐Scheduled Control via Switching of LTI Controllers and State Reset

This paper proposes a synthesis method of gain‐scheduled control systems that switch linear time‐invariant controllers according to hysteresis of the scheduling parameter. Stability and L₂‐gain analysis and synthesis methods for switched systems are applied to the switched gain‐scheduled control synthesis using reset of the controller state, where also the reset law is computed via linear matrix inequalities (LMIs). In addition to optimization of an upper bound of L₂‐gain, we reduce jumps of control input via an auxiliary optimization. Numerical examples are presented to illustrate the switched gain‐scheduled controller.     

500-fps face tracking system

In this paper, we propose a high-speed vision system that can be applied to real-time face tracking at 500 fps using GPU acceleration of a boosting-based face tracking algorithm. By assuming a small image displacement between frames, which is a property of high-frame rate vision, we develop an improved boosting-based face tracking algorithm for fast face tracking by enhancing the Viola–Jones face detector. In the improved algorithm, face detection can be efficiently accelerated by reducing the number of window searches for Haar-like features, and the tracked face pattern can be localized pixel-wise even when the window is sparsely scanned for a larger face pattern by introducing skin color extraction in the boosting-based face detector. The improved boosting-based face tracking algorithm is implemented on a GPU-based high-speed vision platform, and face tracking can be executed in real time at 500 fps for an 8-bit color image of 512 × 512 pixels. In order to verify the effectiveness of the developed face tracking system, we install it on a two-axis mechanical active vision system and perform several experiments for tracking face patterns.     

Microscopic image restoration based on tensor factorization of rotated patches

In microscopic image processing for analyzing biological objects, structural characters of objects such as symmetry and orientation can be used as a prior knowledge to improve the results. In this study, we incorporated filamentous local structures of neurons into a statistical model of image patches and then devised an image processing method based on tensor factorization with image patch rotation. Tensor factorization enabled us to incorporate correlation structure between neighboring pixels, and patch rotation helped us obtain image bases that well reproduce filamentous structures of neurons. We applied the proposed model to a microscopic image and found significant improvement in image restoration performance over existing methods, even with smaller number of bases.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Anode‐voltage‐control circuit for compensation of luminance deterioration

Abstract— An external driving circuit that has realized long lifetime, power‐consumption control, and peak luminance for organic light‐emitting diode (OLED) displays have been developed. This circuit realizes an effective method for constant‐anode‐voltage (CV) driving refered to as clamped inverter (CI) driving. The feature of CV driving is to achieve low‐power consumption compared with constant‐anode‐current (CC) driving and to control the power consumption and peak luminance according to the image because display luminance can be easily changed by controlling the anode voltage. On the other hand, CV driving has the problem that luminance deterioration appears to be serious compared with that of CC driving because the current of the OLED element decreases according to usage time. To cope with this, a lifetime compensation circuit that has increased the anode voltage so that it compensates for the luminance deterioration has been developed. This circuit can compensate not only the decrease in current but also the decrease in luminance at a constant current that CC driving cannot. However, increasing the anode voltage causes an increase in stress on the OLED element. The influence of stress on OLED lifetime was verified. As a result, it was confirmed that this circuit can extend the lifetime by 32% even if the anode voltage is increased, causing stress on the OLED structure.     

Robust control method for the inverted pendulum system with structured uncertainty caused by measurement error

In this article, we propose a design method for an inverted pendulum system with a structured uncertainty. We consider that such an uncertainty is caused by a measurement error in the rotation angle of the pendulum and effects on the system structure that cannot be included in the nominal elements. For the uncertain system obtained, we apply an integral tracking control and the guaranteed cost control to design a robust, stable, tracking control system. Finally, we show the effectiveness of our method through a numerical example.     

Event-triggered control for discrete-time multi-agent average consensus

We consider the average consensus problem for the multi-agent system in the discrete-time domain. Three triggering based control protocols are developed, which dictate the broadcast and control update instants of individual agents to alleviate communication and computational burden. Lyapunov-based design methods prescribe when agents should communicate and update their control so that the network converges to the average of agents' initial states. We start with a static version of the distributed event-triggering law and then generalize it so that it involves an internal auxiliary variable to regulate the threshold dynamically for each agent. The third protocol uses a self-triggering algorithm to avoid continuous listening wherein each agent estimates its next triggering time and broadcasts it to its neighbors at the current triggering time. Numerical simulations are shown to validate the efficacy of the proposed algorithms.     

Multiagent reinforcement learning applied to a chase problem in a continuous world

Reinforcement learning (RL) is one of the methods of solving problems defined in multiagent systems. In the real world, the state is continuous, and agents take continuous actions. Since conventional RL schemes are often defined to deal with discrete worlds, there are difficulties such as the representation of an RL evaluation function. In this article, we intend to extend an RL algorithm so that it is applicable to continuous world problems. This extension is done by a combination of an RL algorithm and a function approximator. We employ Q-learning as the RL algorithm, and a neural network model called the normalized Gaussian network as the function approximator. The extended RL method is applied to a chase problem in a continuous world. The experimental result shows that our RL scheme was successful. This work was presented in part at the Fifth International Symposium on Artificial Life and Robotics, Oita, Japan, January 26–28, 2000     

Minimum cost source location problem with vertex-connectivity requirements in digraphs

Given a digraph (or an undirected graph) G=(V,E) with a set V of vertices v with nonnegative real costs w(v), and a set E of edges and a positive integer k, we deal with the problem of finding a minimum cost subset SV such that, for each vertex vV−S, there are k vertex-disjoint paths from S to v. In this paper, we show that the problem can be solved by a greedy algorithm in time in a digraph (or in time in an undirected graph), where n=|V| and m=|E|. Based on this, given a digraph and two integers k and ℓ, we also give a polynomial time algorithm for finding a minimum cost subset SV such that for each vertex vV−S, there are k vertex-disjoint paths from S to v as well as ℓ vertex-disjoint paths from v to S.