Publications
If you can’t find the preprint you’re looking for below, please try on the TU Delft repository, ORCiD, or GoogleScholar via the linked logos above.
2023
1.
Adams, Steven; Ornia, Daniel Jarne; Jr., Manuel Mazo
A self-guided approach for navigation in a minimalistic foraging robotic swarm Journal Article
In: Autonomous Robots, pp. 1–16, 2023.
BibTeX | Tags: Robotics, SCARS
@article{adams2023self,
title = {A self-guided approach for navigation in a minimalistic foraging robotic swarm},
author = { Steven Adams and Daniel Jarne Ornia and Manuel Mazo Jr.},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
journal = {Autonomous Robots},
pages = {1–16},
publisher = {Springer US New York},
keywords = {Robotics, SCARS},
pubstate = {published},
tppubtype = {article}
}
2.
Delimpaltadakis, Giannis; Lahijanian, Morteza; Jr., Manuel Mazo; Laurenti, Luca
Interval Markov Decision Processes with Continuous Action-Spaces Proceedings Article
In: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control, pp. 1–10, 2023.
BibTeX | Tags: Formal methods, SENTIENT, Stochastic
@inproceedings{delimpaltadakis2023interval,
title = {Interval Markov Decision Processes with Continuous Action-Spaces},
author = { Giannis Delimpaltadakis and Morteza Lahijanian and Manuel Mazo Jr. and Luca Laurenti},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
booktitle = {Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control},
pages = {1–10},
keywords = {Formal methods, SENTIENT, Stochastic},
pubstate = {published},
tppubtype = {inproceedings}
}
3.
Coppola, Rudi; Peruffo, Andrea; Jr., Manuel Mazo
Data-driven abstractions for verification of deterministic systems Journal Article
In: IEEE Control Systems Letters (To appear), 2023.
BibTeX | Tags: Formal methods, Learning
@article{coppola2023data,
title = {Data-driven abstractions for verification of deterministic systems},
author = { Rudi Coppola and Andrea Peruffo and Manuel Mazo Jr.},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
journal = {IEEE Control Systems Letters (To appear)},
keywords = {Formal methods, Learning},
pubstate = {published},
tppubtype = {article}
}
4.
Gracia, Ibon; Boskos, Dimitris; Laurenti, Luca; Jr., Manuel Mazo
Distributionally robust strategy synthesis for switched stochastic systems Best Paper Proceedings Article
In: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control, pp. 1–10, 2023.
BibTeX | Tags: Formal methods, Stochastic
@inproceedings{gracia2023distributionally,
title = {Distributionally robust strategy synthesis for switched stochastic systems},
author = { Ibon Gracia and Dimitris Boskos and Luca Laurenti and Manuel Mazo Jr.},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
booktitle = {Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control},
pages = {1–10},
keywords = {Formal methods, Stochastic},
pubstate = {published},
tppubtype = {inproceedings}
}
5.
Peruffo, Andrea; Jr., Manuel Mazo
Poster: Convex Scenario Optimisation for ReLU Networks Proceedings Article
In: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control, pp. 1–2, 2023.
@inproceedings{peruffo2023poster,
title = {Poster: Convex Scenario Optimisation for ReLU Networks},
author = { Andrea Peruffo and Manuel Mazo Jr.},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
booktitle = {Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control},
pages = {1–2},
keywords = {Learning},
pubstate = {published},
tppubtype = {inproceedings}
}
6.
Krishna, Shankara Narayanan; Madnani, Khushraj; Jr., Manuel Mazo; Pandya, Paritosh
From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers Journal Article
In: Formal Aspects of Computing, vol. 35, no. 2, pp. 1–50, 2023.
BibTeX | Tags: Formal methods, SENTIENT
@article{krishna2023non,
title = {From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers},
author = { Shankara Narayanan Krishna and Khushraj Madnani and Manuel Mazo Jr. and Paritosh Pandya},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
journal = {Formal Aspects of Computing},
volume = {35},
number = {2},
pages = {1–50},
publisher = {ACM New York, NY},
keywords = {Formal methods, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
2022
7.
Verdier, Cees Ferdinand; Kochdumper, Niklas; Althoff, Matthias; Jr., Manuel Mazo
Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications Journal Article
In: Automatica, vol. 139, 2022, ISSN: 0005-1098.
Abstract | BibTeX | Tags: CADUSY, Formal methods | Links:
@article{VerdierAlthof22,
title = {Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications},
author = {Cees Ferdinand Verdier and Niklas Kochdumper and Matthias Althoff and Manuel {Mazo Jr.}},
url = {https://www.sciencedirect.com/science/article/pii/S0005109822000292
https://arxiv.org/abs/2006.04260},
doi = {10.1016/j.automatica.2022.110184},
issn = {0005-1098},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
journal = {Automatica},
volume = {139},
publisher = {Elsevier},
abstract = {We propose a counterexample-guided inductive synthesis framework for the formal synthesis of closed-form sampled-data controllers for nonlinear systems to meet STL specifications over finite-time trajectories. Rather than stating the STL specification for a single initial condition, we consider an (infinite and bounded) set of initial conditions. Candidate solutions are proposed using genetic programming, which evolves controllers based on a finite number of simulations. Subsequently, the best candidate is verified using reachability analysis; if the candidate solution does not satisfy the specification, an initial condition violating the specification is extracted as a counterexample. Based on this counterexample, candidate solutions are refined until eventually a solution is found (or a user-specified number of iterations is met). The resulting sampled-data controller is expressed as a closed-form expression, enabling both interpretability and the implementation in embedded hardware with limited memory and computation power. The effectiveness of our approach is demonstrated for multiple systems.},
keywords = {CADUSY, Formal methods},
pubstate = {published},
tppubtype = {article}
}
We propose a counterexample-guided inductive synthesis framework for the formal synthesis of closed-form sampled-data controllers for nonlinear systems to meet STL specifications over finite-time trajectories. Rather than stating the STL specification for a single initial condition, we consider an (infinite and bounded) set of initial conditions. Candidate solutions are proposed using genetic programming, which evolves controllers based on a finite number of simulations. Subsequently, the best candidate is verified using reachability analysis; if the candidate solution does not satisfy the specification, an initial condition violating the specification is extracted as a counterexample. Based on this counterexample, candidate solutions are refined until eventually a solution is found (or a user-specified number of iterations is met). The resulting sampled-data controller is expressed as a closed-form expression, enabling both interpretability and the implementation in embedded hardware with limited memory and computation power. The effectiveness of our approach is demonstrated for multiple systems.
8.
Ornia, Daniel Jarne; Jr., Manuel Mazo
Event-Based Communication in Distributed Q-Learning Proceedings Article
In: 2022 IEEE 61st Conference on Decision and Control (CDC), pp. 2379–2386, IEEE 2022.
BibTeX | Tags: Learning, Robotics, SENTIENT
@inproceedings{ornia2022event,
title = {Event-Based Communication in Distributed Q-Learning},
author = { Daniel Jarne Ornia and Manuel Mazo Jr.},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
booktitle = {2022 IEEE 61st Conference on Decision and Control (CDC)},
pages = {2379–2386},
organization = {IEEE},
keywords = {Learning, Robotics, SENTIENT},
pubstate = {published},
tppubtype = {inproceedings}
}
9.
de Albuquerque Gleizer, Gabriel; Jr., Manuel Mazo
Chaos and order in event-triggered control Journal Article
In: IEEE Transactions on Automatic Control, pp. 1-16, 2022.
BibTeX | Tags: Formal methods, NCS, SENTIENT | Links:
@article{gleizer2022chaos,
title = {Chaos and order in event-triggered control},
author = { Gabriel de Albuquerque Gleizer and Manuel Mazo Jr.},
doi = {10.1109/TAC.2023.3242334},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
journal = {IEEE Transactions on Automatic Control},
pages = {1-16},
keywords = {Formal methods, NCS, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
10.
Ornia, Daniel Jarne; Jr., Manuel Mazo
Robust Event-Driven Interactions in Cooperative Multi-agent Learning Proceedings Article
In: International Conference on Formal Modeling and Analysis of Timed Systems, pp. 281–297, Springer International Publishing Cham 2022.
BibTeX | Tags: Learning, Robotics, SENTIENT
@inproceedings{jarne2022robust,
title = {Robust Event-Driven Interactions in Cooperative Multi-agent Learning},
author = { Daniel Jarne Ornia and Manuel Mazo Jr.},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
booktitle = {International Conference on Formal Modeling and Analysis of Timed Systems},
pages = {281–297},
organization = {Springer International Publishing Cham},
keywords = {Learning, Robotics, SENTIENT},
pubstate = {published},
tppubtype = {inproceedings}
}
11.
Peruffo, Andrea; Jr., Manuel Mazo
Data-driven Abstractions with Probabilistic Guarantees for Linear PETC Systems Journal Article
In: IEEE Control Systems Letters, vol. 7, pp. 115–120, 2022.
BibTeX | Tags: Formal methods, Learning, NCS, SENTIENT
@article{peruffo2022data,
title = {Data-driven Abstractions with Probabilistic Guarantees for Linear PETC Systems},
author = { Andrea Peruffo and Manuel Mazo Jr.},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
journal = {IEEE Control Systems Letters},
volume = {7},
pages = {115–120},
publisher = {IEEE},
keywords = {Formal methods, Learning, NCS, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
12.
Delimpaltadakis, Giannis; Jr., Manuel Mazo
Abstracting the Traffic of Nonlinear Event-Triggered Control Systems Journal Article
In: IEEE Transactions on Automatic Control, 2022.
BibTeX | Tags: Formal methods, NCS, SENTIENT
@article{delimpaltadakis2022abstracting,
title = {Abstracting the Traffic of Nonlinear Event-Triggered Control Systems},
author = { Giannis Delimpaltadakis and Manuel Mazo Jr.},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
journal = {IEEE Transactions on Automatic Control},
publisher = {IEEE},
keywords = {Formal methods, NCS, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
2021
13.
Trobinger, Matteo; de A. Gleizer, Gabriel; Istomin, Timofei; Jr., Manuel Mazo; Murphy, Amy L.; Picco, Gian Pietro
The Wireless Control Bus: Enabling Efficient Multi-Hop Event-Triggered Control with Concurrent Transmissions Journal Article
In: ACM Transactions on Cyber-Physical Systems, vol. 6, no. 1, 2021, ISSN: 2378-962X.
Abstract | BibTeX | Tags: NCS, SENTIENT | Links:
@article{TCPS22,
title = {The Wireless Control Bus: Enabling Efficient Multi-Hop Event-Triggered Control with Concurrent Transmissions},
author = {Matteo Trobinger and Gabriel de A. Gleizer and Timofei Istomin and Manuel {Mazo Jr.} and Amy L. Murphy and Gian Pietro Picco},
url = {https://pure.tudelft.nl/ws/portalfiles/portal/112367363/3485467.pdf
https://dl.acm.org/doi/10.1145/3485467
https://arxiv.org/abs/2101.10961},
doi = {10.1145/3485467},
issn = {2378-962X},
year = {2021},
date = {2021-11-23},
urldate = {2022-01-01},
journal = {ACM Transactions on Cyber-Physical Systems},
volume = {6},
number = {1},
publisher = {Ässociation for Computing Machinery (ACM)},
abstract = {Event-triggered control (ETC) holds the potential to significantly improve the efficiency of wireless networked control systems. Unfortunately, its real-world impact has hitherto been hampered by the lack of a network stack able to transfer its benefits from theory to practice specifically by supporting the latency and reliability requirements of the aperiodic communication ETC induces. This is precisely the contribution of this article.Our Wireless Control Bus (WCB) exploits carefully orchestrated network-wide floods of concurrent transmissions to minimize overhead during quiescent, steady-state periods, and ensures timely and reliable collection of sensor readings and dissemination of actuation commands when an ETC triggering condition is violated. Using a cyber-physical testbed emulating a water distribution system controlled over a real-world multi-hop wireless network, we show that ETC over WCB achieves the same quality of periodic control at a fraction of the energy costs, therefore unleashing and concretely demonstrating its full potential for the first time.},
keywords = {NCS, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
Event-triggered control (ETC) holds the potential to significantly improve the efficiency of wireless networked control systems. Unfortunately, its real-world impact has hitherto been hampered by the lack of a network stack able to transfer its benefits from theory to practice specifically by supporting the latency and reliability requirements of the aperiodic communication ETC induces. This is precisely the contribution of this article.Our Wireless Control Bus (WCB) exploits carefully orchestrated network-wide floods of concurrent transmissions to minimize overhead during quiescent, steady-state periods, and ensures timely and reliable collection of sensor readings and dissemination of actuation commands when an ETC triggering condition is violated. Using a cyber-physical testbed emulating a water distribution system controlled over a real-world multi-hop wireless network, we show that ETC over WCB achieves the same quality of periodic control at a fraction of the energy costs, therefore unleashing and concretely demonstrating its full potential for the first time.
14.
de A. Gleizer, Gabriel; Jr., Manuel Mazo
Computing the sampling performance of event-triggered control Proceedings Article
In: Proceedings of the 24th International Conference on Hybrid Systems (HSCC 2021), Association for Computing Machinery (ACM), United States, 2021, (24th ACM International Conference on Hybrid Systems Computation and Control, HSCC 2021, held as part of the 14th Cyber Physical Systems and Internet-of-Things Week, CPS-IoT Week 2021 ; ).
Abstract | BibTeX | Tags: Formal methods, NCS, SENTIENT | Links:
@inproceedings{GleizerHSCC21,
title = {Computing the sampling performance of event-triggered control},
author = {Gabriel {de A. Gleizer} and Manuel {Mazo Jr.}},
url = {https://research.tudelft.nl/files/90951924/3447928.3456635.pdf
https://arxiv.org/abs/2103.00919
https://dl.acm.org/doi/10.1145/3447928.3456635},
doi = {10.1145/3447928.3456635},
year = {2021},
date = {2021-05-20},
urldate = {2021-05-20},
booktitle = {Proceedings of the 24th International Conference on Hybrid Systems (HSCC 2021)},
publisher = {Association for Computing Machinery (ACM)},
address = {United States},
abstract = {In the context of networked control systems, event-triggered control (ETC) has emerged as a major topic due to its alleged resource usage reduction capabilities. However, this is mainly supported by numerical simulations, and very little is formally known about the traffic generated by ETC. This work devises a method to estimate, and in some cases to determine exactly, the minimum average inter-sample time (MAIST) generated by periodic event-triggered control (PETC) of linear systems. The method involves abstracting the traffic model using a bisimulation refinement algorithm and finding the cycle of minimum average length in the graph associated to it. This always gives a lower bound to the actual MAIST. Moreover, if this cycle turns out to be related to a periodic solution of the closed-loop PETC system, the performance metric is exact.},
note = {24th ACM International Conference on Hybrid Systems Computation and Control, HSCC 2021, held as part of the 14th Cyber Physical Systems and Internet-of-Things Week, CPS-IoT Week 2021 ; },
keywords = {Formal methods, NCS, SENTIENT},
pubstate = {published},
tppubtype = {inproceedings}
}
In the context of networked control systems, event-triggered control (ETC) has emerged as a major topic due to its alleged resource usage reduction capabilities. However, this is mainly supported by numerical simulations, and very little is formally known about the traffic generated by ETC. This work devises a method to estimate, and in some cases to determine exactly, the minimum average inter-sample time (MAIST) generated by periodic event-triggered control (PETC) of linear systems. The method involves abstracting the traffic model using a bisimulation refinement algorithm and finding the cycle of minimum average length in the graph associated to it. This always gives a lower bound to the actual MAIST. Moreover, if this cycle turns out to be related to a periodic solution of the closed-loop PETC system, the performance metric is exact.
15.
Delimpaltadakis, Giannis; Laurenti, Luca; Jr., Manuel Mazo
Abstracting the Sampling Behaviour of Stochastic Linear Periodic Event-Triggered Control Systems Proceedings Article
In: Proceedings of the 60th IEEE Conference on Decision and Control (CDC 2021), pp. 1287–1294, IEEE, United States, 2021, ISBN: 978-1-6654-3659-5, (60th IEEE Conference on Decision and Control (CDC 2021) ; Conference date: 14-12-2021 Through 17-12-2021).
Abstract | BibTeX | Tags: Formal methods, NCS, SENTIENT, Stochastic | Links:
@inproceedings{DelimpaltadakisCDC21,
title = {Abstracting the Sampling Behaviour of Stochastic Linear Periodic Event-Triggered Control Systems},
author = {Giannis Delimpaltadakis and Luca Laurenti and Manuel {Mazo Jr.}},
url = {https://ieeexplore.ieee.org/document/9683751
https://arxiv.org/abs/2103.13839},
doi = {10.1109/CDC45484.2021.9683751},
isbn = {978-1-6654-3659-5},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {Proceedings of the 60th IEEE Conference on Decision and Control (CDC 2021)},
pages = {1287--1294},
publisher = {IEEE},
address = {United States},
abstract = {Recently, there have been efforts towards understanding the sampling behaviour of event-triggered control (ETC), for obtaining metrics on its sampling performance and predicting its sampling patterns. Finite-state abstractions, capturing the sampling behaviour of ETC systems, have proven promising in this respect. So far, such abstractions have been constructed for non-stochastic systems. Here, inspired by this framework, we abstract the sampling behaviour of stochastic narrow-sense linear periodic ETC (PETC) systems via Interval Markov Chains (IMCs). Particularly, we define functions over sequences of state-measurements and interevent times that can be expressed as discounted cumulative sums of rewards, and compute bounds on their expected values by constructing appropriate IMCs and equipping them with suitable rewards. Finally, we argue that our results are extendable to more general forms of functions, thus providing a generic framework to define and study various ETC sampling indicators.},
note = {60th IEEE Conference on Decision and Control (CDC 2021) ; Conference date: 14-12-2021 Through 17-12-2021},
keywords = {Formal methods, NCS, SENTIENT, Stochastic},
pubstate = {published},
tppubtype = {inproceedings}
}
Recently, there have been efforts towards understanding the sampling behaviour of event-triggered control (ETC), for obtaining metrics on its sampling performance and predicting its sampling patterns. Finite-state abstractions, capturing the sampling behaviour of ETC systems, have proven promising in this respect. So far, such abstractions have been constructed for non-stochastic systems. Here, inspired by this framework, we abstract the sampling behaviour of stochastic narrow-sense linear periodic ETC (PETC) systems via Interval Markov Chains (IMCs). Particularly, we define functions over sequences of state-measurements and interevent times that can be expressed as discounted cumulative sums of rewards, and compute bounds on their expected values by constructing appropriate IMCs and equipping them with suitable rewards. Finally, we argue that our results are extendable to more general forms of functions, thus providing a generic framework to define and study various ETC sampling indicators.
16.
Krishna, Shankara Narayanan; Madnani, Khushraj; Jr., Manuel Mazo; Pandya, Paritosh K.
Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers Proceedings Article
In: Huisman, Marieke; areanu, Corina Pu; Zhan, Naijun (Ed.): Formal Methods, pp. 182–199, Springer, 2021, ISBN: 978-3-030-90869-0, (24th International Symposium on Formal Methods, FM 2021 ; Conference date: 20-11-2021 Through 26-11-2021).
Abstract | BibTeX | Tags: Formal methods, SENTIENT | Links:
@inproceedings{MadnaniLNCS21,
title = {Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers},
author = {Shankara Narayanan Krishna and Khushraj Madnani and Manuel {Mazo Jr.} and Paritosh K. Pandya},
editor = {Marieke Huisman and Corina Pu areanu and Naijun Zhan},
url = {https://link.springer.com/chapter/10.1007/978-3-030-90870-6_10
https://arxiv.org/abs/2105.09534},
doi = {10.1007/978-3-030-90870-6_10},
isbn = {978-3-030-90869-0},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {Formal Methods},
pages = {182--199},
publisher = {Springer},
series = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
abstract = {Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking problem for these extensions is undecidable when both the future U and the past S modalities are used. In a classical result, the satisfiability checking for MITL[U,S], a non-punctual fragment of MTL[U,S], is shown to be decidable with EXPSPACE complete complexity. Given that this notion of non-punctuality does not recover decidability in the case of TPTL[U,S], we propose a generalization of non-punctuality called non-adjacency for TPTL[U,S], and focus on its 1-variable fragment, 1-TPTL[U,S]. While non-adjacent 1-TPTL[U,S] appears to be a very small fragment, it is strictly more expressive than MITL. As our main result, we show that the satisfiability checking problem for non-adjacent 1-TPTL[U,S] is decidable with EXPSPACE complete complexity.},
note = {24th International Symposium on Formal Methods, FM 2021 ; Conference date: 20-11-2021 Through 26-11-2021},
keywords = {Formal methods, SENTIENT},
pubstate = {published},
tppubtype = {inproceedings}
}
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking problem for these extensions is undecidable when both the future U and the past S modalities are used. In a classical result, the satisfiability checking for MITL[U,S], a non-punctual fragment of MTL[U,S], is shown to be decidable with EXPSPACE complete complexity. Given that this notion of non-punctuality does not recover decidability in the case of TPTL[U,S], we propose a generalization of non-punctuality called non-adjacency for TPTL[U,S], and focus on its 1-variable fragment, 1-TPTL[U,S]. While non-adjacent 1-TPTL[U,S] appears to be a very small fragment, it is strictly more expressive than MITL. As our main result, we show that the satisfiability checking problem for non-adjacent 1-TPTL[U,S] is decidable with EXPSPACE complete complexity.
17.
Delimpaltadakis, Giannis; Jr., Manuel Mazo
Isochronous partitions for region-based self-triggered control Journal Article
In: IEEE Transactions on Automatic Control, vol. 66, no. 3, pp. 1160–1173, 2021, ISSN: 0018-9286.
Abstract | BibTeX | Tags: NCS, SENTIENT | Links:
@article{DelimpaltadakisTAC21,
title = {Isochronous partitions for region-based self-triggered control},
author = {Giannis Delimpaltadakis and Manuel {Mazo Jr.}},
url = {https://research.tudelft.nl/files/88167792/09091336_1.pdf
https://arxiv.org/abs/1904.08788
https://ieeexplore.ieee.org/document/9091336},
doi = {10.1109/TAC.2020.2994020},
issn = {0018-9286},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
journal = {IEEE Transactions on Automatic Control},
volume = {66},
number = {3},
pages = {1160--1173},
publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
abstract = {In this article, we propose a region-based self-triggered control (STC) scheme for nonlinear systems. The state space is partitioned into a finite number of regions, each of which is associated to a uniform interevent time. The controller, at each sampling time instant, checks to which region does the current state belong, and correspondingly decides the next sampling time instant. To derive the regions along with their corresponding interevent times, we use approximations of isochronous manifolds, a notion first introduced in Anta and Tabuada (2012). This article addresses some theoretical issues of Anta and Tabuada (2012) and proposes an effective computational approach that generates approximations of isochronous manifolds, thus enabling the region-based STC scheme. The efficiency of both our theoretical results and the proposed algorithm is demonstrated through simulation examples.},
keywords = {NCS, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
In this article, we propose a region-based self-triggered control (STC) scheme for nonlinear systems. The state space is partitioned into a finite number of regions, each of which is associated to a uniform interevent time. The controller, at each sampling time instant, checks to which region does the current state belong, and correspondingly decides the next sampling time instant. To derive the regions along with their corresponding interevent times, we use approximations of isochronous manifolds, a notion first introduced in Anta and Tabuada (2012). This article addresses some theoretical issues of Anta and Tabuada (2012) and proposes an effective computational approach that generates approximations of isochronous manifolds, thus enabling the region-based STC scheme. The efficiency of both our theoretical results and the proposed algorithm is demonstrated through simulation examples.
18.
Delimpaltadakis, Giannis; Jr., Manuel Mazo
Region-Based Self-Triggered Control for Perturbed and Uncertain Nonlinear Systems Journal Article
In: IEEE Transactions on Control of Network Systems, vol. 8, no. 2, pp. 757–768, 2021, ISSN: 2325-5870.
Abstract | BibTeX | Tags: NCS, SENTIENT | Links:
@article{DelimpaltadakisTCNS21,
title = {Region-Based Self-Triggered Control for Perturbed and Uncertain Nonlinear Systems},
author = {Giannis Delimpaltadakis and Manuel {Mazo Jr.}},
url = {https://research.tudelft.nl/files/97439855/Region_Based_Self_Triggered_Control_for_Perturbed_and_Uncertain_Nonlinear_Systems.pdf
https://arxiv.org/abs/2005.00473
https://ieeexplore.ieee.org/document/9317821},
doi = {10.1109/TCNS.2021.3050121},
issn = {2325-5870},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
journal = {IEEE Transactions on Control of Network Systems},
volume = {8},
number = {2},
pages = {757--768},
publisher = {IEEE Control Systems Society},
abstract = {In this work, we derive a region-based self-triggered control (STC) scheme for nonlinear systems with bounded disturbances and model uncertainties. The proposed STC scheme is able to guarantee different performance specifications (e.g. stability, boundedness, etc.), depending on the event-triggered control (ETC) triggering function that is chosen to be emulated. To deal with disturbances and uncertainties, we employ differential inclusions (DIs). By introducing ETC/STC notions in the context of DIs, we extend well-known results on ETC/STC to perturbed uncertain systems. Given these results, and adapting tools from our previous work, we derive inner-approximations of isochronous manifolds of perturbed uncertain ETC systems. These approximations dictate a partition of the state-space into regions, each of which is associated to a uniform inter-sampling time. At each sampling time instant, the controller checks to which region the measured state belongs and correspondingly decides the next sampling instant.},
keywords = {NCS, SENTIENT},
pubstate = {published},
tppubtype = {article}
}
In this work, we derive a region-based self-triggered control (STC) scheme for nonlinear systems with bounded disturbances and model uncertainties. The proposed STC scheme is able to guarantee different performance specifications (e.g. stability, boundedness, etc.), depending on the event-triggered control (ETC) triggering function that is chosen to be emulated. To deal with disturbances and uncertainties, we employ differential inclusions (DIs). By introducing ETC/STC notions in the context of DIs, we extend well-known results on ETC/STC to perturbed uncertain systems. Given these results, and adapting tools from our previous work, we derive inner-approximations of isochronous manifolds of perturbed uncertain ETC systems. These approximations dictate a partition of the state-space into regions, each of which is associated to a uniform inter-sampling time. At each sampling time instant, the controller checks to which region the measured state belongs and correspondingly decides the next sampling instant.
19.
de A. Gleizer, Gabriel; Madnani, K. N.; Jr., Manuel Mazo
Self-Triggered Control for Near-Maximal Average Inter-Sample Time Proceedings Article
In: Proceedings of the 60th IEEE Conference on Decision and Control (CDC 2021), pp. 1308–1313, IEEE, Ünited States, 2021, ISBN: 978-1-6654-3659-5, (60th IEEE Conference on Decision and Control (CDC 2021) ; Conference date: 14-12-2021 Through 17-12-2021).
Abstract | BibTeX | Tags: Formal methods, NCS, SENTIENT | Links:
@inproceedings{GleizerCDC21,
title = {Self-Triggered Control for Near-Maximal Average Inter-Sample Time},
author = {Gabriel de A. Gleizer and K. N. Madnani and Manuel {Mazo Jr.}},
url = {https://arxiv.org/abs/2105.03110
https://ieeexplore.ieee.org/document/9682986},
doi = {10.1109/CDC45484.2021.9682986},
isbn = {978-1-6654-3659-5},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {Proceedings of the 60th IEEE Conference on Decision and Control (CDC 2021)},
pages = {1308--1313},
publisher = {IEEE},
address = {Ünited States},
abstract = {Self-triggered control (STC) is a sample-and-hold control method aimed at reducing communications in networked-control systems; however, existing STC mechanisms often maximize how late the next sample is, thus not optimizing sampling performance in the long-term. In this work, we devise a method to construct self-triggered policies that provide near-maximal average inter-sample time (AIST) while respecting given control performance constraints. To achieve this, we rely on finite-state abstractions of a reference event-triggered control, while also allowing earlier samples. These early triggers constitute controllable actions of the abstraction, for which an AIST-maximizing strategy can be obtained by solving a mean-payoff game. We provide optimality bounds, and how to further improve them through abstraction refinement techniques.},
note = {60th IEEE Conference on Decision and Control (CDC 2021) ; Conference date: 14-12-2021 Through 17-12-2021},
keywords = {Formal methods, NCS, SENTIENT},
pubstate = {published},
tppubtype = {inproceedings}
}
Self-triggered control (STC) is a sample-and-hold control method aimed at reducing communications in networked-control systems; however, existing STC mechanisms often maximize how late the next sample is, thus not optimizing sampling performance in the long-term. In this work, we devise a method to construct self-triggered policies that provide near-maximal average inter-sample time (AIST) while respecting given control performance constraints. To achieve this, we rely on finite-state abstractions of a reference event-triggered control, while also allowing earlier samples. These early triggers constitute controllable actions of the abstraction, for which an AIST-maximizing strategy can be obtained by solving a mean-payoff game. We provide optimality bounds, and how to further improve them through abstraction refinement techniques.
2020
20.
Delimpaltadakis, Giannis; Jr., Manuel Mazo
Traffic Abstractions of Nonlinear Homogeneous Event-Triggered Control Systems Proceedings Article
In: Proceedings of the 59th IEEE Conference on Decision and Control, pp. 4991–4998, IEEE, 2020.
Abstract | BibTeX | Tags: Formal methods, NCS, SENTIENT | Links:
@inproceedings{DelimpCDC20,
title = {Traffic Abstractions of Nonlinear Homogeneous Event-Triggered Control Systems},
author = {Giannis Delimpaltadakis and Manuel {Mazo Jr.}},
url = {https://mmazojr.3me.tudelft.nl/wp-content/uploads/2020/09/final2.pdf
https://research.tudelft.nl/files/87240321/09303968.pdf
https://ieeexplore.ieee.org/document/9303968
https://arxiv.org/abs/2003.09361
},
doi = {10.1109/CDC42340.2020.9303968},
year = {2020},
date = {2020-12-15},
urldate = {2020-12-15},
booktitle = {Proceedings of the 59th IEEE Conference on Decision and Control},
pages = {4991--4998},
publisher = {IEEE},
abstract = {In previous work, linear time-invariant eventtriggered control (ETC) systems were abstracted to finite-state systems that capture the original systems{textquoteright} sampling behaviour. It was shown that these abstractions can be employed for scheduling of communication traffic in networks of ETC loops. In this paper, we extend this framework to the class of nonlinear homogeneous systems, however adopting a different approach in a number of steps. Finally, we discuss how the proposed methodology could be extended to general nonlinear systems},
keywords = {Formal methods, NCS, SENTIENT},
pubstate = {published},
tppubtype = {inproceedings}
}
In previous work, linear time-invariant eventtriggered control (ETC) systems were abstracted to finite-state systems that capture the original systems{textquoteright} sampling behaviour. It was shown that these abstractions can be employed for scheduling of communication traffic in networks of ETC loops. In this paper, we extend this framework to the class of nonlinear homogeneous systems, however adopting a different approach in a number of steps. Finally, we discuss how the proposed methodology could be extended to general nonlinear systems