システム制御情報学会論文誌
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
36 巻, 4 号
選択された号の論文の4件中1~4を表示しています
特集論文
  • 相澤 純平, 小蔵 正輝, 岸田 昌子, 若宮 直紀
    原稿種別: 論文
    2023 年 36 巻 4 号 p. 91-98
    発行日: 2023/04/15
    公開日: 2023/07/15
    ジャーナル フリー

    In model predictive control (MPC), the control input at each time point is determined by solving an optimization problem. Being optimization-based, MPC is known for its limited applicability to systems with complex dynamics. This technical gap could be solved by the recently proposed MPC method based on temporal deep unfolding. Deep unfolding is method derived from deep learning, and it is used to solve an optimization problem. Temporal Deep Unfolding-Based MPC’s effectiveness is not yet thoroughly evaluated in the literature. Therefore, in this paper, we evaluate the effectiveness of the method for multilink pendulum systems by simulation.

  • 福元 一真, 藤崎 泰正
    原稿種別: 論文
    2023 年 36 巻 4 号 p. 99-105
    発行日: 2023/04/15
    公開日: 2023/07/15
    ジャーナル フリー

    Stochastic approximation is an iterative algorithm for solving an unknown equation using noisy observation data. In this paper, we revisit a convergence condition of stochastic approximation for a linear equation, where the noise is assumed to be a sequence whose time average converges to zero. In this case, it is usually assumed that the noisy coefficient matrix of the equation is symmetric, while it is not assumed in this paper. Instead, we slightly strengthen the noise convergence and show that the stochastic approximation gives the exact solution of the equation under this novel condition. The proposed condition is useful for establishing a multi-parameter stochastic approximation.

  • 佐々木 亮平, 内藤 凜, 小西 克巳
    原稿種別: 論文
    2023 年 36 巻 4 号 p. 106-112
    発行日: 2023/04/15
    公開日: 2023/07/15
    ジャーナル フリー

    This paper proposes an acceleration technique using deep unfolding for a matrix completion problem (MCP), which is a problem of estimating missing entries of a matrix. Various algorithms have been proposed for this problem, and their recovery performances depend on parameters used in the algorithms. This paper focuses on the alternating gradient descent (AGD) algorithm for the MCP and shows that its performance depends on step size parameters. Then the deep unfolding is applied to the algorithm and provides a trainable AGD (TAGD) algorithm. Numerical examples show that TAGD algorithm achieves better performance than AGD algorithm.

一般論文
  • —参照操作量の提案
    酒井 裕太, 川口 夏樹, 佐藤 孝雄
    原稿種別: 論文
    2023 年 36 巻 4 号 p. 113-119
    発行日: 2023/04/15
    公開日: 2023/07/15
    ジャーナル フリー

    In the present study, the response of a reference manipulated-variable is estimated directly from data, and the controller parameters of a fixed structure controller are optimized so that a closed-loop system is close to a reference model. Since a regularization method is used in the response estimation method, the estimation accuracy is prevented from deteriorating due to noise effects. In the proposed data-driven design, a pre-filter is designed to compensate for the difference between a model-based model reference problem and the proposed data-driven objective function.

feedback
Top