Krishna Chaitanya Kalagarla

Krishna Chaitanya Kalagarla

Auto-generated profile, based on publicly available information

Krishna Chaitanya Kalagarla

Amazon, Seattle, WA, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
2 July 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
KKKrishna C. Kalagarla
Krishna C. Kalagarla
DKDhruva Kartik
Dhruva Kartik
DSDongming Shen
Dongming Shen
RJRahul Jain
Rahul Jain
ANAshutosh Nayyar
Ashutosh Nayyar
PNPierluigi Nuzzo
Pierluigi Nuzzo
Autonomous systems often have logical constraints arising, for example, from safety, operational, or regulatory requirements. Such constraints can be expressed using temporal logic specifications. The system state is often partially observable. Moreover, it could encompass a team of multiple agents with a common objective but disparate information structures and constraints. In this paper, we first introduce an optimal control theory for partially observable Markov decision processes (POMDPs) with finite linear temporal logic ( $\boldsymbol{LTL}_{\bf f}$ ) constraints. We provide a structured methodology for synthesizing policies that maximize a cumulative reward while ensuring that the probability of satisfying a temporal logic constraint is sufficiently high. Our approach comes with guarantees on approximate reward optimality and constraint satisfaction. We then build on this approach to design an optimal control framework for logically constrained multi-agent settings with information asymmetry. We illustrate the effectiveness of our approach by implementing it on several case studies.

6 May 2025
Verified
Conference Paper
Open access
VSVignesh Sivaramakrishnan
Vignesh Sivaramakrishnan
KKKrishna C. Kalagarla
Krishna C. Kalagarla
RDRosalyn Devonport
Rosalyn Devonport
JPJoshua Pilipovsky
Joshua Pilipovsky
PTPanagiotis Tsiotras
Panagiotis Tsiotras
MOMeeko Oishi
Meeko Oishi

27 September 2026
Verified
Conference Paper
Open access
KKKrishna Chaitanya Kalagarla
Krishna Chaitanya Kalagarla
YLYi Liu
Yi Liu
LCLin Chai
Lin Chai
WLWenyang Liu
Wenyang Liu
Traditional online A/B experimentation limits the number of treatments that can be evaluated concurrently. Bandit-based adaptive experimentation algorithms address this by dynamically reallocating traffic across an order of magnitude more treatments. Yet existing methods involve a fundamental trade-off: single-metric Thompson Sampling-based methods are robust to novelty effects but cannot accommodate multiple launch criteria, while elimination-based multi-objective methods support multiple constraints but risk prematurely removing promising treatments. We introduce TSMOO (Thompson Sampling with Multi-Objective Optimization), a method that bridges this gap by combining multi-metric optimization with continuous learning. Grounded in stochastically constrained best-arm identification, TSMOO extends single-metric Thompson Sampling to multi-objective batch traffic allocation by estimating multi-constraint feasibility at each allocation step, while preserving all treatments throughout exploration. It further incorporates uplift modeling that mitigates temporal effects shared across treatments and control and ensures that the Gaussian distribution assumption holds. In simulations replaying historical real-world experimentation patterns, TSMOO achieves 93-94% success rates in multi-winner settings and 63-66% under novelty effects, outperforming both single-metric and elimination-based baselines.