62 citations · 370 across the 54 of their papers we have counts for
4 papers · 1 filter
Shortest Paths of Bounded Curvature for the Dubins Interval Problem
Satyanarayana Manyam, Sivakumar Rathinam, David Casbeer +1
The Dubins interval problem aims to find the shortest path of bounded curvature between two targets such that the departure angle from the first target and the arrival angle at the…
Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem
Kaarthik Sundar, Saravanan Venkatachalam, Sivakumar Rathinam
We consider a multiple depot, multiple vehicle routing problem with fuel constraints. We are given a set of targets, a set of depots and a set of homogeneous vehicles, one for each…
Generalized multiple depot traveling salesmen problem - polyhedral study and exact algorithm
Kaarthik Sundar, Sivakumar Rathinam
The generalized multiple depot traveling salesmen problem (GMDTSP) is a variant of the multiple depot traveling salesmen problem (MDTSP), where each salesman starts at a distinct d…
On Tightly Bounding the Dubins Traveling Salesman's Optimum
Satyanarayana Manyam, Sivakumar Rathinam
The Dubins Traveling Salesman Problem (DTSP) has generated significant interest over the last decade due to its occurrence in several civil and military surveillance applications.…