SearcharxivSearch

arXiv subjects

Priyank Behera

Publications and source records attributed to Priyank Behera.

4 recordsLinked to original sources

Stochastic Dynamics of Low Earth Orbit Near Full Capacity

The capacity of Low Earth Orbit (LEO) to sustain space operations is under mounting pressure from megaconstellations, legacy fragmentation debris, and new payload classes. Existing assessments of orbital capacity and debris evolution are largely deterministic, tracking mean populations of intact satellites and fragments with ordinary differential equations; they cannot capture the inherent randomness of collisions, breakup sizes, and launch schedules. We develop a stochastic extension of the two-species Lotka--Volterra model of Bradley and Wein, formulated as a density-dependent Markov chain, and study its deterministic and stochastic scaling limits. Because intacts and fragments differ by many orders of magnitude, these limits emerge on distinct time-scales, and different pathways to a collisional Kessler cascade become visible only on the appropriate time horizon. On a fast intact time-scale we obtain an ODE approximation and a Gaussian SDE approximation; on an intermediate fragment time-scale we obtain an ODE approximation, a Gaussian SDE approximation, and the critical Kessler threshold, above which the ODE approximation runs away in Kessler syndrome. Crucially, on a third, slow time-scale at the critical threshold, the fragment count converges to a Feller diffusion, in which runaway is triggered purely by fluctuations rather than by the drift---an effect the ODE approximations and their Gaussian SDE approximations cannot see. Debris runaway may occur sooner, and with higher probability, than deterministic models predict: the intact population can appear well-behaved while fragments quietly accumulate risk. Constellation deployment, debris-removal investment, and slot allocation should account for these stochastic effects, and planning for runaway must depend on the variance of the collision dynamics, not on the mean alone.

math.PR

Influence Diagrams for Robust Multi-Target Tracking

Multi-Target Tracking (MTT) is foundational for radar, defense, and autonomous systems, where tracking accuracy directly affects decision-making and safety. For linear systems with Gaussian process and measurement noise, the Kalman filter remains the gold standard for state estimation. However, its performance can degrade in real-world scenarios where measurement noise is temporally correlated. This violates the white-noise assumptions that Kalman filters have. Various approaches include state augmentation of the Kalman filter, but this approach is susceptible to failure due to ill-conditioned problem formulations. This work investigates the limitations of classical Kalman filtering in colored noise environments and presents an influence diagram-based approach to the Joint Probabilistic Data Association Filter (JPDAF). Simulation results on benchmark scenarios demonstrate that the Influence Diagram JPDAF (ID-JPDAF) achieves lower root mean square error (RMSE) than classical methods. These findings highlight the potential of influence diagram models for advancing multi-target tracking performance in radar and related applications.

math.OC

Gaussian Bayesian Networks for Estimating Stiff Continuous-Discrete Stochastic Systems with Ill-Conditioned Measurements

This paper introduces a Gaussian Bayesian Network-based Extended Kalman Filter (GBN-EKF) for non-linear state estimators on stiff and ill-conditioned continuous-discrete stochastic systems, with a further analysis on systems with ill-conditioned measurements. For most nonlinear systems, the Unscented Kalman Filter (UKF) and the Cubature Kalman Filter (CKF) typically outperform the Extended Kalman Filter (EKF). But, in state estimation of stochastic systems, the EKF outperforms the CKF and UKF. This paper aims to extend the advantages of the EKF by applying a Gaussian Bayesian Network approach to the EKF (GBN-EKF), and analyzing its performance against all three filters. The GBN-EKF does not utilize any matrix inversions. This makes the GBN-EKF stable with respect to ill-conditioned matrices. Further, the GBN-EKF achieves comparable accuracy to the EKF in stiff and ill-conditioned stochastic systems, while having lower root mean squared error (RMSE) under these conditions.

math.OC

GRADE: Grover-based Benchmarking Toolkit for Assessing Quantum Hardware

Quantum computing holds the potential to provide speedups in solving complex problems that are currently difficult for classical computers. However, the realization of this potential is hindered by the issue of current hardware reliability, primarily due to noise and architectural imperfections. As quantum computing systems rapidly advance, there exists a need to create a generalizable benchmarking tool that can assess reliability across different hardware platforms. In this paper, we introduce GRADE (Grover-based Reliability Assessment for Device Evaluation), an open-source benchmarking toolkit to evaluate the reliability of quantum hardware using a generalized form of Grover's algorithm. GRADE operates by implementing Grover's algorithm to search through a variety of primitive collections that are customizable by the user, analyzing the probability distribution of the results to assess accuracy and stability. This approach aims to evaluate the hardware performance of Grover's algorithm, which is fundamental in unordered search problems, making it an ideal candidate for benchmarking purposes, as it is one of the few generalizable quantum algorithms that provide a direct speedup. Importantly, GRADE can adapt to a wide range of quantum computing platforms, ensuring it can be applied across different hardware architectures. Additionally, our work provides a scoring function for evaluating the hardware performance for multi-target Grover's implementation. Our work validates this approach across a multitude of simulators and hardware platforms from varying providers, demonstrating its adaptability to differing backend providers.

quant-ph