MMMohamed Naveed Gul Mohamed

Mohamed Naveed Gul Mohamed

*This is an algorithmically generated author record based on publicly available information.

Mohamed Naveed Gul Mohamed has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • An Information-State Based Approach to Linear Time Varying System Identification and Control

    by Mohamed Naveed Gul Mohamed, Raman Goyal, Ran Wang, Suman Chakravorty

    This paper considers the problem of system identification for linear time-varying systems. We propose a new system realization approach that uses an “information-state” as the state vector, where the information-state is composed of a finite number of past inputs and outputs. Using this framework, we develop a system identification algorithm that uses input–output data to fit an autoregressive moving average model (ARMA) to represent the current output in terms of finite past inputs and outputs. This information-state-based approach allows us to directly realize a state-space model using the estimated time-varying ARMA parameters for linear time-varying (LTV) systems. The paper develops the theoretical foundation for using ARMA parameters-based system representation using only the concept of linear observability, details the reasoning for exact output modeling using only the finite history, and shows that there is no need to separate the free and the forced response for identification. The paper also discusses the implications of using the information-state system for optimal output feedback control and shows that the solution obtained using a suitably posed information-state problem is optimal for the original problem. The proposed approach is tested on various different systems, and the performance is compared with state-of-the-art LTV system identification techniques.


  • Information-State-Based Reinforcement Learning for the Control of Partially Observed Nonlinear Systems

    by Raman Goyal, Mohamed Naveed Gul Mohamed, Ran Wang, Aayushman Sharma, Suman Chakravorty

    This article develops a model-based reinforcement learning (RL) approach to the closed-loop control of nonlinear dynamical systems with a partial nonlinear observation model. We propose an “information-state”-based approach to rigorously transform the partially observed problem into a fully observed problem where the information state consists of the past several observations and control inputs. We further show the equivalence of the transformed and the initial partially observed optimal control problems and provide the conditions to solve for the deterministic optimal solution. We develop a data-based generalization of the iterative linear quadratic regulator (ILQR) for the RL of partially observed systems using a local linear time-varying model of the information-state dynamics approximated by an autoregressive-moving-average (ARMA) model that is generated using only the input–output data. This approach allows us to design a local perturbation feedback control law that provides an optimum solution to the partially observed feedback design problem locally. The efficacy of the developed method is shown by controlling complex high-dimensional nonlinear dynamical systems in the presence of model and sensing uncertainty.


  • The Search for Feedback in Reinforcement Learning

    by Ran Wang, Aayushman Sharma, Karthikeya S. Parunandi, Raman Goyal, Mohamed Naveed Gul Mohamed, Suman Chakravorty

    The problem of reinforcement learning (RL) in an unknown nonlinear dynamical system is equivalent to the search for an optimal feedback law utilizing only data from the simulations/rollouts of the dynamical system. Most RL techniques search over a complex global nonlinear feedback parametrization making them suffer from high training times as well as variance. Instead, we advocate searching over a local feedback representation consisting of an open-loop sequence, and an associated optimal linear feedback law completely determined by the open-loop. We show that this alternate approach results in highly efficient training, the answers obtained are globally optimum, repeatable with negligible variance, and hence reliable, and the resulting closed performance is superior to global state-of-the-art RL techniques. Finally, if we replan, whenever required, which is feasible due to the fast and reliable local solution, it allows us to recover the optimal global feedback law.


  • Unifying Consensus and Covariance Intersection for Efficient Distributed State Estimation Over Unreliable Networks

    by Amirhossein Tamjidi, Reza Oftadeh, Mohamed Naveed Gul Mohamed, Dan Yu, Suman Chakravorty, Dylan Shell

    This article presents and studies a recursive information consensus filter for decentralized dynamic state estimation under circumstances in which the communication network is unreliable. Local estimators are assumed to have access only to local information, and no structure is assumed about the topology of the communication network, which need not be connected at all times. The filter is a hybrid approach: it uses iterative covariance intersection to reach consensus over priors, which might become correlated, while consensus over new information is handled using weights based on a Metropolis–Hastings Markov chain. We establish bounds for estimation performance and show that this hybrid method produces unbiased conservative estimates that are better than covariance intersection. The performance of the hybrid method is evaluated extensively, including comparisons with competing algorithms, with a hypothetical “full history” yardstick, and centralized performance. We conduct an assessment on a realistic atmospheric dispersion problem and also on more carefully crafted settings to help characterize particular aspects of the performance.


  • Open Access

    Experiments with Tractable Feedback in Robotic Planning under Uncertainty: Insights over a wide range of noise regimes (Extended Report)

    by Mohamed Naveed Gul Mohamed, Suman Chakravorty, Dylan A. Shell

    We consider the problem of robotic planning under uncertainty. This problem may be posed as a stochastic optimal control problem, complete solution to which is fundamentally intractable owing to the infamous curse of dimensionality. We report the results of an extensive simulation study in which we have compared two methods, both of which aim to salvage tractability by using alternative, albeit inexact, means for treating feedback. The first is a recently proposed method based on a near-optimal "decoupling principle" for tractable feedback design, wherein a nominal open-loop problem is solved, followed by a linear feedback design around the open-loop. The second is Model Predictive Control (MPC), a widely-employed method that uses repeated re-computation of the nominal open-loop problem during execution to correct for noise, though when interpreted as feedback, this can only said to be an implicit form. We examine a much wider range of noise levels than have been previously reported and empirical evidence suggests that the decoupling method allows for tractable planning over a wide range of uncertainty conditions without unduly sacrificing performance.

  • Open Access

    Decoupling stochastic optimal control problems for efficient solution: insights from experiments across a wide range of noise regimes

    by Mohamed Naveed Gul Mohamed, Suman Chakravorty, Dylan A. Shell

    We consider the problem of robotic planning under uncertainty in this paper. This problem may be posed as a stochastic optimal control problem, a solution to which is fundamentally intractable owing to the infamous "curse of dimensionality". Hence, we consider the extension of a "decoupling principle" that was recently proposed by some of the authors, wherein a nominal open-loop problem is solved followed by a linear feedback design around the open-loop, and which was shown to be near-optimal to second order in terms of a "small noise" parameter, to a much wider range of noise levels. Our empirical evidence suggests that this allows for tractable planning over a wide range of uncertainty conditions without unduly sacrificing performance.