ACAshish Cherukuri

Ashish Cherukuri

*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


Ashish Cherukuri has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Stability of Information-Based Routing in Dynamic Transportation Networks

    by Shaya Garjani, Ashish Cherukuri, Bayu Jayawardhana, Nima Monshizadeh

    Recent studies on transportation networks have shown that real-time route guidance can inadvertently induce congestion or oscillatory traffic patterns. Nevertheless, such technologies also offer a promising opportunity to manage traffic non-intrusively by shaping the information delivered to users, thereby mitigating congestion and enhancing network stability. A key step toward this goal is to identify information signals that ensure the existence of an equilibrium with desirable stability and convergence properties. This challenge is particularly relevant when traffic density and routing dynamics evolve concurrently, as increasingly occurs with digital signaling and real-time navigation technologies. To address this, we analyze a parallel-path transportation network with a single origin-destination pair, incorporating joint traffic density and logit-based routing dynamics that evolve at the same timescale. We characterize a class of density-dependent traffic information that guarantees a unique equilibrium in the free-flow regime, ensures its asymptotic stability, and keeps traffic densities within the free-flow region for all time. The theoretical results are complemented by a numerical case study demonstrating how the framework can inform the design of traffic information that reduces total travel time without compromising credibility.

  • Iterative Risk-Constrained Model Predictive Control: A Data-Driven Distributionally Robust Approach

    by Alireza Zolanvari, Ashish Cherukuri

    This paper proposes an iterative distributionally robust model predictive control (MPC) scheme to solve a risk-constrained infinite-horizon optimal control problem. In each iteration, the algorithm generates a trajectory from the starting point to the desired equilibrium while ensuring safety encoded using risk constraints and improving either the cost or safety relative to previous iterations. At the end of each iteration, the visited states and observed samples of the uncertainty are stored and accumulated with the previous observations. For each iteration, the states stored previously are considered as terminal constraints of the MPC scheme, and samples obtained thus far are used to construct distributionally robust risk constraints. As iterations progress, more data is obtained and the environment is explored progressively to ensure better safety and cost optimality. We prove that the MPC scheme is recursively feasible and the trajectories converge asymptotically to the desired equilibrium while ensuring safety. We identify conditions under which the cost-to-go reduces as iterations progress. We provide computationally tractable reformulations of risk constraints for total variation and Wasserstein-based ambiguity sets with finitely supported distributions. A simulation example illustrates the application of our results in finding a risk-constrained path for two mobile robots facing an uncertain obstacle.


  • Distributed Alternating Gradient Descent for Convex Semi-Infinite Programs Over a Network

    by Ashwin Aravind, Debasish Chatterjee, Ashish Cherukuri

    This article presents a first-order distributed algorithm for solving a convex semi-infinite program (SIP) over a time-varying network. In this setting, the objective function associated with the optimization problem is a summation of a set of functions, each held by one node in a network. The semi-infinite constraint, on the other hand, is known to all agents. The nodes collectively aim to solve the problem using local data about the objective and limited communication capabilities depending on the network topology. Our algorithm is built on three key ingredients: consensus step, gradient descent in the local objective, and local gradient descent iterations in the constraint at a node when the estimate violates the semi-infinite constraint. The algorithm is constructed, and its parameters are prescribed in such a way that the iterates held by each agent provably converge to an optimizer. That is, as the algorithm progresses, the estimates achieve consensus, and the constraint violation and the error in the optimal value are bounded above by vanishing terms. Simulation examples illustrate our results.


  • Joint Investment-Operation Planning for Assessing the Economic Impact of Hydrogen Integration in Power Systems

    by Amin Maghami, Evrim Ursavas, Ashish Cherukuri

    The transition to renewable energy is pivotal for achieving decarbonization goals in the electricity sector. The focus on low-carbon emissions extends beyond the power sector, emphasizing the need for efficient planning for other energy carriers like green hydrogen. However, the intermittency of renewable sources necessitates solutions for operational planning and supply security, making energy storage systems vital for grid services. Battery energy storage systems (BESS) play a key role in future power networks dominated by renewables, as a short-term buffer. This study explores the conditions under which integrating large-scale BESS with hydrogen facilities in the power network enhances overall system profitability. We analyze this by formulating a joint investment-operation decision-making process, modeled as a mixed-integer chance-constrained optimization problem. To address computational challenges, we implement a scalable decomposition-based solution method that enables tractable optimization. Through the optimal solutions, we analyze different incentive strategies and technology cost scenarios to accelerate the kick-off of hydrogen production. By addressing the challenges of intermittency, pricing mechanisms, and optimizing the synergy between BESS and hydrogen systems, this research provides insights for resilient and profitable renewable energy networks, highlighting that hydrogen selling price significantly influences investment decisions and that incentives can accelerate market entry and transition.


  • Dynamic Interventions With Limited Knowledge in Network Games

    by Mehran Shakarami, Ashish Cherukuri, Nima Monshizadeh

    This paper studies the problem of intervention design for steering the actions of noncooperative players in quadratic network games to the social optimum. The players choose their actions with the aim of maximizing their individual payoff functions, while a central regulator uses interventions to modify their marginal returns and maximize the social welfare function. This work builds on the key observation that the solution to the steering problem depends on the knowledge of the regulator on the players' parameters and the underlying network. We, therefore, consider different scenarios based on limited knowledge and propose suitable static, dynamic and adaptive intervention protocols. We formally prove convergence to the social optimum under the proposed mechanisms. We demonstrate our theoretical findings on a case study of Cournot competition with differentiated goods.


  • Open Access

    Sample average approximation of conditional value-at-risk based variational inequalities

    by Ashish Cherukuri

    This paper focuses on a class of variational inequalities (VIs), where the map defining the VI is given by the component-wise conditional value-at-risk (CVaR) of a random function. We focus on solving the VI using sample average approximation, where solutions of the VI are estimated with solutions of a sample average VI that uses empirical estimates of the CVaRs. We establish two properties for this scheme. First, under continuity of the random map and the uncertainty taking values in a bounded set, we prove asymptotic consistency, establishing almost sure convergence of the solution of the sample average problem to the true solution. Second, under the additional assumption of random functions being Lipschitz, we prove exponential convergence where the probability of the distance between an approximate solution and the true solution being smaller than any constant approaches unity exponentially fast. The exponential decay bound is refined for the case where random functions have a specific separable form in the decision variable and uncertainty. We adapt these results to the case of uncertain routing games and derive explicit sample guarantees for obtaining a CVaR-based Wardrop equilibria using the sample average procedure. We illustrate our theoretical findings by approximating the CVaR-based Wardrop equilibria for a modified Sioux Falls network.


  • A Two-Step Approach to Wasserstein Distributionally Robust Chance- and Security-Constrained Dispatch

    by Amin Maghami, Evrim Ursavas, Ashish Cherukuri

    This paper considers a security constrained dispatch problem involving generation and line contingencies in the presence of the renewable generation. The uncertainty due to renewables is modeled using joint chance-constraint and the mismatch caused by contingencies and renewables are handled using reserves. We consider a distributionally robust approach to solve the chance-constrained program. We assume that samples of the uncertainty are available. Using them, we construct a set of distributions, termed ambiguity set, containing all distributions that are close to the empirical distribution under the Wasserstein metric. The chance constraint is imposed for all distributions in the ambiguity set to form the distributionally robust optimization problem. This problem is nonconvex and computationally heavy to solve exactly. We adopt a two-step approach to find an approximate solution. In the first step, we construct a polyhedral set in the space of uncertainty that contains enough mass under all distributions in the ambiguity set. This set is constructed by solving several two-dimensional distributionally robust problems. In the second step, we solve a linear robust optimization problem where the uncertain constraint is imposed for all uncertainty values lying in the polyhedral set. We demonstrate the scalability and robustness of our method using numerical experiments.


  • Open Access

    Cross Apprenticeship Learning Framework: Properties and Solution Approaches

    by Ashwin Aravind, Debasish Chatterjee, Ashish Cherukuri

    Apprenticeship learning is a framework in which an agent learns a policy to perform a given task in an environment using example trajectories provided by an expert. In the real world, one might have access to expert trajectories in different environments where system dynamics is different while the learning task is the same. For such scenarios, two types of learning objectives can be defined. One where the learned policy performs very well in one specific environment and another when it performs well across all environments. To balance these two objectives in a principled way, our work presents the cross apprenticeship learning (CAL) framework. This consists of an optimization problem where an optimal policy for each environment is sought while ensuring that all policies remain close to each other. This nearness is facilitated by one tuning parameter in the optimization problem. We derive properties of the optimizers of the problem as the tuning parameter varies. We identify conditions under which an agent prefers using the policy obtained from CAL over the traditional apprenticeship learning. Since the CAL problem is nonconvex, we provide a convex outer approximation. Finally, we demonstrate the attributes of our framework in the context of a navigation task in a windy gridworld environment.