Azwirman Gusrialdi

Azwirman Gusrialdi

Auto-generated profile, based on publicly available information

Azwirman Gusrialdi

Tampere University

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
12 January 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
AGAzwirman Gusrialdi
Azwirman Gusrialdi
ZQZhihua Qu
Zhihua Qu
MARWAN A. SIMAANMARWAN A. SIMAAN
MARWAN A. SIMAAN
This technical note proposes a resilient cooperative control design for networked cooperative systems when subjected to external attacks. The systems considered in this paper can have any information topology described by a leader-follower digraph. A potential attack on such systems consists of unknown bounded signals generated from any linear or nonlinear finite-L2-gain exogenous dynamical system and injected distributively into nodes of the system's network. The purpose of the attack is to destabilize the consensus dynamics by intercepting the system's communication network and corrupting its local state feedback. The proposed resilient control design consists of introducing a virtual system with hidden network such that the overall system consisting of the original consensus system, the virtual system, and the attack dynamics is stable without requiring any information about the locations or nature of the attack. This is accomplished by utilizing the concept of competitive interaction to provide explicit design criteria for the hidden network of the virtual system to interact with the original system. A graph theoretical approach and a Lyapunov direct method are used to analyze

23 February 2017 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Open access
AGAzwirman Gusrialdi
Azwirman Gusrialdi
ZQZhihua Qu
Zhihua Qu
MARWAN A. SIMAANMARWAN A. SIMAAN
MARWAN A. SIMAAN
The increasing number of electric vehicles (EVs) on highways calls for the installment of adequate charging infrastructure. Since charging infrastructure has limited capacity, EVs need to wait at a charging station to get charged, and their waiting times may differ significantly from one location to another. This paper aims at developing a strategy to coordinate the queues among the charging stations, with only local information about traffic flows and the status of EV charging stations along a bidirectional highway, so that excessively long waiting times can be avoided. Specifically, a distributed algorithm is presented to schedule EV flows into neighboring charging stations, so that EVs are all appropriately served along the highway and that all the charging resources are uniformly utilized. In addition, a distributed decision making policy is developed to influence the aggregate number of EVs entering any given service station, so that each EV makes an appropriate decision (i.e., whether or not it should enter the next charging station) by contributing positively to meeting the desired queue length at service stations and by considering its own battery constraint. Performance improvement of the proposed strategy is illustrated via one of the highways in the United States, namely the Florida Turnpike.

20 June 2017 in IEEE Control Systems Letters
Verified
Journal Article
Open access
AGAzwirman Gusrialdi
Azwirman Gusrialdi
ZQZhihua Qu
Zhihua Qu
This letter considers the problem of estimating all the eigenvalues and eigenvectors of an irreducible matrix, corresponding to a strongly connected digraph, in the absence of knowledge on the global network topology. To this end, we propose a unified distributed strategy performed by each node in the network and relies only on the local information. The key idea is to transform the nonlinear problem of computing both the eigenvalues and eigenvectors of an irreducible matrix into a linear one. Specifically, we first transform distributively the irreducible matrix into a nonsingular irreducible matrix. Each node in the network then estimates in a distributed fashion the inverse of the nonsingular matrix by solving a set of linear equations based on a consensus-type algorithm. The eigenvalues and the corresponding eigenvectors are finally computed by exploiting the relations between the eigenvalues and eigenvectors of both the inverse and the original irreducible matrices. A numerical example is provided to demonstrate the effectiveness of the proposed distributed strategy.

4 December 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
SKShaghayegh Keyumarsi
Shaghayegh Keyumarsi
MAMade Widhi Surya Atman
Made Widhi Surya Atman
AGAzwirman Gusrialdi
Azwirman Gusrialdi
This letter presents a novel extension of the control barrier function (CBF) as the low-level safety controller for autonomous mobile robots navigating in unknown environments. The main challenges of implementing CBF in real-world situations arise from the absence of a model or the lack of an exact one for the environment. Additionally, online learning is needed for the robot to maneuver in an unknown environment which leads to dealing with the sampled data set size, memory, and computational complexity. We address these challenges by designing an online non-parametric LiDAR-based safety function using the Gaussian process (GP). It is both efficient in data size and eliminates the requirement to store previous data. Then, a CBF is synthesized using the proposed safety function to rectify the safe control input. The effectiveness of the LiDAR-based CBF synthesis for navigation in unknown environments was validated by conducting experiments on unicycle-type robots.

23 June 2022 in IEEE Control Systems Letters
Verified
Journal Article
Open access
MIMuhammad Iqbal
Muhammad Iqbal
ZQZhihua Qu
Zhihua Qu
AGAzwirman Gusrialdi
Azwirman Gusrialdi
This letter presents a distributed protocol based on competitive interaction design method to solve the dynamic average-consensus problem on strongly-connected balanced directed graphs in the presence of adversaries. The competitive interaction method allows us to design a network that protects the multi-agent systems from adversaries without requiring high network connectivity and global information about the number of adversaries. We design a resilient distributed protocol to track the average of time-varying bounded reference signals, which every agent is receiving. We show that in the presence of bounded cyber-attacks onto the communication network and actuators, the agents achieve dynamic average-consensus. Simulations are presented to illustrate our theoretical results.

26 September 2018
Verified
Book Chapter
Closed access
PDF file
AGAzwirman Gusrialdi
Azwirman Gusrialdi
ZQZhihua Qu
Zhihua Qu