Abhishek Halder

Prof. Abhishek Halder


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
19 February 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
KCKenneth F. Caluya
Kenneth F. Caluya
AHAbhishek Halder
Abhishek Halder
In this article, we study the Schrödinger bridge problem (SBP) with nonlinear prior dynamics. In control-theoretic language, this is a problem of minimum effort steering of a given joint state probability density function (PDF) to another over a finite-time horizon, subject to a controlled stochastic differential evolution of the state vector. As such, it can be seen as a stochastic optimal control problem in continuous time with endpoint density constraints—A topic that originated in the physics literature in 1930s, and in the recent years, has garnered burgeoning interest in the systems-control community. For generic nonlinear drift, we reduce the SBP to solving a system of forward and backward Kolmogorov partial differential equations (PDEs) that are coupled through the boundary conditions, with unknowns being the “Schrödinger factors”—so named since their product at any time yields the optimal controlled joint state PDF at that time. We show that if the drift is a gradient vector field, or is of mixed conservative–dissipative nature, then it is possible to transform these PDEs into a pair of initial value problems (IVPs) involving the same forward Kolmogorov operator. Combined with a recently proposed fixed point recursion that is contractive in the Hilbert metric, this opens up the possibility to numerically solve the SBPs in these cases by computing the Schrödinger factors via a single IVP solver for the corresponding (uncontrolled) forward Kolmogorov PDE. The flows generated by such forward Kolmogorov PDEs, for the two aforementioned types of drift, in turn, enjoy gradient descent structures on the manifold of joint PDFs with respect to suitable distance functionals. We employ a proximal algorithm developed in our prior work that exploits this geometric viewpoint, to solve these IVPs and compute the Schrödinger factors via weighted scattered point cloud evolution in the state space. We provide the algorithmic details and illustrate the proposed framework of solving the SBPs with nonlinear prior dynamics by numerical examples.

4 November 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
KCKenneth F. Caluya
Kenneth F. Caluya
AHAbhishek Halder
Abhishek Halder
We develop a new computational framework to solve the equations governing the flow of the joint probability density functions (PDFs) in continuous-time stochastic nonlinear systems. Our methodology breaks away from the traditional approach of spatial discretization or function approximation — both of which, in general, suffer from the ``curse-of-dimensionality". We solve infinite dimensional proximal recursions in the manifold of joint PDFs, which in the small time-step limit, is theoretically equivalent to solving the underlying transport equations. The resulting computation has the geometric interpretation of gradient flow of a free energy functional with respect to the Wasserstein metric. We show that dualization along with an entropic regularization, leads to a cone-preserving fixed point recursion that is proved to be contractive in Thompson metric. A block co-ordinate iteration is proposed to solve the resulting nonlinear recursions with guaranteed convergence. This approach enables remarkably fast computation for non-parametric transient joint PDF propagation. Numerical examples and various extensions are provided to illustrate the scope and efficacy of the

11 November 2016 in IEEE Transactions on Power Systems
Verified
Journal Article
Open access
AHAbhishek Halder
Abhishek Halder
XGXinbo Geng
Xinbo Geng
PKP. R. Kumar
P. R. Kumar
LXLe Xie
Le Xie
Motivated by the growing importance of demand response in modern power system's operations, we propose an architecture and supporting algorithms for privacy preserving thermal inertial load management as a service provided by the load serving entity (LSE). We focus on an LSE managing a population of its customers' air conditioners, and propose a contractual model where the LSE guarantees quality of service to each customer in terms of keeping their indoor temperature trajectories within respective bands around the desired individual comfort temperatures. We show how the LSE can price the contracts differentiated by the flexibility embodied by the width of the specified bands. We address architectural questions of (i) how the LSE can strategize its energy procurement based on price and ambient temperature forecasts, (ii) how an LSE can close the real-time control loop at the aggregate level while providing individual comfort guarantees to loads, without ever measuring the states of an air conditioner for privacy reasons. Control algorithms to enable our proposed architecture are given, and their efficacy is demonstrated on real data.

14 July 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
AHAbhishek Halder
Abhishek Halder
We study the problem of ellipsoidal bounding of convex set-valued data, where the convex set is obtained by the p-sum of finitely many ellipsoids, for any real p≥q 1. The notion of p-sum appears in the Brunn-Minkowski-Firey theory in convex analysis, and generalizes several well-known set-valued operations such as the Minkowski sum of the summand convex sets (here, ellipsoids). We derive an outer ellipsoidal parameterization for the p-sum of a given set of ellipsoids, and compute the tightest such parameterization for two optimality criteria: minimum trace and minimum volume. For such optimal parameterizations, several known results in the system-control literature are recovered as special cases of our general formula. For the minimum volume criterion, our analysis leads to a fixed point recursion over a scalar that parameterizes the shape matrix of the outer ellipsoid. This recursion is proved to be contractive, and found to converge fast in practice. We apply these results to compute the forward reach sets for a linear control system subject to different convex set-valued uncertainty models for the initial condition and control, generated by varying p

22 April 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Open access
ZAZahra Askarzadeh
Zahra Askarzadeh
RFRui Fu
Rui Fu
AHAbhishek Halder
Abhishek Halder
YCYongxin Chen
Yongxin Chen
TGTryphon T. Georgiou
Tryphon T. Georgiou
We consider a certain class of nonlinear maps that preserve the probability simplex, i.e., stochastic maps, that are inspired by the DeGroot-Friedkin model of belief/opinion propagation over influence networks. The corresponding dynamical models describe the evolution of the probability distribution of interacting species. Such models where the probability transition mechanism depends nonlinearly on the current state are often referred to as nonlinear Markov chains. In this paper we develop stability results and study the behavior of representative opinion models. The stability certificates are based on the contractivity of the nonlinear evolution in the l1-metric. We apply the theory to two types of opinion models where the adaptation of the transition probabilities to the current state is exponential and linear, respectively-both of these can display a wide range of behaviors. We discuss continuous-time and other generalizations.

9 January 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
AHAbhishek Halder
Abhishek Halder
KCKenneth F. Caluya
Kenneth F. Caluya
BTBertrand Travacca
Bertrand Travacca
SMScott J. Moura
Scott J. Moura
We provide gradient flow interpretations for the continuous-time continuous-state Hopfield neural network (HNN). The ordinary and stochastic differential equations associated with the HNN were introduced in the literature as analog optimizers and were reported to exhibit good performance in numerical experiments. In this work, we point out that the deterministic HNN can be transcribed into Amari's natural gradient descent, and thereby uncover the explicit relation between the underlying Riemannian metric and the activation functions. By exploiting an equivalence between the natural gradient descent and the mirror descent, we show how the choice of activation function governs the geometry of the HNN dynamics. For the stochastic HNN, we show that the so-called ``diffusion machine,'' while not a gradient flow itself, induces a gradient flow when lifted in the space of probability measures. We characterize this infinite-dimensional flow as the gradient descent of certain free energy with respect to a Wasserstein metric that depends on the geodesic distance on the ground manifold. Furthermore, we demonstrate how this gradient flow interpretation can be used for fast computation via recently developed proximal algorithms.