Moh Kamalul Wafi

SY
h-index4
10papers
41citations
Novelty42%
AI Score48

10 Papers

7.0SYJul 7
Neural-Enhanced Micro-Kalman Filtering for Satellite Tracking: A Comparative Study

Moh Kamalul Wafi

Satellite state estimation plays a fundamental role in orbital navigation, tracking, and autonomous space operations. Accurate estimation remains challenging due to uncertainties in process and measurement noise, which may degrade the performance of conventional Kalman filtering techniques. This paper presents a Neural-enhanced micro-Kalman filter ($μ$KF) for satellite tracking based on an information-form state estimation framework. Starting from a linearized state-space model of orbital dynamics, a lightweight neural scaling mechanism is introduced to adapt the process and measurement noise covariances online while preserving the underlying Bayesian filtering structure. The proposed estimator is formulated within the information-form $μ$KF framework and evaluated through numerical simulations using a linear Gaussian satellite tracking model. Its performance is compared with the classical Kalman filter (KF), the extended Kalman filter (EKF), the unscented Kalman filter (UKF), and an adaptive Kalman filter under identical operating conditions. Simulation results demonstrate that the proposed Neural-$μ$KF accurately tracks the satellite states with consistently low mean square estimation errors (MSEE). Furthermore, the proposed method achieves estimation performance comparable to, and for selected states slightly better than, the baseline Kalman filter while retaining the computational advantages of the information-form formulation. These results demonstrate that integrating lightweight neural covariance adaptation into the $μ$KF provides an effective and flexible framework for satellite state estimation.

7.5SYMay 14
Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics

Moh Kamalul Wafi, Hamidreza Montazeri Hedesh, Milad Siami

This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics. We present parallel continuous-time and discrete-time designs in which each node runs a local adaptive observer and exchanges information over a directed graph. For both time scales, we establish stability of the network coupling operators, prove boundedness of all internal signals, and show convergence of each node's estimate to the source despite model uncertainty and disturbances. We further derive input-to-state stability (ISS) bounds that quantify robustness to bounded process noise. A key distinction is that the discrete-time design uses constant adaptive gains and per-step regressor normalization to handle sampling effects, whereas the continuous-time design does not. A unified Lyapunov framework links local observer dynamics with graph topology. Simulations on star, cyclic, and path networks corroborate the analysis, demonstrating accurate tracking, robustness, and scalability with the number of sensing nodes.

7.4SYApr 5
Distributed Nonlinear Control of Networked Two-Wheeled Robots under Adversarial Interactions

Moh Kamalul Wafi, Ahmad Ataka, Yul Y. Nazaruddin et al.

This paper studies distributed trajectory tracking for networks of nonholonomic mobile robots under adversarial information exchange. An exact global input--output feedback linearization scheme is developed to regulate planar position outputs, yielding linear error dynamics without prescribing internal state trajectories. To mitigate corrupted neighbor information, a resilient desired-signal construction is proposed that combines local redundancy with trusted in-neighbor signals, without requiring adversary detection or isolation. When sufficient redundancy is available, the method suppresses adversarial influence and recovers nominal tracking performance. If redundancy conditions are violated, adversarial effects enter as bounded disturbances and the tracking error remains ultimately bounded. Simulation results on star, cyclic, and path topologies validate the analysis and demonstrate the superior resilience of cyclic networks due to distributed information propagation.

7.1SYApr 6
Adaptive Kalman Filtering with Exact Linearization and Decoupling Control on Three-Tank Process

Bambang L. Widjiantoro, Katherin Indriawati, Moh Kamalul Wafi

Water treatment and liquid storage are the two plants implementing the hydraulic three-tank system. Maintaining certain levels is the critical scenario so that the systems run as desired. To deal with, the optimal linear control and the complex advanced non-linear problem have been proposed to track certain dynamic reference. This paper studies those two using the combination of linearization and decoupling control under some assumptions. The result shows that the designed methods have successfully traced the dynamic reference signals. Beyond that, the adaptive system noise Kalman filter (AKF) algorithm is used to examine the estimation performance of the true non-linear system and the performance yields a rewarding prediction of the true system.

6.9SYApr 5
Cooperative Observer-Based $\mathcal{H}_\infty$ Fault-Tolerant Tracking Control for Networked Processes with Sensor Faults

Moh Kamalul Wafi, Yurid E. Nugraha, Bambang L. Widjiantoro et al.

This paper develops a cooperative fault-tolerant control framework for heterogeneous networked linear systems subject to sensor degradation and external disturbances. Each unit employs an augmented $\mathcal{H}_\infty$ observer that jointly reconstructs its state and sensor fault, providing disturbance-attenuated estimation guarantees. An inner state-feedback gain is then synthesized via convex $\mathcal{H}_\infty$ LMIs to ensure robust closed-loop stabilization, while an outer distributed integral action drives all units to track a constant setpoint source. The resulting network error dynamics satisfy an input-to-state stability condition with respect to disturbances and estimation imperfections, and converge to zero in their absence. Simulations on star, cyclic, and path topologies with heterogeneous agents confirm reliable tracking despite abrupt sensor faults and bounded disturbances, demonstrating a scalable and resilient coordination strategy for multi-agent systems with sensing imperfections.

6.3DSApr 2
When is cumulative dose response monotonic? Analysis of incoherent feedforward motifs

Moh Kamalul Wafi, Arthur C. B. de Oliveira, Eduardo D. Sontag

We study the monotonicity of the cumulative dose response (cDR) for a class of incoherent feedforward motifs (IFFM) systems with linear intermediate dynamics and nonlinear output dynamics. While the instantaneous dose response (DR) may be nonmonotone with respect to the input, the cDR can still be monotone. To analyze this phenomenon, we derive an integral representation of the sensitivity of cDR with respect to the input and establish general sufficient conditions for both monotonicity and non-monotonicity. These results reduce the problem to verifying qualitative sign properties along system trajectories. We apply this framework to four canonical IFFM systems and obtain a complete characterization of their behavior. In particular, IFFM1 and IFFM3 exhibit monotone cDR despite potentially non-monotone DR, while IFFM2 is monotone already at the level of DR, which implies monotonicity of cDR. In contrast, IFFM4 violates these conditions, leading to a loss of monotonicity. Numerical simulations indicate that these properties persist beyond the structured initial conditions used in the analysis. Overall, our results provide a unified framework for understanding how network structure governs monotonicity in cumulative input-output responses.

7.0OCApr 30
Boundedness of solutions in feedback systems with antithetic controllers

Moh Kamalul Wafi, Arthur C. B. de Oliveira, Eduardo D. Sontag

This paper studies whether solutions of a class of nonlinear feedback systems remain bounded over time. The systems we consider arise naturally in synthetic biology, where the antithetic feedback controller regulates a biological process through a delayed feedback loop. Our main result is that every trajectory of such a system is bounded. The key insight is simple: if the regulated state grows too large for too long, the feedback loop will eventually respond and push it back down. More precisely, we show that whenever the state exceeds a threshold and remains there long enough, the feedback signal becomes strong enough to force the state to decrease. We then show that once this happens, the feedback remains strong enough to keep the state from growing unbounded. The proof works directly with differential inequalities and does not require constructing a Lyapunov function, making the mechanism transparent and easy to interpret. The boundedness result can be understood as a time-domain small-gain effect, where the delayed feedback ultimately counteracts any persistent growth in the system.

1.5SYJun 30
On the Comparison of Reinforcement Learning and Adaptive Control for Linear Systems under Packet Loss and Uncertainty

Moh Kamalul Wafi

This paper presents a comparative study between Adaptive Quantized Control (AQC) and Deep Deterministic Policy Gradient (DDPG) reinforcement learning for uncertain linear systems with input quantization over communication channels subject to packet loss. The considered setting also includes dynamic switching from a nominal unstable system to a more unstable one during operation. The AQC is designed for unknown system dynamics using acknowledgment messages to compensate for packet losses, whereas the DDPG controller is trained using the nominal system model without acknowledgment messages. Numerical results show that the DDPG controller achieves faster transient responses and improved damping within its training environment. However, under model uncertainty, packet loss, and dynamic switching, the AQC consistently demonstrates superior robustness owing to its rigorous Lyapunov stability guarantees. These results highlight the trade-off between data-driven performance and model-based robustness, and provide insight into the applicability of reinforcement learning and adaptive control for networked uncertain systems.

5.1SYMay 28, 2025
Local Stability and Region of Attraction Analysis for Neural Network Feedback Systems under Positivity Constraints

Hamidreza Montazeri Hedesh, Moh Kamalul Wafi, Milad Siami

We study the local stability of nonlinear systems in the Lur'e form with static nonlinear feedback realized by feedforward neural networks (FFNNs). By leveraging positivity system constraints, we employ a localized variant of the Aizerman conjecture, which provides sufficient conditions for exponential stability of trajectories confined to a compact set. Using this foundation, we develop two distinct methods for estimating the Region of Attraction (ROA): (i) a less conservative Lyapunov-based approach that constructs invariant sublevel sets of a quadratic function satisfying a linear matrix inequality (LMI), and (ii) a novel technique for computing tight local sector bounds for FFNNs via layer-wise propagation of linear relaxations. These bounds are integrated into the localized Aizerman framework to certify local exponential stability. Numerical results demonstrate substantial improvements over existing integral quadratic constraint-based approaches in both ROA size and scalability.

3.3SYMay 25, 2025
Robust Stability Analysis of Positive Lure System with Neural Network Feedback

Hamidreza Montazeri Hedesh, Moh. Kamalul Wafi, Bahram Shafai et al.

This paper investigates the robustness of the Lur'e problem under positivity constraints, drawing on results from the positive Aizerman conjecture and robustness properties of Metzler matrices. Specifically, we consider a control system of Lur'e type in which not only the linear part includes parametric uncertainty but also the nonlinear sector bound is unknown. We investigate tools from positive linear systems to effectively solve the problems in complicated and uncertain nonlinear systems. By leveraging the positivity characteristic of the system, we derive an explicit formula for the stability radius of Lur'e systems. Furthermore, we extend our analysis to systems with neural network (NN) feedback loops. Building on this approach, we also propose a refinement method for sector bounds of NNs. This study introduces a scalable and efficient approach for robustness analysis of both Lur'e and NN-controlled systems. Finally, the proposed results are supported by illustrative examples.