T. Iwasaki’s research while affiliated with University of Virginia and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (4)


Analysis and synthesis of central pattern generators via multivariable harmonic balance
  • Conference Paper

July 2006

·

20 Reads

·

11 Citations

Proceedings of the American Control Conference

T. Iwasaki

The central pattern generator (CPG) provides a fundamental control mechanism underlying rhythmic motions in animal locomotion. We consider a class of CPGs modeled by a group of interconnected identical neurons. Based on the idea of multivariable harmonic balance, we show how the oscillation profile is related to the connectivity matrix that specifies the architecture and strengths of the interconnections. Specifically, the frequency, amplitudes, and phases are essentially encoded in terms of a pair of eigenvalue and eigenvector. This basic principle is used to estimate the oscillation profile of a given CPG and to determine the connectivity matrix that achieves a prescribed oscillation profile


Dynamic output feedback synthesis with general frequency domain specifications

July 2005

·

22 Reads

·

44 Citations

IFAC Proceedings Volumes

This paper considers a control synthesis problem for linear systems to meet design specifications given in terms of multiple frequency domain inequalities in (semi)finite ranges. Dynamic output feedback controllers of order equal to the plant are considered. A new multiplier expansion is proposed to convert the synthesis condition to a linear matrix inequality (LMI) condition through the linearizing change of variables by Scherer, Masubuchi, de Oliveira et al. In the single objective setting, the LMI condition may or may not be conservative, depending upon the choice of the basis for the multiplier expansion. We provide a qualification for the basis matrix to yield nonconservative LMI conditions. It turns out to be difficult to determine the basis matrix meeting such qualification in general. However, it is shown that qualified bases can be found for some cases, and that the qualification can be used to find reasonable choices of the basis for other cases. Finally, the synthesis method is applied to a multiple objective control problem for an active magnetic bearing to demonstrate its utility.


Fixed order controller design via generalized KYP lemma

October 2004

·

20 Reads

·

18 Citations

This paper proposes methods for fixed-order controller synthesis based on the generalized KYP (GKYP) lemma that provides a unified LMI characterization of frequency domain inequalities in (semi) finite frequency ranges for both continuous and discrete-time systems. We first show the GKYP lemma and how to use it for control system design including PID controller synthesis and controller order reduction with fixed poles. We then propose a recursive algorithm for fixed structure controller synthesis, where both the numerator and denominator are design parameters. We also provide a robust GKYP lemma to encompass the practical situations. The effectiveness of the proposed methods is verified by several numerical examples which include a practical application of tracking controller design for laser-driven micro-airplanes.


From Nyquist/Bode to GKYP design: design algorithms with CACSD tools

September 2004

·

26 Reads

·

11 Citations

The generalized Kalman-Yakubovich-Popov (GKYP) lemma provides a unified LMI characterization of frequency domain inequalities in (semi)finite frequency ranges for both continuous and discrete-time systems. We developed a GKYP design toolbox which automatically generates the corresponding LMIs for controller synthesis problems with GKYP lemma just by specifying multiple design specifications without any tedious programming. This paper explains the toolbox with design examples including controller reduction and pseudo-diagonalization for MIMO plants.

Citations (4)


... Proof: From the KYP Lemma [43], Σ CL 2 < γ CL holds if and only if there existsP ≥ 0 such that ...

Reference:

Fast Real-Time Reinforcement Learning for Partially-Observable Large-Scale Systems
Dynamic output feedback synthesis with general frequency domain specifications
  • Citing Conference Paper
  • July 2005

IFAC Proceedings Volumes

... Of particular interest is the synthesis of these systems to control a biologically inspired robot. Iwasaki has shown, using multivariable harmonic balance, that a CPG can be synthesized, with desired amplitude, phase, and frequency relationships between each neuron [6]. It has also been show that sensory feedback is sufficient for entrainment of the neural controls to the mechanical resonance. ...

Analysis and synthesis of central pattern generators via multivariable harmonic balance
  • Citing Conference Paper
  • July 2006

Proceedings of the American Control Conference

... In this work, Iwasaki and Hara generalized the KYP lemma by unifying several existing versions in a single theorem, allowing controller and filter synthesis problems to be posed through Frequency Domain Inequalities (FDI) in finite intervals for both continuous and discrete-time settings. The GKYP Lemma is later used in [13] and [14], where the controller synthesis problem for LTI systems is considered for specifications in terms of multiple frequency domain inequalities in (semi) finite ranges. The GKYP Lemma has also been used in fault detection problems, as seen in [15], where the concept is applied to improve the fault detection filter sensitivity and robustness against disturbances in certain frequency ranges. ...

From Nyquist/Bode to GKYP design: design algorithms with CACSD tools
  • Citing Conference Paper
  • September 2004

... The notion of curves on the complex plane is needed to state the GKYP lemma. Definition 1 [18]: A curve on the complex plane is a group of infinitely many points ξ(t) ∈ C continuously parametrized by t for t 0 ≤ t ≤ t f where t 0 , t f ∈ R∪{±∞}, and t 0 < t f . A set of complex numbers Ξ ⊆ C is said to represent a curve (or curves) if it is a union of a finite number of curve(s). ...

Fixed order controller design via generalized KYP lemma
  • Citing Conference Paper
  • October 2004