scispace - formally typeset
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

Optimal UAV Route Planning for Persistent Monitoring Missions

TL;DR: This article addresses a persistent monitoring problem (PMP) that requires an unmanned aerial vehicle (UAV) to repeatedly visit targets of equal priority and characterize the optimal solutions to this problem for different values of $k$ and develop algorithms that can compute the optimal solution relatively fast.
Journal ArticleDOI

Optimal MAV operations in an uncertain environment

TL;DR: A stochastic dynamic programming approach is employed to solve a problem of sequential resource allocation in a simplified intelligence, surveillance and reconnaissance scenario where a micro air vehicle (MAV) is tasked with classification in an environment with false, that is, clutter, targets.
Journal ArticleDOI

String Stability of Connected Vehicle Platoons Under Lossy V2V Communication

TL;DR: The focus of this work is to reconsider string stability from a safety perspective and develop an upper limit on the maximum spacing error in a homogeneous platoon as a function of the acceleration maneuver of the lead vehicle.
Proceedings ArticleDOI

Controller synthesis for sign invariant impulse response

TL;DR: In this paper, the authors consider the problem of designing controllers for discrete-time LTI plants that render the closed-loop impulse response non-negative and show that a necessary and sufficient condition on the plant for the existence of a compensator that makes the closed loop impulse response sign invariant is that there be no real, positive, non-minimum phase plant zeros.
Proceedings ArticleDOI

On maximizing algebraic connectivity of networks for various engineering applications

TL;DR: A Fiedler vector based mixed-integer linear programing formulation for the problem of maximizing λ2 is discussed and optimal solutions and upper bounds based on cutting plane methods are obtained.