#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2012

2017

- This year (9)
- Last 5 years (18)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kaarthik Sundar, Sivakumar Rathinam
- IEEE Transactions on Automation Science and…
- 2014

We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total fuel… (More)

We consider a cooperative vehicle routing problem for surveillance and reconnaissance missions with communication constraints between the vehicles. We propose a framework which involves a ground vehicle and an aerial vehicle; the vehicles travel cooperatively satisfying the communication limits, and visit a set of targets. We present a mixed integer linear… (More)

- Kaarthik Sundar, Sivakumar Rathinam
- ACC
- 2012

- Kaarthik Sundar, Sivakumar Rathinam
- J. Global Optimization
- 2017

The Multiple Depot Ring-Star Problem (MDRSP) is an important combinatorial optimization problem that arises in the context of optical fiber network design, and in applications pertaining to collecting data using stationary sensing devices and autonomous vehicles. Given the locations of a set of customers and a set of depots, the goal is to (i) find a set of… (More)

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 depot. The depots are also allowed to act as refueling stations. The vehicles are allowed to refuel at any depot, and our objective is to determine a route for each vehicle with… (More)

- Kaarthik Sundar, Sivakumar Rathinam
- Computers & OR
- 2016

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 depot, the targets are partitioned into clusters and at least one target in each cluster is visited by some salesman. The GMDTSP is an NP-hard problem as it generalizes the MDTSP… (More)

- Kaarthik Sundar, Sivakumar Rathinam
- Journal of Intelligent and Robotic Systems
- 2017

This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where m vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for… (More)

- Kaarthik Sundar, Harsha Nagarajan, +4 authors Daniel Bienstock
- PSCC
- 2016

As renewable wind energy penetration rates continue to increase, one of the major challenges facing grid operators is the question of how to control transmission grids in a reliable and a cost-efficient manner. The stochastic nature of wind forces an alteration of traditional methods for solving day-ahead and look-ahead unit commitment and dispatch. In… (More)

- Harsha Nagarajan, Mowen Lu, Site Wang, Russell Bent, Kaarthik Sundar
- ArXiv
- 2017

In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multilinear terms to global optimality. The algorithm combines two key ideas that exploit the structure of convex relaxations to MINLPs. First, we apply sequential bound tightening techniques to obtain the tightest possible… (More)