Abolfazl Lavaei

Abolfazl Lavaei

Auto-generated profile, based on publicly available information

Abolfazl Lavaei

School of Computing Newcastle University United Kingdom

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 March 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ANAmeneh Nejati
Ameneh Nejati
ALAbolfazl Lavaei
Abolfazl Lavaei
PJPushpak Jagtap
Pushpak Jagtap
SSSadegh Soudjani
Sadegh Soudjani
MZMajid Zamani
Majid Zamani
This paper is concerned with a formal verification scheme for both discrete- and continuous-time deterministic systems with unknown mathematical models. The main target is to verify the safety of unknown systems based on the construction of barrier certificates via a set of data collected from trajectories of systems while providing an a-priori guaranteed confidence on the safety. In our proposed framework, we first cast the original safety problem as a robust convex program (RCP). Solving the proposed RCP is not tractable in general since the unknown model appears in one of the constraints. Instead, we collect finite numbers of data from trajectories of the system and provide a scenario convex program (SCP) corresponding to the original RCP. We then establish a probabilistic closeness between the optimal value of SCP and that of RCP, and as a result, we formally quantify the safety guarantee of unknown systems based on the number of data points and a required level of confidence. We propose our framework in both discrete-time and continuous-time settings. We illustrate the effectiveness of our proposed results by first applying them to an unknown continuous-time room temperature system. We verify that the temperature of the room maintains in a comfort zone with some desirable confidence by collecting data from trajectories of the system. To show the applicability of our techniques to higher dimensional systems with nonlinear dynamics, we then apply our results to a continuous-time nonlinear jet engine compressor and a discrete-time DC motor.

15 March 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ALAbolfazl Lavaei
Abolfazl Lavaei
MZMajid Zamani
Majid Zamani
This work is concerned with a compositional technique for the construction of finite abstractions ( a.k.a., finite Markov decision processes (MDPs)) for networks of discrete-time stochastic switched systems. We propose a framework based on a notion of stochastic simulation functions , using which one can quantify the probabilistic distance between original interconnected stochastic switched systems and their finite MDPs by leveraging dissipativity-type compositional conditions. We show that the proposed compositionality conditions can enjoy the structure of the interconnection topology and be potentially fulfilled independently of the number or gains of subsystems. We also propose an approach to construct finite MDPs together with their corresponding stochastic simulation functions for nonlinear stochastic switched systems satisfying some incremental passivity property. We show that for a particular class of nonlinear stochastic switched systems whose nonlinearities satisfy an incremental quadratic inequality, the aforementioned property can be readily checked by some linear matrix inequalities. To demonstrate the effectiveness of the proposed results, we apply our approaches to the following two different case studies: a road traffic network, and a fully interconnected network of nonlinear switched systems accepting different dissipativity properties.

5 July 2022 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
ALAbolfazl Lavaei
Abolfazl Lavaei
SSSadegh Soudjani
Sadegh Soudjani
EFEmilio Frazzoli
Emilio Frazzoli
MZMajid Zamani
Majid Zamani
This letter is concerned with a data-driven technique for constructing finite Markov decision processes (MDPs) as finite abstractions of discrete-time stochastic control systems with unknown dynamics while providing formal closeness guarantees. The proposed scheme is based on notions of stochastic bisimulation functions (SBF) to capture the probabilistic distance between state trajectories of an unknown stochastic system and those of finite MDP. In our proposed setting, we first reformulate corresponding conditions of SBF as a robust convex program (RCP). We then propose a scenario convex program (SCP) associated to the original RCP by collecting a finite number of data from trajectories of the system. We ultimately construct an SBF between the data-driven finite MDP and the unknown stochastic system with a given confidence level by establishing a probabilistic relation between optimal values of the SCP and the RCP. We also propose two different approaches for the construction of finite MDPs from data. We illustrate the efficacy of our results over a nonlinear jet engine compressor with unknown dynamics. We construct a data-driven finite MDP as a suitable substitute of the original system to synthesize controllers maintaining the system in a safe set with some probability of satisfaction and a desirable confidence level.

24 February 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ALAbolfazl Lavaei
Abolfazl Lavaei
SSSadegh Soudjani
Sadegh Soudjani
MZMajid Zamani
Majid Zamani
This paper is concerned with a compositional approach for constructing both infinite (reduced-order models) and finite abstractions (a.k.a. finite Markov decision processes) of large-scale interconnected discrete-time stochastic control systems. The proposed framework is based on the notion of stochastic simulation functions enabling us to use an abstract system as a substitution of the original one in the controller design process with guaranteed error bounds. In the first part of the paper, we derive sufficient small-gain type conditions for the compositional quantification of the probabilistic distance between the interconnection of stochastic control subsystems and that of their infinite abstractions. We then construct infinite abstractions together with their corresponding stochastic simulation functions for a class of discrete-time nonlinear stochastic control systems. In the second part of the paper, we leverage small-gain type conditions for the compositional construction of finite abstractions. We propose an approach to construct finite Markov decision processes (MDPs) as finite abstractions of the concrete models or their reduced-order versions satisfying

15 June 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MAMahathi Anand
Mahathi Anand
ALAbolfazl Lavaei
Abolfazl Lavaei
MZMajid Zamani
Majid Zamani
This article is concerned with a compositional approach for the construction of control barrier certificates for large-scale interconnected stochastic systems while synthesizing hybrid controllers against high-level logic properties. Our proposed methodology involves decomposition of interconnected systems into smaller subsystems and leverages the notion of control sub-barrier certificates of subsystems, enabling one to construct control barrier certificates of interconnected systems by employing some $\max$ -type small-gain conditions. The main goal is to synthesize hybrid controllers enforcing complex logic properties, including the ones represented by the accepting language of deterministic finite automata, while providing probabilistic guarantees on the satisfaction of given specifications in bounded-time horizons. To do so, we propose a systematic approach to first decompose high-level specifications into simple reachability tasks by utilizing automata corresponding to the complement of specifications. We then construct control sub-barrier certificates and synthesize local controllers for those simpler tasks and combine them to obtain a hybrid controller that ensures satisfaction of the complex specification with some lower bound on the probability of satisfaction. We finally apply our proposed techniques to a fully-interconnected Kuramoto network composed of 100 nonlinear oscillators.

9 April 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ALAbolfazl Lavaei
Abolfazl Lavaei
EFEmilio Frazzoli
Emilio Frazzoli
In this article, we propose a compositional scheme for the safety controller synthesis of stochastic switched networks with dwell-time conditions. The proposed framework is based on a notion of so-called transition subbarrier certificates constructed for each switched subsystem, by employing which one can compositionally synthesize safety controllers for interconnected networks over (in)finite time horizons. In our proposed scheme, we leverage dissipativity-type compositional conditions to compositionally construct transition barrier certificates for interconnected networks based on their corresponding subbarrier certificates of individual subsystems. We show that the provided compositionality conditions can utilize the structure of the interconnection topology and be potentially satisfied independently of the number or gains of subsystems. We then utilize the constructed transition barrier certificates and quantify upper bounds on the probability that the interconnected network reaches certain unsafe regions in (in)finite time horizons. For nonlinear stochastic systems with polynomial dynamics, we employ sum-of-squares (SOS) optimization programs to search for stochastic storage certificates of each switching mode with its independent supply rate . We then focus on a particular class of nonlinear stochastic switched systems whose nonlinearities satisfy some linear-growth restriction and propose a constructive approach to search for storage certificates of each mode via satisfying some matrix inequalities. We demonstrate our proposed results by applying them to a fully interconnected network of 400 nonlinear switched subsystems (totally 800 dimensions) accepting multiple supply rates and multiple storage certificates with dwell-time conditions.