arXiv Open Access 2024

Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee

Luca Ballotta Geethu Joseph Irawati Rahul Thete

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

math.OC eess.SY

Penulis (3)

Luca Ballotta

Geethu Joseph

Irawati Rahul Thete

Format Sitasi

APA MLA BibTeX

Ballotta, L., Joseph, G., Thete, I.R. (2024). Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee. https://arxiv.org/abs/2407.12125

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓