Pratishtha Shukla

Pratishtha Shukla

Auto-generated profile, based on publicly available information

Pratishtha Shukla

Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
29 September 2022 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
PSPratishtha Shukla
Pratishtha Shukla
LALu An
Lu An
ACAranya Chakrabortty
Aranya Chakrabortty
ADAlexandra Duel-Hallen
Alexandra Duel-Hallen
We present a resource-planning game for cyber-security of networked control systems (NCSs). The NCS is assumed to be operating in closed loop using a linear state feedback $\mathcal {H}_{2}$ -controller. A zero-sum, two-player Stackelberg game (SG) is developed between an attacker and a defender for this NCS. The attacker aims to disable communication of selected nodes and thereby render the feedback gain matrix to be sparse, leading to degradation of closed-loop performance, while the defender aims to prevent this loss by investing in the protection of targeted nodes. Both the players trade their $\mathcal {H}_{2}$ -performance objectives for the costs of their actions. The standard backward induction (BI) method is modified to determine a cost-based Stackelberg equilibrium (CBSE) that saves the players’ costs without degrading the control performance. We analyze the dependence of a CBSE on the relative budgets of the players and on the node “importance” order. Moreover, a robust defense (RD) method is developed for the realistic case when the defender is not informed about the attacker’s resources. The proposed algorithms are validated using examples from wide-area control of electric power systems. It is demonstrated that reliable and RD is feasible unless the defender’s resources are severely limited relative to the attacker’s resources. We also show that the proposed methods are robust to time-varying model uncertainties and thus are suitable for long-term security investment in realistic NCSs. Finally, we use computationally efficient genetic algorithms (GAs) to compute the optimal strategies of the attacker and the defender in realistic large power systems.

5 January 2023 in Computational Materials Science
Verified
Journal Article
Closed access
JNJames Nutaro
James Nutaro
BSBenjamin Stump
Benjamin Stump
PSPratishtha Shukla
Pratishtha Shukla

13 December 2023
Verified
Conference Paper
Open access
LALu An
Lu An
PSPratishtha Shukla
Pratishtha Shukla
ACAranya Chakrabortty
Aranya Chakrabortty
ADAlexandra Duel-Hallen
Alexandra Duel-Hallen
We develop investment approaches to secure electric power systems against load attacks where a malicious intruder (the attacker) covertly changes reactive power setpoints of loads to push the grid towards voltage instability while the system operator (the defender) employs reactive power compensation (RPC) to prevent instability. Extending our previously reported Stackelberg game formulation for this problem, we develop a robust-defense sequential algorithm and a novel genetic algorithm that provides scalability to large-scale power system models. The proposed methods are validated using IEEE prototype power system models with time-varying load uncertainties, demonstrating that reliable and robust defense is feasible unless the operator's RPC investment resources are severely limited relative to the attacker's resources.

16 May 2025 in ACM Transactions on Modeling and Computer Simulation
Verified
Journal Article
Open access
SYSrikanth Yoginath
Srikanth Yoginath
PSPratishtha Shukla
Pratishtha Shukla
JNJames Nutaro
James Nutaro
SSSudip Seal
Sudip Seal
Simulation cloning is a technique in which cloned simulations whose state spaces differ partially from their parent simulation due to intervening events are spawned at runtime and concurrently advanced. It is a powerful method to carry out what-if analysis by speculatively exploring and evaluating the impact of various permutations of intervening cascade of events. Due to the exponential growth in the number of possible clones even for a small number of distinct intervening events, the practical efficacy of the approach is often severely limited by the maximum available memory of the computing host. In this paper, we introduce a novel speculative simulation cloning framework that executes a simulation cloning campaign capable of efficiently exploring an exponentially large space of clone simulations created by permutation of intervening events under a finite memory constraint. We provide a theoretical analysis of the runtime characteristics of our proposed approach and highlight its novel advantages such as memory-aware and as-long-as-needed execution. In support of our analytical findings and to demonstrate its practical feasibility, we implement a prototype of the cloning framework on a shared memory system and report its performance characteristics in the context of a heat diffusion simulation, and a power grid simulation subject to cascading disruptions from geomagnetic disturbances.

1 January 2026 in IEEE Access
Verified
Journal Article
Open access
PSPratishtha Shukla
Pratishtha Shukla
SYSrikanth B. Yoginath
Srikanth B. Yoginath
MAMaksudul Alam
Maksudul Alam
NSNils Stenvig
Nils Stenvig

1 September 2026
Verified
Report
Closed access
PDF file
USUsdoe
Usdoe
NSNils Stenvig
Nils Stenvig
O(Oak Ridge Oak Ridge National Laboratory (Ornl)
Oak Ridge Oak Ridge National Laboratory (Ornl)
SYSrikanth Yoginath
Srikanth Yoginath
PSPratishtha Shukla
Pratishtha Shukla
MAMaksudul Alam
Maksudul Alam
Electric-grid resilience is difficult to quantify because system performance depends on network topology, component reliability, operating configuration, and restoration time. This project produced a scalable component-level framework for estimating resilience at grid interconnection points. The framework converts standard power-system planning models to undirected network graphs, and uses iterative minimum-cut calculations to identify branch combinations capable of disconnecting each location. Prescribed component failure rates and restoration times are associated with the graph edges and aggregated across the identified cut sets to calculate nodal availability and unavailability. A separate connectivity-loss measure records how frequently each node is disconnected across the enumerated cuts and provides a topology-based indicator independent of outage probability. The method was verified on the Institute of Electrical and Electronics Engineers (IEEE) 14- and 57-bus test systems, and the software installation was extended to Eastern Interconnection subsystems. Results show that expected service continuity varies by location according to source-path redundancy, component performance, and restoration assumptions. The resulting approach provides an interpretable measure of expected grid performance and risk to support identification of vulnerable interconnection points, comparison of infrastructure alternatives, prioritization of component hardening, and resilience-informed decision-making.