Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee
<|reference_start|>Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee: This paper considers the design of sparse actuator schedules for linear time-invariant systems. An actuator schedule selects, for each time instant, which control inputs act on the system in that instant. We address the optimal scheduling of control inputs under a hard constraint on the number of inputs that can be used at each time. For a sparsely controllable system, we characterize sparse actuator schedules that make the system controllable, and then devise a greedy selection algorithm that guarantees controllability while heuristically providing low control effort. We further show how to enhance our greedy algorithm via Markov chain Monte Carlo-based randomized optimization<|reference_end|>
@article{ballotta2024pointwise-sparse,
    title={Pointwise-Sparse Actuator Scheduling for Linear Systems with
  Controllability Guarantee},
    author={Luca Ballotta and Geethu Joseph and Irawati Rahul Thete},
    journal={arXiv preprint arXiv:2407.12125},
    year={2024},
    doi={10.1109/LCSYS.2024.3475886},
    archivePrefix={arXiv},
    eprint={2407.12125},
    primaryClass={math.OC cs.SY eess.SY}
}