Shun-Ichi Azuma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shun-Ichi Azuma has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Toshiharu Sugie
Komatsu MIRAI Construction Equipment Cooperative Research Center, Graduate School of Engineering, Osaka University, Osaka, Japan
25 shared publications - Ryo Ariizumi
Department of Mechanical Systems Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
15 shared publications - Toru Asai
Department of Mechanical Engineering, College of Engineering, Chubu University, Kasugai 487-8501, Japan
15 shared publications - Masaaki Nagahara
Hiroshima University
10 shared publications - Jun-Ichi Imura
Department of Systems and Control Engineering, School of Engineering, Institute of Science Tokyo
8 shared publications - Hyo-Sung Ahn
Gwangju Institute of Science and Technology (GIST)
6 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7489-7496
Asymptotic Stability in Distribution for Logical Networks Under Probabilistic Flipping Control
In this paper, we investigate the long-term behavior of logical networks under probabilistic flipping control, where only a small subset of nodes is actuated with nonzero flipping probabilities. The resulting dynamics can be modeled as a finite-state Markov chain, enabling stability analysis at the level of asymptotic state distributions rather than convergence to individual states. By exploiting the structural invariance induced by non-actuated nodes, the state space admits a decomposition that allows recurrent closed components and their aperiodic structures to be identified without constructing the full transition probability matrix. Based on this characterization, a criterion for asymptotic stability in distribution with respect to a target subset is established. Simulations on biological networks demonstrate the ability of the proposed approach to capture and shape long-term behaviors under localized probabilistic flipping control.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7489-7496
Asymptotic Stability in Distribution for Logical Networks Under Probabilistic Flipping Control
In this paper, we investigate the long-term behavior of logical networks under probabilistic flipping control, where only a small subset of nodes is actuated with nonzero flipping probabilities. The resulting dynamics can be modeled as a finite-state Markov chain, enabling stability analysis at the level of asymptotic state distributions rather than convergence to individual states. By exploiting the structural invariance induced by non-actuated nodes, the state space admits a decomposition that allows recurrent closed components and their aperiodic structures to be identified without constructing the full transition probability matrix. Based on this characterization, a criterion for asymptotic stability in distribution with respect to a target subset is established. Simulations on biological networks demonstrate the ability of the proposed approach to capture and shape long-term behaviors under localized probabilistic flipping control.
- Open Access
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 643-648
Characterization of Exchange Rules for Consensus Control Driven by Value Exchange With Unknown Networks
In practical multi-agent systems, agents are self-interested and may require incentives to exchange information with others. Examples include energy exchange among independently operated microgrids and participatory sensing. In such systems, it is natural to consider that agents can be modeled as systems driven by the exchange of valuable resources. In our previous work, we have formulated a model of such value exchange multi-agent systems where each agent, modeled as a first-order integrator, possesses tokens and exchanges them for information. Furthermore, we have provided a necessary and sufficient condition for consensus of the system with a specific value exchange rule. As a next step, we aim to clarify the common properties of exchange rules that guarantee consensus. To this end, we introduce the notion of fairness, which requires that agents exchange with all their neighbors simultaneously, and we show that the fairness of all agents is a necessary and sufficient condition for consensus independently of the network topology.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 643-648
Open AccessCharacterization of Exchange Rules for Consensus Control Driven by Value Exchange With Unknown Networks
In practical multi-agent systems, agents are self-interested and may require incentives to exchange information with others. Examples include energy exchange among independently operated microgrids and participatory sensing. In such systems, it is natural to consider that agents can be modeled as systems driven by the exchange of valuable resources. In our previous work, we have formulated a model of such value exchange multi-agent systems where each agent, modeled as a first-order integrator, possesses tokens and exchanges them for information. Furthermore, we have provided a necessary and sufficient condition for consensus of the system with a specific value exchange rule. As a next step, we aim to clarify the common properties of exchange rules that guarantee consensus. To this end, we introduce the notion of fairness, which requires that agents exchange with all their neighbors simultaneously, and we show that the fairness of all agents is a necessary and sufficient condition for consensus independently of the network topology.
- Open Access
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2651-2656
Data Informativity for Analysis and Design of Positive Systems
This paper studies data informativity of positive systems using linear programming (LP). The concept called data informativity represents the sufficiency of a given dataset to solve analysis/design problems. We provide the necessary and sufficient conditions for the data-driven analysis and design problems of positive systems to be solvable. Moreover, we clarify that these conditions are characterized by LP problems. We provide numerical examples to demonstrate the effectiveness of our approaches.
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2651-2656
Open AccessData Informativity for Analysis and Design of Positive Systems
This paper studies data informativity of positive systems using linear programming (LP). The concept called data informativity represents the sufficiency of a given dataset to solve analysis/design problems. We provide the necessary and sufficient conditions for the data-driven analysis and design problems of positive systems to be solvable. Moreover, we clarify that these conditions are characterized by LP problems. We provide numerical examples to demonstrate the effectiveness of our approaches.
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (5) , 3058-3073
Polynomial-Complexity Distributed Approaches for Reachability of Symmetric Boolean Networks
Symmetric Boolean networks (SBNs) are a class of binary-valued dynamical systems, where the couplings in logical iteration formulas (LIFs) are equally constrained within symmetric logic operators. Its evolution can remain invariant under arbitrary perturbation of literals in LIFs, generating important applications in cryptography, software design, and threshold-based gene regulation. Building upon this property, we develop a novel distributed approach from $(n\times n)$-dimensional dependence matrix to construct the explicit formulas and iterative algorithms for judging reachability of SBNs. Compared with traditional approaches based on $(2^{n}\times 2^{n})$-dimensional state transition matrix, the complexity is markedly reduced from $O(K2^{2n})$ to $O(Kn^{3})$. We also demonstrate that the developed approach owns interactivity, reversibility, and scalability. Moreover, for SBNs with unreachable target states, optimal pinning controllers are designed to efficiently achieve the reachable goal. In addition, a new theoretical framework is established to deal with the unitary and three kinds of distributed time-varying delays in SBNs. Improved criteria from the pruned trees method and a combined algorithm are further constructed to determine reachability under these delay conditions. Finally, we validate applications of the theoretical results on a cholesterol regulatory pathway network and a delayed cellular shape-dependent regulatory network.
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (5) , 3058-3073
Polynomial-Complexity Distributed Approaches for Reachability of Symmetric Boolean Networks
Symmetric Boolean networks (SBNs) are a class of binary-valued dynamical systems, where the couplings in logical iteration formulas (LIFs) are equally constrained within symmetric logic operators. Its evolution can remain invariant under arbitrary perturbation of literals in LIFs, generating important applications in cryptography, software design, and threshold-based gene regulation. Building upon this property, we develop a novel distributed approach from $(n\times n)$-dimensional dependence matrix to construct the explicit formulas and iterative algorithms for judging reachability of SBNs. Compared with traditional approaches based on $(2^{n}\times 2^{n})$-dimensional state transition matrix, the complexity is markedly reduced from $O(K2^{2n})$ to $O(Kn^{3})$. We also demonstrate that the developed approach owns interactivity, reversibility, and scalability. Moreover, for SBNs with unreachable target states, optimal pinning controllers are designed to efficiently achieve the reachable goal. In addition, a new theoretical framework is established to deal with the unitary and three kinds of distributed time-varying delays in SBNs. Improved criteria from the pruned trees method and a combined algorithm are further constructed to determine reachability under these delay conditions. Finally, we validate applications of the theoretical results on a cholesterol regulatory pathway network and a delayed cellular shape-dependent regulatory network.
- Open Access
- 28 October 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (21) , 3440
Necessary and Sufficient Reservoir Condition for Universal Reservoir Computing
We discuss necessary and sufficient conditions for universal approximation using reservoir computing. Reservoir computing is a machine learning method used to train a dynamical system model by tuning only the static part of the model. The universality is the ability of the model to approximate any dynamical system with any precision. In the previous studies, we provided two sufficient conditions for the universality. We employed the universality definition that has been discussed since the earliest studies on reservoir computing. In this present paper, we prove that these two conditions and the universality are equivalent to one another. Using this equivalence, we show that a universal model must have a “pathological” property that can only be achieved or approached by chaotic reservoirs.
- 28 October 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (21) , 3440
Open AccessNecessary and Sufficient Reservoir Condition for Universal Reservoir Computing
We discuss necessary and sufficient conditions for universal approximation using reservoir computing. Reservoir computing is a machine learning method used to train a dynamical system model by tuning only the static part of the model. The universality is the ability of the model to approximate any dynamical system with any precision. In the previous studies, we provided two sufficient conditions for the universality. We employed the universality definition that has been discussed since the earliest studies on reservoir computing. In this present paper, we prove that these two conditions and the universality are equivalent to one another. Using this equivalence, we show that a universal model must have a “pathological” property that can only be achieved or approached by chaotic reservoirs.
- Open Access
- 7 September 2025
- Published by Taylor & Francis in SICE Journal of Control, Measurement, and System Integration
- Vol. 18 (1)
Data-driven design of structured sparse feedback controllers
- 7 September 2025
- Published by Taylor & Francis in SICE Journal of Control, Measurement, and System Integration
- Vol. 18 (1)
Open AccessData-driven design of structured sparse feedback controllers
- Open Access
- 28 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
Localized Data-Driven Distributed Controller Design for Positive Stabilization
This paper proposes a localized data-driven distributed controller design method for positive stabilization of network systems. In particular, we consider a network system consisting of multiple unknown agents, each of which has a local controller to be designed. In addition, we assume that each agent has access to the local time-series data and communicates with neighboring agents. In this situation, we address the problem of finding a protocol in which each agent autonomously updates its local controller such that the entire network system is positive and stable. In this paper, we provide a solution to the problem based on the projected consensus algorithm.
- 28 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
Open AccessLocalized Data-Driven Distributed Controller Design for Positive Stabilization
This paper proposes a localized data-driven distributed controller design method for positive stabilization of network systems. In particular, we consider a network system consisting of multiple unknown agents, each of which has a local controller to be designed. In addition, we assume that each agent has access to the local time-series data and communicates with neighboring agents. In this situation, we address the problem of finding a protocol in which each agent autonomously updates its local controller such that the entire network system is positive and stable. In this paper, we provide a solution to the problem based on the projected consensus algorithm.
- Open Access
- 31 October 2024
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 162
Default detection in demand response based on block-sparse structure
- 31 October 2024
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 162
Open AccessDefault detection in demand response based on block-sparse structure
- 9 September 2024
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 22 (10) , 3133-3146
The Dynamical Model and the Slithering Controller of Continuous Snakelike Robot on Smooth Surface
- 9 September 2024
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 22 (10) , 3133-3146
The Dynamical Model and the Slithering Controller of Continuous Snakelike Robot on Smooth Surface
- 13 August 2024
- Published by Springer Nature
- p. 207-224
Viral Spreading Phenomenon