SearcharxivSearch

arXiv subjects

Goutam Das

Publications and source records attributed to Goutam Das.

At least 19 recordsLinked to original sources

Model Predictive Path Integral Control as a Quantum Query Problem

Model predictive path integral control computes its update from cost-weighted trajectory samples and may require many classical rollouts in rare-event or high-accuracy regimes. We reformulate each component of the finite-ensemble MPPI update as a ratio of bounded path expectations and construct reversible rollout oracles encoding them as success probabilities, making the update directly estimable by quantum amplitude estimation. This gives a quadratic improvement in the query dependence on accuracy and rare-event desirability over classical Monte Carlo sampling, matching known lower bounds for the underlying scalar problem below the exhaustive-evaluation threshold, while our coordinatewise construction incurs a linear dependence on the number of control inputs. For a fixed ensemble, the low-temperature weights concentrate on the minimum-cost trajectories, connecting the limiting control to quantum minimum finding when the minimizer is unique. A fully enumerable guidance example validates the predicted estimator scalings, and an illustrative operation-count model with a crossover condition separates query advantage from modeled implementation advantage.

eess.SY

Bound-Optimized Task Choice for Path Integral Control

Path Integral (PI) control is a powerful sampling-based method for stochastic optimal control, but it requires a restrictive coupling between the noise covariance and the control cost matrix that is rarely satisfied in practice, particularly in aerospace and cyber-physical systems. We propose Bound-Optimized Task Choice (BOTC), a framework that optimizes over the entire space of valid approximations, termed tasks, satisfying the PI coupling constraint. We prove that every task provides an upper bound on the true cost-to-go and that BOTC minimizes this bound. We derive a change-of-measure formulation that enables evaluation of all candidate tasks from a single set of Monte Carlo samples, eliminating the need to resample for each candidate task. The resulting optimization is parameterized by a positive semi-definite matrix. Furthermore, we propose a novel Normal-Inverse-Wishart distribution-based importance sampling scheme to improve global optimization. We validate BOTC on a finite-horizon stochastic linear-quadratic regulator problem, demonstrating that it tracks the constrained optimum.

eess.SY

Path Integral Control for Partially Observed Systems with Controlled Sensing

Path integral control in Gaussian belief space requires a structural matching condition between the observation-driven diffusion of the belief mean and the actuation authority, which a fixed observation matrix cannot enforce. We treat the observation matrix as a control variable and show that constraining the sensing control to a measurable selector from the resulting matching set reduces the Hamilton-Jacobi-Bellman equation for the belief mean and covariance to a linear PDE with a Feynman-Kac representation.

eess.SY

Path Integral Control in Gaussian Belief Space for Partially Observed Systems

This paper extends path integral control (PIC) to partially observed systems by formulating the problem in Gaussian belief space. PIC relies on the diffusion being proportional to the control channel -- the so-called matching condition -- to linearize the Hamilton-Jacobi-Bellman equation via the Cole-Hopf transform; we show that this condition fails in infinite-dimensional belief space under non-affine observations. Restricting to Gaussian beliefs yields a finite-dimensional approximation with deterministic covariance evolution, reducing the problem to stochastic control of the belief mean. We derive necessary and sufficient conditions for matching in this reduced space, obtain an exact Cole-Hopf linearization with a Feynman-Kac representation, and develop the MPPI-Belief algorithm. Numerical experiments on a navigation task with state-dependent observation noise demonstrate the effectiveness of MPPI-Belief relative to certainty-equivalent and particle-filter-based baselines.

eess.SY

Game-Theory-Assisted Reinforcement Learning for Border Defense: Early Termination based on Analytical Solutions

Game theory provides the gold standard for analyzing adversarial engagements, offering strong optimality guarantees. However, these guarantees often become brittle when assumptions such as perfect information are violated. Reinforcement learning (RL), by contrast, is adaptive but can be sample-inefficient in large, complex domains. This paper introduces a hybrid approach that leverages game-theoretic insights to improve RL training efficiency. We study a border defense game with limited perceptual range, where defender performance depends on both search and pursuit strategies, making classical differential game solutions inapplicable. Our method employs the Apollonius Circle (AC) to compute equilibrium in the post-detection phase, enabling early termination of RL episodes without learning pursuit dynamics. This allows RL to concentrate on learning search strategies while guaranteeing optimal continuation after detection. Across single- and multi-defender settings, this early termination method yields 10-20% higher rewards, faster convergence, and more efficient search trajectories. Extensive experiments validate these findings and demonstrate the overall effectiveness of our approach.

cs.LG

Threshold resummation for gluon fusion $ZH$ production at the LHC

We present precise results for the $ZH$ production cross-section and invariant mass distribution at the LHC, taking into account the effects of the leading and sub-leading soft gluons. We improve both quark-initiated and gluon-initiated subprocesses through threshold resummation within the QCD framework.

hep-ph

Threshold Resummation of Drell-Yan type colorless processes at LHC

We look at the threshold effects in neutral and charged Drell-Yan production, Higgs boson production with a massive vector boson, and Higgs production in bottom quark annihilation at the Large Hadron Collider (LHC), up to the third order in QCD. Using third-order soft-virtual (SV) results and the universal properties of threshold logarithms, we find the process-dependent coefficients and improve the accuracy by including large threshold logarithms up to next-to-next-to-next-to-leading logarithmic (N$^3$LL) order and matched with the latest N$^3$LO results. We also show numerical results for the invariant mass distributions and total production cross sections for these processes. Our findings show that the theoretical scale uncertainties, which are about $0.4\%$ at N$^3$LO in fixed-order calculations, decrease to less than $0.1\%$ at N$^3$LO+N$^3$LL after SV threshold resummation in the high invariant mass region.

hep-ph

Scheduling for TWDM-EPON-Based Fronthaul Without a Dedicated Registration Wavelength

The adoption of Centralized Radio Access Network (C-RAN) architectures requires fronthaul systems capable of carrying large volumes of radio data while meeting stringent delay and jitter requirements. Ethernet Passive Optical Networks (EPONs) have emerged as a promising fronthaul solution due to their cost efficiency and compatibility with existing infrastructure. However, the traditional registration process for EPON systems halts the ongoing data transmissions during the registration period, thereby violating the enhanced Common Public Radio Interface (eCPRI) delay and jitter requirements. This limitation has been acknowledged by the ITU-T, which recommends the use of a dedicated wavelength channel for registration, leading to inefficient bandwidth utilization. In this paper, we propose a novel scheduling framework for a Time and Wavelength Division Multiplexed (TWDM) EPON-based fronthaul that enables periodic registration without wasting an additional wavelength channel. Performance evaluation demonstrates that the proposed method achieves up to a 71\% increase in the number of Radio Units (RUs) supported for a given number of wavelength channels, compared to a baseline scheme employing a dedicated registration wavelength.

cs.NI

The inclusive Higgs boson cross-section in gluon-gluon fusion in soft-virtual approximation at fourth order in QCD

We present precise results for the inclusive Higgs boson cross-section in gluon-gluon fusion at the LHC considering state-of-the-art fourth-order results in perturbative QCD arising from the dominant soft and virtual gluon emissions. Utilizing four-loop QCD results for the gluon-form factor, the splitting function and related anomalous dimensions, we study the effects of threshold enhanced soft gluon emissions and estimate their impact on the total cross-section at the fourth order. Our study highlights the role of these higher-order contributions in improving the perturbative convergence and in significantly reducing the renormalization and factorization scale uncertainties. The results provide strong evidence for the perturbative stability and reliability of Higgs boson cross-section predictions at the LHC, thereby reinforcing the robustness of theoretical inputs in precision Higgs phenomenology. We also provide cross-section predictions using a large set of available parton distribution functions and show that, together with the value of the strong coupling $\alpha_s(m_Z)$, they cause the largest residual uncertainty for the Higgs boson cross-section in gluon-gluon fusion.

hep-ph

Threshold improved $Z H$ production at the LHC

We present precise theoretical results for the $ZH$ production cross section and invariant mass distribution at the Large Hadron Collider (LHC) taking into account the effects of soft gluons. We improve both quark-initiated and gluon-initiated subprocesses through threshold resummation within the QCD framework and present combined results relevant for $13.6$ TeV LHC.

hep-ph

Soft gluon resummation for gluon fusion $ZH$ production

We examine the effects of soft gluons on Higgs boson production in association with a $Z$ boson at the Large Hadron Collider (LHC). Utilizing the universal cusp anomalous dimensions and splitting kernels, we analyze effects of soft gluons on the gluon fusion $ZH$ process, focusing on the total production cross-section as well as the invariant mass distribution at the next-to-leading logarithmic level. Additionally, we estimate the next-to-soft effects on this subprocess to the same level of accuracy. A detailed phenomenological analysis is performed for the $13.6$ TeV LHC. Finally, combining these results with those from other subprocesses, we provide comprehensive predictions for the $ZH$ production cross-section and the invariant mass distribution that will be valuable for comparison with experimental data from the upcoming LHC run as well as the future hadron colliders.

hep-ph

Online RMLSA in EONs with $A^3G$: Adaptive ACO with Augmentation of Graph

Routing and Spectrum Assignment (RSA) represents a significant challenge within Elastic Optical Networks (EONs), particularly in dynamic traffic scenarios where the network undergoes continuous changes. Integrating multiple modulation formats transforms it into Routing Modulation Level and Spectrum Assignment (RMLSA) problem, thereby making it more challenging. Traditionally, addressing the RSA problem involved identifying a fixed number of paths and subsequently allocating spectrum among them. Numerous heuristic and metaheuristic approaches have been proposed for RSA using this two-step methodology. However, solving for routing and assignment of spectrum independently is not recommended due to their interdependencies and their impact on resource utilization, fragmentation and bandwidth blocking probability. In this paper, we propose a novel approach to solve the RMLSA problem jointly in dynamic traffic scenarios, inspired by Ant Colony Optimization (ACO). This approach involves augmenting the network into an Auxiliary Graph and transforming conventional ACO into a constraint-based ACO variant that adapts to the constraints of EONs. This adaptation also includes an adaptive initiation process and an aggressive termination strategy aimed at achieving faster convergence. Moreover, we have introduced a novel objective/fitness function, to minimize average network fragmentation while ensuring optimal spectrum resource utilization, thereby reducing overall blocking probability.

cs.NI

NNLO beam functions for angularity distributions

The popular class of angularity event shapes provides a wealth of information on the hadronic final-state distribution in collider events. While initially proposed for $e^+ e^-$ collisions, angularities have more recently attracted considerable interest as a jet substructure observable at hadron colliders. Moreover, angularities can be measured as a global event shape in deep inelastic electron-nucleon scattering (DIS), and the respective factorisation theorem contains a beam function that parametrises the collinear initial-state radiation. In the present work, we compute the quark and gluon beam functions for seven different angularities to next-to-next-to-leading order (NNLO) in the strong-coupling expansion. Our calculation is based on an automated framework that was previously developed for SCET-2 observables, and which we transfer in the current work to the generic SCET-1 case. Our results are relevant for resumming DIS angularity distributions at NNLL$'$ accuracy.

hep-ph

Heterogeneous Roles against Assignment Based Policies in Two vs Two Target Defense Game

In this paper, we consider a target defense game in which the attacker team seeks to reach a high-value target while the defender team seeks to prevent that by capturing them away from the target. To address the curse of dimensionality, a popular approach to solve such team-vs-team game is to decompose it into a set of one-vs-one games. Such an approximation assumes independence between teammates assigned to different one-vs-one games, ignoring the possibility of a richer set of cooperative behaviors, ultimately leading to suboptimality. In this paper, we provide teammate-aware strategies for the attacker team and show that they can outperform the assignment-based strategy, if the defenders still employ an assignment-based strategy. More specifically, the attacker strategy involves heterogeneous roles where one attacker actively intercepts a defender to help its teammate reach the target. We provide sufficient conditions under which such a strategy benefits the attackers, and we validate the results using numerical simulations.

eess.SY

Next-to-soft threshold effects on Higgs boson production via bottom quark annihilation

We examine the behavior of singular leading and sub-leading logarithms, commonly referred to as the soft-virtual (SV) and next-to-soft-virtual (NSV) terms, in the production of the Higgs boson via the bottom quark annihilation channel. We derive analytic expressions at the SV+NSV resummed level, up to next-to-next-to-next-to-leading logarithmic (N3LL) accuracy in perturbative QCD, applicable to both the inclusive production cross-section and rapidity distribution. This has been achieved using an existing resummation formalism based on factorization and renormalization group (RG) invariance. A phenomenological analysis of our resummed results is performed for the 13 TeV Large Hadron Collider. Furthermore, we present the SV coefficients at the fourth order in the strong coupling and explore the impact of next-to-next-to-next-to-next-to-leading logarithmic (N4LL) resummation on the total cross-section.

hep-ph

Guarding a Target Area from a Heterogeneous Group of Cooperative Attackers

In this paper, we investigate a multi-agent target guarding problem in which a single defender seeks to capture multiple attackers aiming to reach a high-value target area. In contrast to previous studies, the attackers herein are assumed to be heterogeneous in the sense that they have not only different speeds but also different weights representing their respective degrees of importance (e.g., the amount of allocated resources). The objective of the attacker team is to jointly minimize the weighted sum of their final levels of proximity to the target area, whereas the defender aims to maximize the same value. Using geometric arguments, we construct candidate equilibrium control policies that require the solution of a (possibly nonconvex) optimization problem. Subsequently, we validate the optimality of the candidate control policies using parametric optimization techniques. Lastly, we provide numerical examples to illustrate how cooperative behaviors emerge within the attacker team due to their heterogeneity.

eess.SY

ABACUS: An Impairment Aware Joint Optimal Dynamic RMLSA in Elastic Optical Networks

The challenge of optimal Routing and Spectrum Assignment (RSA) is significant in Elastic Optical Networks. Integrating adaptive modulation formats into the RSA problem - Routing, Modulation Level, and Spectrum Assignment - broadens allocation options and increases complexity. The conventional RSA approach entails predetermining fixed paths and then allocating spectrum within them separately. However, expanding the path set for optimality may not be advisable due to the substantial increase in paths with network size expansion. This paper delves into a novel approach called RMLSA, which proposes a comprehensive solution addressing both route determination and spectrum assignment simultaneously. An objective function named ABACUS, Adaptive Balance of Average Clustering and Utilization of Spectrum, is chosen for its capability to adjust and assign significance to average clustering and spectrum utilization. Our approach involves formulating an Integer Linear Programming model with a straightforward relationship between path and spectrum constraints. The model also integrates Physical Layer Impairments to ensure end-to-end Quality of Transmission for requested connections while maintaining existing ones. We demonstrate that ILP can offer an optimal solution for a dynamic traffic scenario within a reasonable time complexity. To achieve this goal, we adopt a structured formulation approach where essential information is determined beforehand, thus minimizing the need for online computations.

cs.NI

The NNLO gluon beam function for jet-veto resummation

We compute the gluon beam function for jet-veto resummation to next-to-next-to-leading order (NNLO) in the strong-coupling expansion. Our calculation is based on an automated framework that was previously used for the computation of the respective quark beam function, and which we significantly extended for the present calculation. In particular, the perturbative matching kernels are directly calculated in momentum space, without the need to perform an additional Mellin transform. We present results for both gluon and quark-initiated processes, which we cross-checked with an independent semi-analytical method that exploits the similarity of the beam functions to the more familiar case of transverse-momentum resummation. Our computation is relevant for jet-veto resummations at NNLL$'$ accuracy.

hep-ph