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
A review of the mathematical models for traffic flow
TL;DR: This paper critically review mathematical models for the flow of traffic that treat traffic as a continuum and provides a discussion of their shortcomings and a spatially discrete traffic flow model that does not suffer from such shortcomings and provides recently collected, corroborating data for a trip-time estimation scheme based on the spatially separate model.
Proceedings ArticleDOI
Routing of two Unmanned Aerial Vehicles with communication constraints
TL;DR: A novel GPS denied routing problem for UAVs is described, where two Uavs cooperatively navigate through an array of non-communicating Unattended Ground Sensors (UGS) to solve the Communication Constrained UAV Routing Problem (CCURP).
Journal ArticleDOI
GPS Denied UAV Routing with Communication Constraints
Satyanarayana G. Manyam,Sivakumar Rathinam,Swaroop Darbha,David W. Casbeer,Yongcan Cao,Phil Chandler +5 more
TL;DR: The routing algorithm presenting in this paper ensures the UAVs maintain strict contact with at least one UGS, which allows the UGS act as beacons for relative navigation eliminating the need for dead reckoning.
Journal ArticleDOI
Algorithms for synthesizing mechanical systems with maximal natural frequencies
TL;DR: An iterative primal-dual algorithm and a cutting plane algorithm are developed to solve an open problem in system realization theory that has relevance to several important problems in biomedicine, altering the dynamic response of discrete and continuous systems, connectivity of Very Large Scale Integrated circuits, as well as the co-ordination of Unmanned vehicles.
Journal ArticleDOI
Computation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints
TL;DR: A method to compute lower bound to the minimum total path lengths by relaxing some of the constraints and posing it as a standard multiple traveling salesmen problem (MTSP) is developed.