S
Swaroop Darbha
Researcher at Texas A&M University
Publications - 173
Citations - 4338
Swaroop Darbha is an academic researcher from Texas A&M University. The author has contributed to research in topics: Travelling salesman problem & Approximation algorithm. The author has an hindex of 28, co-authored 162 publications receiving 3767 citations. Previous affiliations of Swaroop Darbha include Air Force Research Laboratory & University of California, Berkeley.
Papers
More filters
Journal ArticleDOI
Lower Bounding Linear Program for the Perimeter Patrol Optimization Problem
Krishnamoorthy Kalyanam,Myoungkuk Park,Swaroop Darbha,David W. Casbeer,Phil Chandler,Meir Pachter +5 more
TL;DR: In this article, a stochastic optimal control problem involving an unmanned aerial vehicle flying patrols around a perimeter is considered and the perimeter patrol problem exhibits a special structure that enables tractable linear programming formulation for the lower bound.
Journal ArticleDOI
Synthesis of absolutely stabilising controllers
TL;DR: In this article, the authors constructed an inner and outer approximation of the set of absolutely stabilising linear controllers by casting the closed-loop system as a Lure-Postnikov system, and illustrated the proposed methodology through the construction of an inner-and outer approximation for a mechanical system.
Journal ArticleDOI
Performance Guarantee of an Approximate Dynamic Programming Policy for Robotic Surveillance
Myoungkuk Park,Krishnamoorthy Kalyanam,Swaroop Darbha,Pramod P. Khargonekar,Meir Pachter,Phillip Chandler +5 more
TL;DR: The novel feature of this paper is the derivation of a tractable lower bound via LP and the construction of a suboptimal policy whose performance improves upon the lower bound, which is shown to be a performance guarantee.
Journal ArticleDOI
State partitioning based linear program for stochastic dynamic programs: An invariance property
TL;DR: It is shown that this approximate value function is independent of the positive cost function and that it is the least upper bound, given the partitions, for the optimal value function.
Proceedings ArticleDOI
Aerial-ground vehicle path coordination algorithms for monitoring applications
TL;DR: In this article, a multi-UAV path planning problem in concert with a known ground vehicle path is considered, where each cell is either a target, an obstacle, or contains nothing (neutral).