Muhammad Iqbal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Muhammad Iqbal has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Azwirman Gusrialdi
Tampere University
2 shared publications - Zhihua Qu
Department of Electrical and Computer Engineering, University of Central Florida, Orlando, FL, USA
2 shared publications - Adnan Umar Khan
Department of Electrical Engineering, International Islamic University, Islamabad 44000, Pakistan
1 shared publication - Ahmad Saeed
Department of Electrical Engineering, International Islamic University, Islamabad 44000, Pakistan
1 shared publication - Ali Raza
Department of Electrical Engineering, Faculty of Engineering and Technology, International Islamic University, Islamabad, Pakistan
1 shared publication - Athar Waseem
International Islamic University 44000 Islamabad Pakistan
1 shared publication
Latest Publications
- Open Access
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 1916-1923
Communication-Efficient Distributed Kalman Filtering Using ADMM
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 1916-1923
Open AccessCommunication-Efficient Distributed Kalman Filtering Using ADMM
- Open Access
Three-Pond Model with Fuzzy Inference System-Based Water Level Regulation Scheme for Run-of-River Hydropower Plant
Power generation from river hydropower plants depends mainly on river flow. Water fluctuations in the river make the yield process unpredictable. To reduce these fluctuations, building a small reservoir at the river flow of the hydropower plant is recommended. Conventionally, classic single-pond models are commonly used to design run-of-river hydropower plants. However, such models are associated with fluctuations, sagging, and irregular power fluctuations that lead to irregular water fluctuations. This research proposes a novel idea to replace the single-pond model with a three-pond model to increase the plant’s overall efficiency. The three-pond model is developed as a three-tank nonlinear hydraulic system that contains the same amount of water as a conventional single pond. It also has the advantage of minimizing the run-of-river power plant’s dependence on river flow and increasing efficiency by trapping swell and turbulence in the water. To further increase the efficiency, the developed model was tested for smooth and effective level control using fuzzy control.
Open AccessThree-Pond Model with Fuzzy Inference System-Based Water Level Regulation Scheme for Run-of-River Hydropower Plant
Power generation from river hydropower plants depends mainly on river flow. Water fluctuations in the river make the yield process unpredictable. To reduce these fluctuations, building a small reservoir at the river flow of the hydropower plant is recommended. Conventionally, classic single-pond models are commonly used to design run-of-river hydropower plants. However, such models are associated with fluctuations, sagging, and irregular power fluctuations that lead to irregular water fluctuations. This research proposes a novel idea to replace the single-pond model with a three-pond model to increase the plant’s overall efficiency. The three-pond model is developed as a three-tank nonlinear hydraulic system that contains the same amount of water as a conventional single pond. It also has the advantage of minimizing the run-of-river power plant’s dependence on river flow and increasing efficiency by trapping swell and turbulence in the water. To further increase the efficiency, the developed model was tested for smooth and effective level control using fuzzy control.
- Open Access
- 16 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 7551-7563
De-Noising of Sparse Signals Using Mixture Model Shrinkage Function
In this work a new thresholding function referred to as ’mixture model shrinkage’ (MMS) based on the minimization of a convex cost function is proposed. Normally, thresholding functions underestimate larger signal amplitudes during the de-noising process. The proposed model is a more flexible shrinkage function as it solves the underestimation problem to a greater extent and thus efficiently de-noises the signal without affecting signal amplitudes. The Expectation minimization (EM) algorithm is used to find the model parameters along with the majorization-minimization (MM) algorithm that minimize the monotonic cost function. The proposed model is then applied for de-noising group sparse signals and Shepp Logan phantom images. Our experimental study shows that MMS outclasses current thresholding functions and overlapping group shrinkage algorithm without results suffering from underestimation. Furthermore, the proposed model has the smallest Root Mean Square Error (RMSE) for de-noising group sparse signals.
- 16 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 7551-7563
Open AccessDe-Noising of Sparse Signals Using Mixture Model Shrinkage Function
In this work a new thresholding function referred to as ’mixture model shrinkage’ (MMS) based on the minimization of a convex cost function is proposed. Normally, thresholding functions underestimate larger signal amplitudes during the de-noising process. The proposed model is a more flexible shrinkage function as it solves the underestimation problem to a greater extent and thus efficiently de-noises the signal without affecting signal amplitudes. The Expectation minimization (EM) algorithm is used to find the model parameters along with the majorization-minimization (MM) algorithm that minimize the monotonic cost function. The proposed model is then applied for de-noising group sparse signals and Shepp Logan phantom images. Our experimental study shows that MMS outclasses current thresholding functions and overlapping group shrinkage algorithm without results suffering from underestimation. Furthermore, the proposed model has the smallest Root Mean Square Error (RMSE) for de-noising group sparse signals.
- Open Access
- 23 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 6, 3487-3492
Resilient Dynamic Average-Consensus of Multiagent Systems
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.
- 23 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 6, 3487-3492
Open AccessResilient Dynamic Average-Consensus of Multiagent Systems
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.
- Open Access
- 15 June 2022
- Published by Elsevier in European Journal of Control
- Vol. 68
Distributed resilient consensus on general digraphs under cyber-attacks
- 15 June 2022
- Published by Elsevier in European Journal of Control
- Vol. 68
Open AccessDistributed resilient consensus on general digraphs under cyber-attacks
- 11 March 2022
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 20 (3) , 780-788
Performance Measure of Hierarchical Structures for Multi-agent Systems
- 11 March 2022
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 20 (3) , 780-788
Performance Measure of Hierarchical Structures for Multi-agent Systems
- 3 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 6, 1568-1573
Finite- and Fixed-Time Consensus Protocols for Multi-Agent Systems With Time-Varying Topologies
This letter presents finite- and fixed-time protocols, which solve the consensus problem in multi-agent systems with time-varying directed topologies. We show that the proposed distributed protocols solve the consensus problem under switching topologies, which are jointly strongly connected. These distributed protocols homogenize the multi-agent networks, which make the overall system robust against disturbances. We employ the homogeneity property of the vector fields, graph theory, Lyapunov stability theory and convex analysis to show the finite- and fixed-time stability of the multi-agent systems. Numerical examples are presented to demonstrate the effectiveness of the proposed control methods.
- 3 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 6, 1568-1573
Finite- and Fixed-Time Consensus Protocols for Multi-Agent Systems With Time-Varying Topologies
This letter presents finite- and fixed-time protocols, which solve the consensus problem in multi-agent systems with time-varying directed topologies. We show that the proposed distributed protocols solve the consensus problem under switching topologies, which are jointly strongly connected. These distributed protocols homogenize the multi-agent networks, which make the overall system robust against disturbances. We employ the homogeneity property of the vector fields, graph theory, Lyapunov stability theory and convex analysis to show the finite- and fixed-time stability of the multi-agent systems. Numerical examples are presented to demonstrate the effectiveness of the proposed control methods.