• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.10-13
• /
• 1995

This paper considers the linear-quadratic optimal regulator problem for nonstandard singularly perturbed systems making use of the recursive technique. We first derive a generalized Riccati differential equation by the Hamilton-Jacobi equation. In order to obtain the feedback gain, we must solve the generalized algebraic Riccati equation. Using the recursive technique, we show that the solution of the generalized algebraic Riccati equation converges with the rate of convergence of O(.epsilon.). The existence of a bounded solution of error term can be proved by the implicit function theorem. It is enough to show that the corresponding Jacobian matrix is nonsingular at .epsilon. = 0. As a result, the solution of optimal regulator problem for nonstandard singularly perturbed systems can be obtained with an accuracy of O(.epsilon.$^{k}$ ). The proposed technique represents a significant improvement since the existing method for the standard singularly perturbed systems can not be applied to the nonstandard singularly perturbed systems.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.2
• /
• pp.140-148
• /
• 2000

This paper presents iterative schemes and continuation schemes for designing robust controllers which stabilize dynamic systems having bounded parametric uncertainties. Utilizing results of the cheap control problem, some existence conditions of the robust controller are obtained, which are different from the matching conditions. continuation schemes are used to overcome the divergence problem of iterative schemes. The roust controller design method is extended to nonlinear system ans easily implementable series solution is also obtained. Results are illustrated with simple examples.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.15-23
• /
• 2008

This paper considers the problem of delay-dependent guaranteed cost controller design for uncertain neutral systems with distributed delays. The system under consideration is subject to norm-bounded time-varying parametric uncertainty appearing in all the matrices of the state-space model. By constructing appropriate Lyapunov functionals and using matrix inequality techniques, a state feedback controller is designed such that the resulting closed-loop system is not only robustly stable but also guarantees an adequate level of performance for all admissible uncertainties. Furthermore, a convex optimization problem is introduced to minimize a specified cost bound. By matrix transformation techniques, the corresponding optimal guaranteed controller can be obtained by solving a linear matrix inequality. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.44-47
• /
• 1996

An optimal preview controller based on the discrete-time $H_{.inf}$ control is presented. The preview controller is synthesized by considering the bounded unknwon disturbances as well as previewable commands and disturbances. The controller derivation procedure is analogous to the LQ-based scheme. The designed preview gain matrix has a similar structure as the LQ-based one. As the infinity norm .gamma. of the transfer function matrix tends to .inf., the preview gains obtained by $H_{\infty}$ control method approach to the gains by the LQR. The LQ-based preview gains are verified to be subsets of the $H_{.inf}$ -based preview gains..

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.9
• /
• pp.2764-2781
• /
• 2024

Federated learning (FL) has been proposed as an emerging distributed machine learning framework, which lowers the risk of privacy leakage by training models without uploading original data. Therefore, it has been widely utilized in the Industrial Internet of Things (IIoT). Despite this, FL still faces challenges including the non-independent identically distributed (Non-IID) data and heterogeneity of devices, which may cause difficulties in model convergence. To address these issues, a local surrogate function is initially constructed for each device to ensure a smooth decline in global loss. Subsequently, aiming to minimize the system energy consumption, an FL approach for joint CPU frequency control and bandwidth allocation, called FCBAFL is proposed. Specifically, the maximum delay of a single round is first treated as a uniform delay constraint, and a limited-memory Broyden-Fletcher-Goldfarb-Shanno bounded (L-BFGS-B) algorithm is employed to find the optimal bandwidth allocation with a fixed CPU frequency. Following that, the result is utilized to derive the optimal CPU frequency. Numerical simulation results show that the proposed FCBAFL algorithm exhibits more excellent convergence compared with baseline algorithm, and outperforms other schemes in declining the energy consumption.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.745-764
• /
• 2002

In this paper we Study a time-optimal model of pursuit in which the players move on a plane with bounded velocities. This game is supposed to be a nonzero-sum group pursuit game. The main point of the work is to construct and compare cooperative and non-cooperative solutions in the game and make a conclusion about cooperation possibility in differential pursuit games. We consider all possible cooperations of the players in the game. For that purpose for every game $\Gamma(x_0,y_0,z_0)$ we construct the corresponding game in characteristic function form $\Gamma_v(x_0,y_0,z_0)$. We show that in this game there exists the nonempty core for any initial positions of the players. The core can take four various forms depending on initial positions of the players. We study how the core changes when the game is proceeding. For the original agreement (an imputation from the original core) to remain in force at each current instant t it is necessary for the core to be time-consistent. Nonemptiness of the core in any current subgame constructing along a cooperative trajectory and its time-consistency are shown. Finally, we discuss advantages and disadvantages of choosing this or that imputation from the core.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.1
• /
• pp.606-623
• /
• 2019

The path following problem of a ship sailing in restricted waters under wind effect is investigated based on Robust $H_{\infty}$ Guaranteed Cost Control (RHGCC). To design the controller, the ship maneuvering motion is modeled as a linear uncertain system with norm-bounded time-varying parametric uncertainty. To counteract the bank and wind effects, the integral of path error is augmented to the original system. Based on the extended linear uncertain system, sufficient conditions for existence of the RHGCC are given. To obtain an optimal robust $H_{\infty}$ guaranteed cost control law, a convex optimization problem with Linear Matrix Inequality (LMI) constraints is formulated, which minimizes the guaranteed cost of the close-loop system and mitigates the effect of external disturbance on the performance output. Numerical simulations have confirmed the effectiveness and robustness of the proposed control strategy for the path following goal of a ship sailing in restricted waters under wind effect.

• The Pure and Applied Mathematics
• /
• v.22 no.3
• /
• pp.275-283
• /
• 2015

Let T be a bounded linear operator on a complex Hilbert space H. For a positive integer k, an operator T is said to be a k-quasi-2-isometric operator if T^∗k(T^∗2T² − 2T^∗T + I)T^k = 0, which is a generalization of 2-isometric operator. In this paper, we consider basic structural properties of k-quasi-2-isometric operators. Moreover, we give some examples of k-quasi-2-isometric operators. Finally, we prove that generalized Weyl’s theorem holds for polynomially k-quasi-2-isometric operators.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.9
• /
• pp.1364-1372
• /
• 2017

In this paper, a problem of event-triggered model predictive control is investigated for continuous-time Takagi-Sugeno (T-S) fuzzy systems with input quantization. To efficiently utilize network resources, event-trigger is employed, which transmits limited signals satisfying the condition that the measurement of errors is over the ratio of a certain level. Considering sampling and quantization, continuous Takagi-Sugeno (T-S) fuzzy systems are regarded as a sector bounded continuous-time T-S fuzzy systems with input delay. Then, a model predictive controller (MPC) based on parallel distributed compensation (PDC) is designed to optimally stabilize the closed loop systems. The proposed MPC optimize the objective function over infinite horizon, which can be easily calculated and implemented solving linear matrix inequalities (LMIs) for every event-triggered time. The validity and effectiveness are shown that the event triggered MPC can stabilize well the systems with even smaller average sampling rate and limited actuator signal guaranteeing optimal performances through the numerical example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.