Mohammadreza Doostmohammadian

Prof. Mohammadreza Doostmohammadian

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
23 December 2021 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Open access
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian
ATAmin Taghieh
Amin Taghieh
HZHouman Zarrabi
Houman Zarrabi
This paper considers distributed estimation methods to enable the formation of Unmanned-Aerial-Vehicles (UAVs) that track a moving target. The UAVs (or agents) are equipped with communication devices to receive a beacon signal from the target and share information with neighboring UAVs. The shared information includes the time-of-arrival (TOA) of the beacon signal from the target and estimates on the target's location. Every UAV processes the received information from the neighbors using a single-time-scale distributed estimation protocol. This differs from multi-time-scale protocols that require (i) many consensus iterations on a-priori estimates, (ii) fast communication among agents (in general, much faster than the sampling rate of the target dynamics), and thus, more-costly communication equipment and processing units. Further, our approach outperforms most single-time-scale methods in terms of observability assumption as these methods assume that the target is observable via the measurement data received from neighboring UAVs (referred to as local-observability). This requires more communications among the sensors. In contrast, our approach is only based on global-observability assumption, and thus, requires less networking (only strong-connectivity) and communication traffic along with less computational load by data-processing once at the same time-scale of sampling target dynamics. We consider modified time-difference-of-arrival (TDOA) measurements with a constant output matrix for the linearized model. UAVs make a pre-specified formation, and by estimating the target's location via these measurements, move along with the target.

8 February 2013 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian
UKUsman A. Khan
Usman A. Khan
In this paper, we consider distributed estimation of linear, discrete-time dynamical systems monitored by a network of agents. We require the agents to exchange information with their neighbors only once per dynamical system time-scale and study the network topology sufficient for distributed observability. To this aim, we provide a novel measurement-based agent classification: Type- α,β, and γ, which leads to the construction of specific graph topologies: Gα and Gβ. In particular, in Gα, every Type-α agent has a direct connection to every other agent, whereas, in Gβ, every agent has a directed path to every Type-β agent. With the help of these constructs, we formulate an estimator where measurement and predictor-fusion are implemented over Gα and Gβ, respectively, and show that the proposed scheme leads to distributed observability, i.e., observability of the distributed estimator. In order to characterize the estimator further, we show that Type-α agents only exist in systems with S-rank (maximal rank of zero/non-zero pattern) deficient system matrices. In other words, systems with full S-rank matrices only have Type-β agents, and thus, a strongly-connected (agent) network is sufficient for full S-rank systems-by the definition of Gβ above; however strong-connectivity is not necessary, i.e., there exist weakly-connected networks that result in distributed observability. Furthermore, we show that for S -rank deficient systems, measurement-fusion over Gα is required, and predictor-fusion alone is insufficient. The approach taken in this paper is structural, i.e., we use the concept of structured systems theory and generic observability to derive the results. Finally, we provide an iterative method to compute the local estimator gain at each agent once the observability is ensured using the aforementioned construction.

29 November 2024 in Annual Reviews in Control
Verified
Journal Article
Closed access
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian
AAAlireza Aghasi
Alireza Aghasi
MPMohammad Pirani
Mohammad Pirani
ENEhsan Nekouei
Ehsan Nekouei
HZHouman Zarrabi
Houman Zarrabi
KJKarl H. Johansson
Karl H. Johansson

10 January 2020 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian
In this brief paper, a new consensus protocol based on the sign of innovations is proposed. Based on this protocol each agent only requires single-bit of information about its relative state to its neighboring agents. This is significant in real-time applications, since it requires less computation and/or communication load on agents. Using Lyapunov stability theorem the convergence is proved for networks having a spanning tree. Further, the convergence is shown to be in finite-time, which is significant as compared to most asymptotic protocols in the literature. Time-variant network topologies are also considered in this paper, and final consensus value is derived for undirected networks. Applications of the proposed consensus protocol in (i) 2D/3D rendezvous task, (ii) distributed estimation, (iii) distributed optimization, and (iv) formation control are considered and significance of applying this protocol is discussed. Numerical simulations are provided to compare the protocol with the existing protocols in the literature.

1 February 2011 in Scientia Iranica
Verified
Journal Article
Closed access
HSH. Sayyaadi
H. Sayyaadi
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian

25 May 2020 in IEEE Systems Journal
Verified
Journal Article
Closed access
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian
NMNader Meskin
Nader Meskin
Finite-time stability (FTS) of networked control systems under denial-of-service (DoS) attacks are investigated in this article, where the communication between the plant and the controller is compromised at some time intervals. Toward this goal, first an event-triggered mechanism based on the variation rate of the Lyapunov function is proposed such that the closed-loop system remains finite-time stable and at the same time, the amount data exchange in the network is reduced. Next, the vulnerability of the proposed event-triggered finite-time controller in the presence of DoS attacks are evaluated and sufficient conditions on the DoS duration and frequency are obtained to assure the finite-time stability of the closed-loop system in the presence of DoS attack, where no assumption on the DoS attack in terms of following a certain probabilistic or a well-structured periodic model is considered. Finally, the efficiency of the proposed approach is demonstrated through a simulation study.