16 citations · 18 across the 3 of their papers we have counts for
3 papers
math.OC2022★ 2 cited
Matrix Pontryagin principle approach to controllability metrics maximization under sparsity constraints
Tomofumi Ohtsuka, Takuya Ikeda, Kenji Kashima
Controllability maximization problem under sparsity constraints is a node selection problem that selects inputs that are effective for control in order to minimize the energy to co…
math.OC2021★ 16 cited
Sparse optimal stochastic control
Kaito Ito, Takuya Ikeda, Kenji Kashima
In this paper, we investigate a sparse optimal control of continuous-time stochastic systems. We adopt the dynamic programming approach and analyze the optimal control via the valu…
math.OC2021
Multiple sparsity constrained control node scheduling with application to rebalancing of mobility networks
Takuya Ikeda, Kazunori Sakurama, Kenji Kashima
This paper treats an optimal scheduling problem of control nodes in networked systems. We newly introduce both the L0 and l0 constraints on control inputs to extract a time-varying…