Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2606.00492 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918532743168000 |
|---|---|
| author | Chen, Tao Wang, Hongju Hu, Wenfeng |
| author_facet | Chen, Tao Wang, Hongju Hu, Wenfeng |
| contents | This paper characterizes the triggering behaviors of event-triggered control systems from a geometric-algebraic perspective. We first model the feasibility of inter-event time transition relations as a nonconvex quadratic constraint satisfaction problem and reformulate it as an equivalent linear cone problem, which provides a clearer geometric description of the feasible region, making subsequent analysis more reliable. Building on this formulation, we establish necessary and sufficient conditions that rigorously determine whether a given transition relation is feasible. Based on this condition, we propose an algorithm that computes the set of all feasible transition relations. Numerical simulations further demonstrate how the feasibility of specific transitions evolves with the control parameter σ, with visualizations of the feasible state space offering intuitive insight into parameter selection and system design. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00492 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Traffic Characterization of Event-Triggered Control Systems: A Geometric-Algebraic Perspective Chen, Tao Wang, Hongju Hu, Wenfeng Systems and Control This paper characterizes the triggering behaviors of event-triggered control systems from a geometric-algebraic perspective. We first model the feasibility of inter-event time transition relations as a nonconvex quadratic constraint satisfaction problem and reformulate it as an equivalent linear cone problem, which provides a clearer geometric description of the feasible region, making subsequent analysis more reliable. Building on this formulation, we establish necessary and sufficient conditions that rigorously determine whether a given transition relation is feasible. Based on this condition, we propose an algorithm that computes the set of all feasible transition relations. Numerical simulations further demonstrate how the feasibility of specific transitions evolves with the control parameter σ, with visualizations of the feasible state space offering intuitive insight into parameter selection and system design. |
| title | Traffic Characterization of Event-Triggered Control Systems: A Geometric-Algebraic Perspective |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2606.00492 |