Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909487000977408 |
|---|---|
| author | Ballotta, Luca Joseph, Geethu Thete, Irawati Rahul |
| author_facet | Ballotta, Luca Joseph, Geethu Thete, Irawati Rahul |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_12125 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee Ballotta, Luca Joseph, Geethu Thete, Irawati Rahul Optimization and Control Systems and Control 93B51 (Primary) 93B05, 93C35, 93C55 (Secondary) 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 |
| title | Pointwise-Sparse Actuator Scheduling for Linear Systems with Controllability Guarantee |
| topic | Optimization and Control Systems and Control 93B51 (Primary) 93B05, 93C35, 93C55 (Secondary) |
| url | https://arxiv.org/abs/2407.12125 |