#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1997

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Myung-Gon Yoon
- 2000

The paper`¸ optimal control of SISO continuous-time systemsa by Wang and Sznaier (Wang & Sznaier (1997). Automatica, 33 (1), 85}90) studies the problem of designing a controller that optimally minimizes the peak absolute value of system output, due to a "xed input signal. With a newly de"ned function space A , it was claimed that the set of all¸-bounded… (More)

- Myung-Gon Yoon, Valery A. Ugrinovskii, Ian R. Petersen
- Systems & Control Letters
- 2004

We study a ÿnite-horizon robust minimax ÿltering problem for time-varying discrete-time stochastic uncertain systems. The uncertainty in the system is characterized by a set of probability measures under which the stochastic noises, driving the system, are deÿned. The optimal minimax ÿlter has been found by applying techniques of risk-sensitive LQG control.… (More)

- Myung-Gon Yoon, Koji Tsumura
- Automatica
- 2011

- Myung-Gon Yoon, Valery A. Ugrinovskii, Marek Pszczel
- IEEE Trans. Automat. Contr.
- 2007

it results 0p = 4. If we adopt pc1, simply obtained from (1) and (2), we have 1 = 11; notice that the CT of the closed-loop net remains equal to 4. By optimizing 1 w.r.t. the set of constraints (12) the optimal monitor place, that does not increase the closed loop net CT, results p c3 with a cost 1 3 = 9. We remark that, since by adding p c1 or p c3 the… (More)

- Myung-Gon Yoon, Valery A. Ugrinovskii, Ian R. Petersen
- Automatica
- 2005

- Myung-Gon Yoon
- IEEE Trans. Automat. Contr.
- 2001

- Myung-Gon Yoon
- Systems & Control Letters
- 2001

- Myung-Gon Yoon, Beom Hee Lee
- Automatica
- 1997

- Myung-Gon Yoon
- Automatica
- 2000

Connected graphs whose eigenvalues are distinct and main are called control-lable graphs in view of certain applications in control theory. We give some general characterizations of the controllable graphs whose least eigenvalue is bounded from below by −2; in particular, we determine all the controllable exceptional graphs. We also investigate the… (More)