arXiv subjects

Shreshta Rajakumar Deshpande

Publications and source records attributed to Shreshta Rajakumar Deshpande.

8 recordsLinked to original sources

arXiv2026

Advances in Battery Energy Storage Management: Control and Economic Synergies

The existing literature on Battery Energy Storage Systems (BESS) predominantly focuses on two main areas: control system design aimed at achieving grid stability and the techno-economic analysis of BESS dispatch on power grid. However, with the increasing incorporation of ancillary services into power grids, a more comprehensive approach to energy management systems is required. Such an approach should not only optimize revenue generation from BESS but also ensure the safe, efficient, and reliable operation of lithium-ion batteries. This research seeks to bridge this gap by exploring literature that addresses both the economic and operational dimensions of BESS. Specifically, it examines how economic aspects of grid duty cycles can align with control schemes deployed in BESS systems. This alignment, or synergy, could be instrumental in creating robust digital twins virtual representations of BESS systems that enhance both grid stability and revenue potential. The literature review is organized into five key categories: (1) ancillary services for BESS, exploring support functions that BESS can provide to power grids; (2) control systems developed for real-time BESS power flow management, ensuring smooth operations under dynamic grid conditions; (3) optimization algorithms for BESS dispatch, focusing on efficient energy allocation strategies; (4) techno-economic analyses of BESS and battery systems to assess their financial viability; and (5) digital twin technologies for real-world BESS deployments, enabling advanced predictive maintenance and performance optimization. This review will identify potential synergies, research gaps, and emerging trends, paving the way for future innovations in BESS management and deployment strategies.

eess.SY↗

arXiv2025

Negotiating Highway Interchange Traffic with a Decentralized Instability-Driven CBF-based Algorithm

In this paper we consider an interchange lane-swap scenario, a limited stretch of highway with two parallel lanes where most vehicles want to change lanes. We show that a particular decentralized Control Barrier Function based algorithm executes lane swaps efficiently, with minimal speed change, within the specified (short) road segment at high traffic densities (3,500 vehicles per hour per lane). Our main point is that controller tuning, the speed of inter-agent instability, plays a major role in the performance of the vehicle group. This is illustrated by comparing two different tunings of the controller and a third one where the lane swap is enforced by virtual guard rails. Like fighter jet dynamic instability improving maneuverability, the inter-agent instability improves agility of a group of vehicles. We emphasize that the controllers considered are decentralized: agents do not know if others want to change lanes or not.

eess.SY↗

arXiv2025

Decentralized Merging Control of Connected and Automated Vehicles to Enhance Safety and Energy Efficiency using Control Barrier Functions

This paper presents a decentralized Control Barrier Function (CBF) based approach for highway merging of Connected and Automated Vehicles (CAVs). In this control algorithm, each "host" vehicle negotiates with other agents in a control zone of the highway network, and enacts its own action, to perform safe and energy-efficient merge maneuvers. It uses predictor-corrector loops within the robust CBF setting for negotiation and to reconcile disagreements that may arise. There is no explicit order of vehicles and no priority. A notable feature is absence of gridlocks due to instability of the inter-agent system. Results from Monte Carlo simulations show significant improvement in the system-wide energy efficiency and traffic flow compared to a first-in-first-out approach, as well as enhanced robustness of the proposed decentralized controller compared to its centralized counterpart.

eess.SY↗

arXiv2025

Energy-efficient Merging of Connected and Automated Vehicles using Control Barrier Functions

Highway merges present difficulties for human drivers and automated vehicles due to incomplete situational awareness and a need for a structured (precedence, order) environment, respectively. In this paper, an unstructured merge algorithm is presented for connected and automated vehicles. There is neither precedence nor established passing order through the merge point. The algorithm relies on Control Barrier Functions for safety (collision avoidance) and for coordination that arises from exponential instability of stall-equilibria in the inter-agent space. A Monte Carlo simulation comparison to a first-in-first-out approach shows improvement in traffic flow and a significant energy efficiency benefit.

eess.SY↗

arXiv2021

Real-time Eco-Driving Control in Electrified Connected and Autonomous Vehicles using Approximate Dynamic Programming

Connected and Automated Vehicles (CAVs), particularly those with a hybrid electric powertrain, have the potential to significantly improve vehicle energy savings in real-world driving conditions. In particular, the Eco-Driving problem seeks to design optimal speed and power usage profiles based on available information from connectivity and advanced mapping features to minimize the fuel consumption over an itinerary. This paper presents a hierarchical multi-layer Model Predictive Control (MPC) approach for improving the fuel economy of a 48V mild-hybrid powertrain in a connected vehicle environment. Approximate Dynamic Programming (ADP) is used to solve the Receding Horizon Optimal Control Problem (RHOCP), where the terminal cost for the RHOCP is approximated as the base-policy obtained from the long-term optimization. The controller was extensively tested virtually (using both deterministic and Monte Carlo simulations) across multiple real-world routes where energy savings of more than 20\% have been demonstrated. Further, the developed controller was deployed and tested at a proving ground in real-time on a test vehicle equipped with a rapid prototyping embedded controller. Real-time in-vehicle testing confirmed the energy savings observed in simulation and demonstrated the ability of the developed controller to be effective in real-time applications.

eess.SY↗

arXiv2021

A GPU Implementation of a Look-Ahead Optimal Controller for Eco-Driving Based on Dynamic Programming

Predictive energy management of Connected and Automated Vehicles (CAVs), in particular those with multiple power sources, has the potential to significantly improve energy savings in real-world driving conditions. In particular, the eco-driving problem seeks to design optimal speed and power usage profiles based upon available information from connectivity and advanced mapping features to minimize the fuel consumption between two designated locations. In this work, the eco-driving problem is formulated as a three-state receding horizon optimal control problem and solved via Dynamic Programming (DP). The optimal solution, in terms of vehicle speed and battery State of Charge (SoC) trajectories, allows a connected and automated hybrid electric vehicle to intelligently pass the signalized intersections and minimize fuel consumption over a prescribed route. To enable real-time implementation, a parallel architecture of DP is proposed for an NVIDIA GPU with CUDA programming. Simulation results indicate that the proposed optimal controller delivers more than 15% fuel economy benefits compared to a baseline control strategy and that the solver time can be reduced by more than 90% by the parallel implementation when compared to a serial implementation.

eess.SY↗

arXiv2021

An Algorithm to Warm Start Perturbed (WASP) Constrained Dynamic Programs

Receding horizon optimal control problems compute the solution at each time step to operate the system on a near-optimal path. However, in many practical cases, the boundary conditions, such as external inputs, constraint equations, or the objective function, vary only marginally from one time step to the next. In this case, recomputing the optimal solution at each time represents a significant burden for real-time applications. This paper proposes a novel algorithm to approximately solve a perturbed constrained dynamic program that significantly improves the computational burden when the objective function and the constraints are perturbed slightly. The method hinges on determining closed-form expressions for first-order perturbations in the optimal strategy and the Lagrange multipliers of the perturbed constrained dynamic programming problem are obtained. This information can be used to initialize any algorithm (such as the method of Lagrange multipliers, or the augmented Lagrangian method) to solve the perturbed dynamic programming problem with minimal computational resources.

math.OC↗

arXiv2020

Integrated Approximate Dynamic Programming and Equivalent Consumption Minimization Strategy for Eco-Driving in a Connected and Automated Vehicle

This paper focuses on the velocity planning and energy management problems for Connected and Automated Vehicles (CAVs) with hybrid electric powertrains. The eco-driving problem is formulated in the spatial domain as a nonlinear dynamic optimization problem, in which information about the upcoming speed limits and road topography is assumed to be known a priori. To solve this problem, a novel Dynamic Programming (DP) based optimization method is proposed, in which a causal Equivalent Consumption Minimization Strategy (ECMS) is embedded. The underlying vehicle model to predict energy consumption over real-world routes is validated using experimental data. Further, a multi-layer hierarchical control architecture is proposed as a pathway to real-time implementation in a vehicle. The DP-ECMS algorithm is introduced for a long-horizon optimization problem, and then adapted for a receding horizon implementation using principles in Approximate Dynamic Programming (ADP). This computationally economical alternative to the traditional DP solution is then benchmarked and evaluated.

eess.SY↗