DMDipankar Maity

Dipankar Maity

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

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


Dipankar Maity has a total of 60 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fast Estimation of the Diffractive Loads on a Quadrotor UAV Following an Explosive Blast

    by Nicholas P. Kakavitsas, Andrew Willis, Dipankar Maity, Artur Wolek

    This work develops a tool to efficiently estimate the diffractive loads on a quadrotor uncrewed aerial vehicle (UAV) immediately following a nearby explosion. Existing models in the literature that predict the time history of wind velocity and the overpressure at a single distance from the blast are extended to model a moving blast wave that passes over the vehicle. The time-varying diffractive loads (i.e., due to the blast-induced pressure differential) are first modeled for a single sphere in a blast wave and then for a quadrotor approximated as a series of spheres connected by rods—one sphere for each of the four motors and one sphere for the central body. The overpressure and wind velocity models are compared with computational fluid dynamics (CFD) data. To illustrate the computational approach, a representative quadrotor model is perturbed by a blast from an initial hover flight condition in simulation. The rigid body dynamics are simulated over a short duration (ninety milliseconds) to determine the UAV’s state immediately after the explosion has concluded. The vehicle state history is predicted under the assumption of diffractive loads with a quadratic drag model and constant hover thrust.

  • Open Access

    Communication and Control Co-design in Non-cooperative Games

    by Shubham Aggarwal, Tamer Ba¸sAr, Dipankar Maity

    In this article, we revisit a communication control co-design problem for a class of two-player stochas tic differential games on an infinite horizon. Each ‘player’ represents two active decision makers, namely a scheduler and a remote controller, which cooperate to optimize over a global objective while competing with the other player. Each player's scheduler can only intermittently relay state information to its respective controller due to associated cost/constraint to communication. The scheduler's policy determines the information structure at the controller, thereby affecting the quality of the control inputs. Consequently, it leads to the classical communication-control trade-off problem. A high communication frequency improves the control performance of the player on account of a higher communication cost, and vice versa. Under suitable information structures of the players, we first compute the Nash controller policies for both players in terms of the conditional estimate of the state. Consequently, we reformulate the problem of computing Nash scheduler policies (within a class of parametrized randomized policies) into solving for the steady-state solution of a generalized Sylvester equation. Since the above-mentioned reformulation involves infinite sum of powers of the policy parameters, we provide a projected gradient descent-based algorithm to numerically compute a Nash equilibrium using a truncated polynomial approximation. Finally, we demonstrate the performance of the Nash control and scheduler policies using extensive numerical simulations.

  • Target Defense Using a Turret and Mobile Defender Team

    by Alexander Von Moll, Dipankar Maity, Meir Pachter, Daigo Shishika, Michael Dorothy

    A scenario is considered wherein a stationary, turn constrained agent (Turret) and a mobile agent (Defender) cooperate to protect the former from an adversarial mobile agent (Attacker). The Attacker wishes to reach the Turret prior to getting captured by either the Defender or Turret, if possible. Meanwhile, the Defender and Turret seek to capture the Attacker as far from the Turret as possible. This scenario is formulated as a differential game and solved using a geometric approach. Necessary and sufficient conditions for the Turret-Defender team winning and the Attacker winning are given. In the case of the Turret-Defender team winning equilibrium strategies for the terminal distance of the Attacker to the Turret are given. Three cases arise corresponding to solo capture by the Defender, solo capture by the Turret, and capture simultaneously by both Turret and Defender.


  • A Linear Programming Framework for Optimal Event-Triggered LQG Control

    by Zahra Hashemi, Dipankar Maity

    This letter explores intelligent scheduling of sensor-to-controller communication in networked control systems, particularly when data transmission incurs a cost. While the optimal controller in a standard linear-quadratic Gaussian (LQG) setup can be computed analytically, determining the optimal times to transmit sensor data remains computationally and analytically challenging. We show that, through reformulation and the introduction of auxiliary binary variables, the scheduling problem can be cast as a computationally efficient mixed-integer linear program (MILP). This formulation not only simplifies the analysis but also reveals structural insights and provides clear decision criterion at each step. Embedding the approach within a model predictive control ( MPC) framework enables dynamic adaptation, and we prove that the resulting scheduler performs at least as well as any deterministic strategy (e.g., periodic strategy). Simulation results further demonstrate that our method consistently outperforms traditional periodic scheduling.


  • Open Access

    A Dual Approach for Hierarchical Information-Theoretic Tree Abstractions

    by Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

    In this paper, we consider establishing a formal connection between two distinct tree-abstraction problems inspired by the information-bottleneck (IB) method. Specifically, we consider the hard- and soft-constrained formulations that have recently appeared in the literature to determine the conditions for which the two approaches are equivalent. Our analysis leverages concepts from Lagrangian relaxation and duality theory to relate the dual function of the hard-constrained problem to the Q-function employed in Q-tree search and shows the connection between tree phase transitions and solutions to the dual problem obtained by exploiting the problem structure. An algorithm is proposed that employs knowledge of the tree phase transitions to find a setting of the dual variable that solves the dual problem. Furthermore, we present an alternative approach to select the dual variable that leverages the integer programming formulation of the hard-constrained problem and the strong duality of linear programming. To obtain a linear program, we establish that a relaxation of the integer programming formulation of the hard-constrained tree-search problem has the integrality property by showing that the program constraint matrix is totally unimodular. Empirical results that corroborate the theoretical developments are presented and discussed throughout.

  • Open Access

    The Silence that Speaks: Neural Estimation via Communication Gaps

    by Shubham Aggarwal, Dipankar Maity, Tamer Başar

    Accurate remote state estimation is a fundamental component of many autonomous and networked dynamical systems, where multiple decision-making agents interact and communicate over shared, bandwidth-constrained channels. These communication constraints introduce an additional layer of complexity, namely, the decision of when to communicate. This results in a fundamental trade-off between estimation accuracy and communication resource usage. Traditional extensions of classical estimation algorithms (e.g., the Kalman filter) treat the absence of communication as 'missing' information. However, silence itself can carry implicit information about the system's state, which, if properly interpreted, can enhance the estimation quality even in the absence of explicit communication. Leveraging this implicit structure, however, poses significant analytical challenges, even in relatively simple systems. In this paper, we propose CALM (Communication-Aware Learning and Monitoring), a novel learning-based framework that jointly addresses the dual challenges of communication scheduling and estimator design. Our approach entails learning not only when to communicate but also how to infer useful information from periods of communication silence. We perform comparative case studies on multiple benchmarks to demonstrate that CALM is able to decode the implicit coordination between the estimator and the scheduler to extract information from the instances of 'silence' and enhance the estimation accuracy.

  • Strategic Concealment of Environment Representations in Competitive Games

    by Yue Guan, Dipankar Maity, Panagiotis Tsiotras

    This letter studies the strategic concealment of environment representations used by players in competitive games. We consider a defense scenario in which one player (the Defender) seeks to infer and exploit the representation used by the other player (the Attacker). The interaction between the two players is modeled as a Bayesian game: the Defender infers the Attacker’s representation from its trajectory and places barriers to counteract, while the Attacker obfuscates its representation type to mislead the Defender. We solve for the Perfect Bayesian Equilibrium via a bilinear program that integrates Bayesian inference, strategic planning, and belief manipulation. Simulations show that purposeful concealment naturally emerges: the Attacker randomizes its trajectory to manipulate the Defender’s belief, inducing suboptimal barrier selections and thereby gaining a strategic advantage.