Ashish Ranjan Hota
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ashish Ranjan Hota has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Shreyas Sundaram
School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA
11 shared publications - Philip. E. Pare
Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA
6 shared publications Shreyas Sundaram
6 shared publications- Urmee Maitra
Department of Electrical Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India
5 shared publications - Prabodh Bajpai
Indian Institute of Technology Kanpur
4 shared publications - Arghya Mallick
Delft Center for Systems and Control, TU Delft, Delft, The Netherlands
3 shared publications
Latest Publications
- 28 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Decision Analysis
Discrete-Time Sequential Persuasive Game for Containing SIS Epidemic Propagation
Containing the spread of infectious diseases is a challenging problem for both central authorities as well as individuals, especially when the infected individuals are asymptomatic and the decisions need to be made under incomplete information and strategic uncertainty. In this paper, we consider the susceptible-infected-susceptible epidemic model, in which a large population of individuals decide whether to adopt partially effective protection without being aware of their exact infection status. Instead, they receive noisy signals from a strategic sender that convey incomplete information regarding their infection state in the form of action recommendations. These recommendation signals are strategically designed so that it is optimal for the receivers to follow their recommended actions, and the infected proportion at the next time step is minimized. When the sender has accurate information about the receivers’ states, we obtain analytical (closed-form) solutions of the optimal signals under suitable assumptions by exploiting the monotonicity of the cost function in the action recommendations. Finally, we consider the case when the sender is not omniscient and show that there may not exist any action recommendation that strategic followers are guaranteed to follow. We validate the proposed framework via numerical simulations and illustrate that disclosing true infection status to the receivers is not always the optimal choice, instead, strategic action recommendations can lead to a smaller infection prevalence. We also show that when the sender is not omniscient, the infected proportion and the strategies adopted by the receivers may not converge to a steady state. Funding: This research was not supported by any research grant.
- 28 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Decision Analysis
Discrete-Time Sequential Persuasive Game for Containing SIS Epidemic Propagation
Containing the spread of infectious diseases is a challenging problem for both central authorities as well as individuals, especially when the infected individuals are asymptomatic and the decisions need to be made under incomplete information and strategic uncertainty. In this paper, we consider the susceptible-infected-susceptible epidemic model, in which a large population of individuals decide whether to adopt partially effective protection without being aware of their exact infection status. Instead, they receive noisy signals from a strategic sender that convey incomplete information regarding their infection state in the form of action recommendations. These recommendation signals are strategically designed so that it is optimal for the receivers to follow their recommended actions, and the infected proportion at the next time step is minimized. When the sender has accurate information about the receivers’ states, we obtain analytical (closed-form) solutions of the optimal signals under suitable assumptions by exploiting the monotonicity of the cost function in the action recommendations. Finally, we consider the case when the sender is not omniscient and show that there may not exist any action recommendation that strategic followers are guaranteed to follow. We validate the proposed framework via numerical simulations and illustrate that disclosing true infection status to the receivers is not always the optimal choice, instead, strategic action recommendations can lead to a smaller infection prevalence. We also show that when the sender is not omniscient, the infected proportion and the strategies adopted by the receivers may not converge to a steady state. Funding: This research was not supported by any research grant.
- Open Access
When Environments Shift: Safe Planning with Generative Priors and Robust Conformal Prediction
Autonomous systems operate in environments that may change over time. An example is the control of a self-driving vehicle among pedestrians and human-controlled vehicles whose behavior may change based on factors such as traffic density, road visibility, and social norms. Therefore, the environment encountered during deployment rarely mirrors the environment and data encountered during training -- a phenomenon known as distribution shift -- which can undermine the safety of autonomous systems. Conformal prediction (CP) has recently been used along with data from the training environment to provide prediction regions that capture the behavior of the environment with a desired probability. When embedded within a model predictive controller (MPC), one can provide probabilistic safety guarantees, but only when the deployment and training environments coincide. Once a distribution shift occurs, these guarantees collapse. We propose a planning framework that is robust under distribution shifts by: (i) assuming that the underlying data distribution of the environment is parameterized by a nuisance parameter, i.e., an observable, interpretable quantity such as traffic density, (ii) training a conditional diffusion model that captures distribution shifts as a function of the nuisance parameter, (iii) observing the nuisance parameter online and generating cheap, synthetic data from the diffusion model for the observed nuisance parameter, and (iv) designing an MPC that embeds CP regions constructed from such synthetic data. Importantly, we account for discrepancies between the underlying data distribution and the diffusion model by using robust CP. Thus, the plans computed using robust CP enjoy probabilistic safety guarantees, in contrast with plans obtained from a single, static set of training data. We empirically demonstrate safety under diverse distribution shifts in the ORCA simulator.
Open AccessWhen Environments Shift: Safe Planning with Generative Priors and Robust Conformal Prediction
Autonomous systems operate in environments that may change over time. An example is the control of a self-driving vehicle among pedestrians and human-controlled vehicles whose behavior may change based on factors such as traffic density, road visibility, and social norms. Therefore, the environment encountered during deployment rarely mirrors the environment and data encountered during training -- a phenomenon known as distribution shift -- which can undermine the safety of autonomous systems. Conformal prediction (CP) has recently been used along with data from the training environment to provide prediction regions that capture the behavior of the environment with a desired probability. When embedded within a model predictive controller (MPC), one can provide probabilistic safety guarantees, but only when the deployment and training environments coincide. Once a distribution shift occurs, these guarantees collapse. We propose a planning framework that is robust under distribution shifts by: (i) assuming that the underlying data distribution of the environment is parameterized by a nuisance parameter, i.e., an observable, interpretable quantity such as traffic density, (ii) training a conditional diffusion model that captures distribution shifts as a function of the nuisance parameter, (iii) observing the nuisance parameter online and generating cheap, synthetic data from the diffusion model for the observed nuisance parameter, and (iv) designing an MPC that embeds CP regions constructed from such synthetic data. Importantly, we account for discrepancies between the underlying data distribution and the diffusion model by using robust CP. Thus, the plans computed using robust CP enjoy probabilistic safety guarantees, in contrast with plans obtained from a single, static set of training data. We empirically demonstrate safety under diverse distribution shifts in the ORCA simulator.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1177-1182
Encirclement Guaranteed Finite-Time Capture Against Unknown Evader Strategies
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1177-1182
Open AccessEncirclement Guaranteed Finite-Time Capture Against Unknown Evader Strategies
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 4011-4018
Online Identification of Time-Varying Systems Using Excitation Sets and Change-Point Detection
In this work, we first show that the problem of parameter identification is often ill-conditioned and lacks the persistence of excitation required for the convergence of online learning schemes. To tackle these challenges, we introduce the notion of optimal and greedy excitation sets, which contain data points with sufficient richness to aid in the identification task. We then present the greedy excitation set-based recursive least squares algorithm to alleviate the problem of the lack of persistent excitation, and prove that the iterates generated by the proposed algorithm minimize an auxiliary weighted least squares cost function. When data points are generated from time-varying parameters, online estimators tend to underfit the true parameter trajectory, and their predictability deteriorates. To tackle this problem, we propose a memory resetting scheme leveraging change-point detection techniques. Finally, we illustrate the performance of the proposed algorithms via a numerical case study to learn the time-varying parameters of networked epidemic dynamics, and compare it to results obtained using conventional approaches.
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 4011-4018
Online Identification of Time-Varying Systems Using Excitation Sets and Change-Point Detection
In this work, we first show that the problem of parameter identification is often ill-conditioned and lacks the persistence of excitation required for the convergence of online learning schemes. To tackle these challenges, we introduce the notion of optimal and greedy excitation sets, which contain data points with sufficient richness to aid in the identification task. We then present the greedy excitation set-based recursive least squares algorithm to alleviate the problem of the lack of persistent excitation, and prove that the iterates generated by the proposed algorithm minimize an auxiliary weighted least squares cost function. When data points are generated from time-varying parameters, online estimators tend to underfit the true parameter trajectory, and their predictability deteriorates. To tackle this problem, we propose a memory resetting scheme leveraging change-point detection techniques. Finally, we illustrate the performance of the proposed algorithms via a numerical case study to learn the time-varying parameters of networked epidemic dynamics, and compare it to results obtained using conventional approaches.
- Open Access
Distributionally Robust Safe Motion Planning with Contextual Information
We present a distributionally robust approach for collision avoidance by incorporating contextual information. Specifically, we embed the conditional distribution of future trajectory of the obstacle conditioned on the motion of the ego agent in a reproducing kernel Hilbert space (RKHS) via the conditional kernel mean embedding operator. Then, we define an ambiguity set containing all distributions whose embedding in the RKHS is within a certain distance from the empirical estimate of conditional mean embedding learnt from past data. Consequently, a distributionally robust collision avoidance constraint is formulated, and included in the receding horizon based motion planning formulation of the ego agent. Simulation results show that the proposed approach is more successful in avoiding collision compared to approaches that do not include contextual information and/or distributional robustness in their formulation in several challenging scenarios.
Open AccessDistributionally Robust Safe Motion Planning with Contextual Information
We present a distributionally robust approach for collision avoidance by incorporating contextual information. Specifically, we embed the conditional distribution of future trajectory of the obstacle conditioned on the motion of the ego agent in a reproducing kernel Hilbert space (RKHS) via the conditional kernel mean embedding operator. Then, we define an ambiguity set containing all distributions whose embedding in the RKHS is within a certain distance from the empirical estimate of conditional mean embedding learnt from past data. Consequently, a distributionally robust collision avoidance constraint is formulated, and included in the receding horizon based motion planning formulation of the ego agent. Simulation results show that the proposed approach is more successful in avoiding collision compared to approaches that do not include contextual information and/or distributional robustness in their formulation in several challenging scenarios.
- Open Access
- 20 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Electronics
- Vol. 40 (10) , 15652-15669
Modeling and Control of a Three-Phase Five-Port Partially Isolated DC–DC Converter for DC-Powered Commercial Buildings
Integrating low-voltage, high-power energy sources and energy storage devices into medium voltage (e.g., $\mathbf {380}\,\text{V}$) dc microgrids presents significant challenges due to the need for high-current and high-gain power conversion. This paper proposes a five-port, partially-isolated dc–dc converter to efficiently interface solar photovoltaics (PV), battery, fuel cell, and supercapacitor with a $\mathbf {380}\,\text{V}$ dc bus. At the core of the proposed topology is a current-fed asymmetrical three-phase triple active bridge structure, which results in a higher order system, making its modeling and controller design challenging. To address this, a simplified small-signal modeling approach and a proportional–integral controller-based control scheme are proposed, enabling seamless operation of the converter under any energy management scheme (EMS). Further, a limiter-based novel autonomous power adjustment strategy is introduced to manage substantial load/PV power variations between consecutive EMS updates. The topology reduces power conversion stages, requires $\mathbf {4\%}$ fewer semiconductor switches, uses $\mathbf {20\%}$ fewer magnetic cores per phase and port compered to existing equivalent fully-isolated and partially-isolated converters. It also lowers the load bus voltage undershoot/overshoot by almost 10 times for the same percentage of load change. The experimental validation on a $\mathbf {2}\,\text{kW}$ laboratory-scale prototype confirms the effectiveness of the control strategy and overall system performance.
- 20 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Electronics
- Vol. 40 (10) , 15652-15669
Open AccessModeling and Control of a Three-Phase Five-Port Partially Isolated DC–DC Converter for DC-Powered Commercial Buildings
Integrating low-voltage, high-power energy sources and energy storage devices into medium voltage (e.g., $\mathbf {380}\,\text{V}$) dc microgrids presents significant challenges due to the need for high-current and high-gain power conversion. This paper proposes a five-port, partially-isolated dc–dc converter to efficiently interface solar photovoltaics (PV), battery, fuel cell, and supercapacitor with a $\mathbf {380}\,\text{V}$ dc bus. At the core of the proposed topology is a current-fed asymmetrical three-phase triple active bridge structure, which results in a higher order system, making its modeling and controller design challenging. To address this, a simplified small-signal modeling approach and a proportional–integral controller-based control scheme are proposed, enabling seamless operation of the converter under any energy management scheme (EMS). Further, a limiter-based novel autonomous power adjustment strategy is introduced to manage substantial load/PV power variations between consecutive EMS updates. The topology reduces power conversion stages, requires $\mathbf {4\%}$ fewer semiconductor switches, uses $\mathbf {20\%}$ fewer magnetic cores per phase and port compered to existing equivalent fully-isolated and partially-isolated converters. It also lowers the load bus voltage undershoot/overshoot by almost 10 times for the same percentage of load change. The experimental validation on a $\mathbf {2}\,\text{kW}$ laboratory-scale prototype confirms the effectiveness of the control strategy and overall system performance.
- Open Access
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (4) , 2863-2877
Game-Theoretic Protection Adoption Against Networked SIS Epidemics
In this paper, we investigate game-theoretic strategies for containing spreading processes on large-scale networks. Specifically, we consider the class of networked susceptible-infected-susceptible (SIS) epidemics where a large population of agents strategically choose whether to adopt partially effective protection. We define the utilities of the agents which depend on the degree of the agent, its individual infection status and action, as well as the the overall prevalence of the epidemic and strategy profile of the entire population. We further present the coupled dynamics of epidemic evolution as well as strategy update which is assumed to follow the replicator dynamics. By relying on timescale separation arguments, we first derive the game-theoretic protection adoption strategies of the agents for a given epidemic state, and then present the reduced epidemic dynamics. The existence and uniqueness of endemic equilibrium is rigorously characterized and forms the main result of this paper. We then present extensive numerical results to highlight the impacts of heterogeneous node degrees, infection rates, cost of protection adoption, and effectiveness of protection on the epidemic prevalence at the equilibrium. Finally, we illustrate the evolution of the networked SIR epidemic under game-theoretic protection adoption.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (4) , 2863-2877
Open AccessGame-Theoretic Protection Adoption Against Networked SIS Epidemics
In this paper, we investigate game-theoretic strategies for containing spreading processes on large-scale networks. Specifically, we consider the class of networked susceptible-infected-susceptible (SIS) epidemics where a large population of agents strategically choose whether to adopt partially effective protection. We define the utilities of the agents which depend on the degree of the agent, its individual infection status and action, as well as the the overall prevalence of the epidemic and strategy profile of the entire population. We further present the coupled dynamics of epidemic evolution as well as strategy update which is assumed to follow the replicator dynamics. By relying on timescale separation arguments, we first derive the game-theoretic protection adoption strategies of the agents for a given epidemic state, and then present the reduced epidemic dynamics. The existence and uniqueness of endemic equilibrium is rigorously characterized and forms the main result of this paper. We then present extensive numerical results to highlight the impacts of heterogeneous node degrees, infection rates, cost of protection adoption, and effectiveness of protection on the epidemic prevalence at the equilibrium. Finally, we illustrate the evolution of the networked SIR epidemic under game-theoretic protection adoption.
- Open Access
- 10 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 30 (2) , 1-32
Harnessing Machine Learning in Dynamic Thermal Management in Embedded CPU-GPU Platforms
With increasing transistor density, modern heterogeneous embedded processors often exhibit high temperature gradients due to complex application scheduling scenarios which may have missed design considerations. In many use cases, off-chip ”active” cooling solutions are considered prohibitive in such reduced form factors. Core frequency throttling by existing dynamic thermal management techniques often compromises the Quality-of-Service (QoS) and violates real-time deadlines. This necessitates the adoption of intelligent resource management that simultaneously manages both thermal and latency performance. Coupled with the complexity of modern heterogeneous multi-cores, the periodic application updates that cater to ever-changing user requirements often render model-driven thermal-aware resource allocation approaches unsuitable for heterogeneous multi-core systems. For such application-architecture scenarios, we propose a novel self-learning based resource manager using Reinforcement Learning that intelligently manipulates core frequencies and task set mappings to fulfill thermal and latency objectives. Our framework employs a data-driven system modeling technique using Gaussian Process Regression to enable efficient offline training of this learning-based resource manager to avoid challenges associated with initial online training. We evaluate the approach on a heterogeneous embedded CPU-GPU platform with real workloads and observe a significant reduction in peak operating temperature when compared to the default onboard frequency governor as well as other learning-based state-of-the-art approaches.
- 10 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 30 (2) , 1-32
Open AccessHarnessing Machine Learning in Dynamic Thermal Management in Embedded CPU-GPU Platforms
With increasing transistor density, modern heterogeneous embedded processors often exhibit high temperature gradients due to complex application scheduling scenarios which may have missed design considerations. In many use cases, off-chip ”active” cooling solutions are considered prohibitive in such reduced form factors. Core frequency throttling by existing dynamic thermal management techniques often compromises the Quality-of-Service (QoS) and violates real-time deadlines. This necessitates the adoption of intelligent resource management that simultaneously manages both thermal and latency performance. Coupled with the complexity of modern heterogeneous multi-cores, the periodic application updates that cater to ever-changing user requirements often render model-driven thermal-aware resource allocation approaches unsuitable for heterogeneous multi-core systems. For such application-architecture scenarios, we propose a novel self-learning based resource manager using Reinforcement Learning that intelligently manipulates core frequencies and task set mappings to fulfill thermal and latency objectives. Our framework employs a data-driven system modeling technique using Gaussian Process Regression to enable efficient offline training of this learning-based resource manager to avoid challenges associated with initial online training. We evaluate the approach on a heterogeneous embedded CPU-GPU platform with real workloads and observe a significant reduction in peak operating temperature when compared to the default onboard frequency governor as well as other learning-based state-of-the-art approaches.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 72 (7) , 6969-6979
Hybrid Model Predictive Control Framework for Efficient Operation of a Five-Port Converter Interfaced DC Microgrid
In this article, a hybrid model predictive control (MPC) based novel energy management framework for a dc microgrid is proposed to efficiently manage power sharing among photovoltaic (PV) source, battery, fuel cell, and supercapacitor while meeting critical load demand and satisfying operational constraints. In particular, the proposed framework mitigates certain practical operational challenges of the fuel cell and the electrolyzer, as laid down by the manufacturers. Instead of using multiple converters, a multiport converter topology is utilized for integrating the distributed energy resources (DERs) due to fewer conversion stages, compact size, cost-effectiveness, and ease of control. For smooth operation of the multiport converter, a hierarchical control unit is developed to coordinate with the hybrid MPC based supervisory controller and proportional–integral (PI) compensator based local controllers. Finally, a $\mathbf{2}$ kW laboratory prototype of the five-port converter is integrated with real DERs. The efficacy of the proposed energy management framework is demonstrated through experimental case studies which are designed to create challenging scenarios, such as large power mismatch due to stochastic PV generation and load.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 72 (7) , 6969-6979
Hybrid Model Predictive Control Framework for Efficient Operation of a Five-Port Converter Interfaced DC Microgrid
In this article, a hybrid model predictive control (MPC) based novel energy management framework for a dc microgrid is proposed to efficiently manage power sharing among photovoltaic (PV) source, battery, fuel cell, and supercapacitor while meeting critical load demand and satisfying operational constraints. In particular, the proposed framework mitigates certain practical operational challenges of the fuel cell and the electrolyzer, as laid down by the manufacturers. Instead of using multiple converters, a multiport converter topology is utilized for integrating the distributed energy resources (DERs) due to fewer conversion stages, compact size, cost-effectiveness, and ease of control. For smooth operation of the multiport converter, a hierarchical control unit is developed to coordinate with the hybrid MPC based supervisory controller and proportional–integral (PI) compensator based local controllers. Finally, a $\mathbf{2}$ kW laboratory prototype of the five-port converter is integrated with real DERs. The efficacy of the proposed energy management framework is demonstrated through experimental case studies which are designed to create challenging scenarios, such as large power mismatch due to stochastic PV generation and load.
- Open Access
Learning-Enabled Adaptive Voltage Protection Against Load Alteration Attacks On Smart Grids
Smart grids are designed to efficiently handle variable power demands, especially for large loads, by real-time monitoring, distributed generation and distribution of electricity. However, the grid's distributed nature and the internet connectivity of large loads like Heating Ventilation, and Air Conditioning (HVAC) systems introduce vulnerabilities in the system that cyber-attackers can exploit, potentially leading to grid instability and blackouts. Traditional protection strategies, primarily designed to handle transmission line faults are often inadequate against such threats, emphasising the need for enhanced grid security. In this work, we propose a Deep Reinforcement Learning (DRL)-based protection system that learns to differentiate any stealthy load alterations from normal grid operations and adaptively adjusts activation thresholds of the protection schemes. We train this adaptive protection scheme against an optimal and stealthy load alteration attack model that manipulates the power demands of HVACs at the most unstable grid buses to induce blackouts. We theoretically prove that the adaptive protection system trained in this competitive game setting can effectively mitigate any stealthy load alteration-based attack. To corroborate this, we also demonstrate the method's success in several real-world grid scenarios by implementing it in a hardware-in-loop setup.
Open AccessLearning-Enabled Adaptive Voltage Protection Against Load Alteration Attacks On Smart Grids
Smart grids are designed to efficiently handle variable power demands, especially for large loads, by real-time monitoring, distributed generation and distribution of electricity. However, the grid's distributed nature and the internet connectivity of large loads like Heating Ventilation, and Air Conditioning (HVAC) systems introduce vulnerabilities in the system that cyber-attackers can exploit, potentially leading to grid instability and blackouts. Traditional protection strategies, primarily designed to handle transmission line faults are often inadequate against such threats, emphasising the need for enhanced grid security. In this work, we propose a Deep Reinforcement Learning (DRL)-based protection system that learns to differentiate any stealthy load alterations from normal grid operations and adaptively adjusts activation thresholds of the protection schemes. We train this adaptive protection scheme against an optimal and stealthy load alteration attack model that manipulates the power demands of HVACs at the most unstable grid buses to induce blackouts. We theoretically prove that the adaptive protection system trained in this competitive game setting can effectively mitigate any stealthy load alteration-based attack. To corroborate this, we also demonstrate the method's success in several real-world grid scenarios by implementing it in a hardware-in-loop setup.