Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2311.05653 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917569186758656 |
|---|---|
| author | Joseph, Geethu Moothedath, Shana Lin, Jiabin |
| author_facet | Joseph, Geethu Moothedath, Shana Lin, Jiabin |
| contents | This paper studies the problem of modifying the input matrix of a structured system to make the system strongly structurally controllable. We focus on the generalized structured systems that rely on zero/nonzero/arbitrary structure, i.e., some entries of system matrices are zeros, some are nonzero, and the remaining entries can be zero or nonzero (arbitrary). We analyze the feasibility of the problem, and if it is feasible, we reformulate it into another equivalent problem. This new formulation leads to a greedy heuristic algorithm. However, we also show that the greedy algorithm can give arbitrarily poor solutions for some special systems. Our alternative approach is a randomized Markov chain Monte Carlo-based algorithm. Unlike the greedy algorithm, this algorithm is guaranteed to converge to an optimal solution with high probability. Finally, we numerically evaluate the algorithms on random graphs to show that the algorithms perform well. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_05653 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Minimal Input Structural Modifications for Strongly Structural Controllability Joseph, Geethu Moothedath, Shana Lin, Jiabin Systems and Control This paper studies the problem of modifying the input matrix of a structured system to make the system strongly structurally controllable. We focus on the generalized structured systems that rely on zero/nonzero/arbitrary structure, i.e., some entries of system matrices are zeros, some are nonzero, and the remaining entries can be zero or nonzero (arbitrary). We analyze the feasibility of the problem, and if it is feasible, we reformulate it into another equivalent problem. This new formulation leads to a greedy heuristic algorithm. However, we also show that the greedy algorithm can give arbitrarily poor solutions for some special systems. Our alternative approach is a randomized Markov chain Monte Carlo-based algorithm. Unlike the greedy algorithm, this algorithm is guaranteed to converge to an optimal solution with high probability. Finally, we numerically evaluate the algorithms on random graphs to show that the algorithms perform well. |
| title | Minimal Input Structural Modifications for Strongly Structural Controllability |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2311.05653 |