62 citations · 370 across the 54 of their papers we have counts for
63 papers
An Exact Branch-Price-and-Cut Algorithm for a Truck-as-Hub Vehicle Routing Problem with Drones
Fan Pu, Sivakumar Rathinam, Yunlong Zhang +3
Rural last-mile logistics remains challenging because of sparse demand, limited road infrastructure, and long travel distances. We study a Truck-as-Hub Vehicle Routing Problem with…
Longitudinal-Motion-Aware Lateral Control for Autonomous Vehicles: A Robust Nonlinear Control Framework
Sixu Li, Nitesh Kumar, Reyshwanth Ganeshan +3
As autonomous vehicles (AVs) operate in increasingly dynamic traffic conditions, lateral control must be performed while longitudinal speed and acceleration vary. Yet many existing…
Privacy-Preserving Decentralized Cooperative Localization with Range-Only Measurements: A Convex Optimization Based Approach
Nitesh Kumar, Reyshwanth Ganeshan, Sixu Li +2
Cooperative localization using range-based measurements is critical for multi-robot systems operating in GPS-denied and unstructured environments. However, traditional cooperative…
Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles
Allen George Philip, Anoop Bhat, Sivakumar Rathinam +1
The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one…
An Exact Algorithm for Load-Dependent Traveling Salesman Problem for Unmanned Aerial Vehicle Package Delivery
Deepak Prakash Kumar, Saurabh Belgaonkar, Sivakumar Rathinam +2
In this article, we present a novel formulation for the load-dependent traveling salesman problem (LD-TSP), in which travel cost (or energy expended) depends on the vehicle's curre…
Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity
Anoop Bhat, Geordan Gutow, Zhongqiang Ren +2
The Moving Target Vehicle Routing Problem (MT-VRP) seeks trajectories for several agents that intercept a set of moving targets, subject to speed, time window, and capacity constra…
A Robust Simulation Framework for Verification and Validation of Autonomous Maritime Navigation in Adverse Weather and Constrained Environments
Mayur S. Patil, Nataraj Sudharsan, Anthony S. Saaiby +9
Maritime Autonomous Surface Ships (MASS) have emerged as a promising solution to enhance navigational safety, operational efficiency, and long-term cost effectiveness. However, the…
COLREGs Compliant Collision Avoidance and Grounding Prevention for Autonomous Marine Navigation
Mayur S. Patil, Nataraj Sudharsan, Veneela Ammula +5
Maritime Autonomous Surface Ships (MASS) are increasingly regarded as a promising solution to address crew shortages, improve navigational safety, and improve operational efficienc…
Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch-and-Price
Anoop Bhat, Geordan Gutow, David Neiman +4
The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one o…
Cyclic Modulation Control of Multi-Conflict Connected Automated Traffic
Fan Pu, Zihao Li, Sivakumar Rathinam +2
Multi-conflict traffic is ubiquitous. Connected Automated Vehicles (CAVs) offer unprecedented opportunities to enhance safety, reduce emissions, and increase throughput through pre…
Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The Moving Target Traveling Salesman Problem (MT-TSP) seeks a trajectory that intercepts several moving targets, within a particular time window for each target. When generic nonli…
A Path Planning Algorithm for a Hybrid UAV Traveling in Noise Restricted Zones
Saurabh Belgaonkar, Deepak Prakash Kumar, Sivakumar Rathinam +2
This paper presents an integrated approach for efficient path planning and energy management in hybrid unmanned aerial vehicles (HUAVs) equipped with dual fuel-electric propulsion…
A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The moving target traveling salesman problem with obstacles (MT-TSP-O) seeks an obstacle-free trajectory for an agent that intercepts a given set of moving targets, each within spe…
A Mixed-Integer Conic Program for the Multi-Agent Moving-Target Traveling Salesman Problem
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a shortest path for an agent that starts at a stationary depot, visits a set of moving targets exactly once, each within…
Heterogeneous Min-Max Multi-Vehicle Multi-Depot Traveling Salesman Problem: Heuristics and Computational Results
Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha +1
In this paper, a heuristic for a heterogeneous min-max multi-vehicle multi-depot traveling salesman problem is proposed, wherein heterogeneous vehicles start from given depot locat…
A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The moving target traveling salesman problem with obstacles (MT-TSP-O) is a generalization of the traveling salesman problem (TSP) where, as its name suggests, the targets are movi…
The Persistent Robot Charging Problem for Long-Duration Autonomy
Nitesh Kumar, Jaekyung Jackie Lee, Sivakumar Rathinam +3
This paper introduces a novel formulation aimed at determining the optimal schedule for recharging a fleet of heterogeneous robots, with the primary objective of minimizing res…
for Graphs of Convex Sets
Kaarthik Sundar, Sivakumar Rathinam
We present a novel algorithm that fuses the existing convex-programming based approach with heuristic information to find optimality guarantees and near-optimal paths for the Short…
A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
This paper introduces a new formulation that finds the optimum for the Moving-Target Traveling Salesman Problem (MT-TSP), which seeks to find a shortest path for an agent, that sta…
Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem
Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha +1
In this article, a heuristic is proposed for a min-max heterogeneous multi-vehicle multi-depot traveling salesman problem (TSP), wherein heterogeneous vehicles start from given dep…
Assisted Path Planning for a UGV-UAV Team Through a Stochastic Network
Abhay Singh Bhadoriya, Sivakumar Rathinam, Swaroop Darbha +2
In this article, we consider a multi-agent path planning problem in a stochastic environment. The environment, which can be an urban road network, is represented by a graph where t…
DMS*: Minimizing Makespan for Multi-Agent Combinatorial Path Finding
Zhongqiang Ren, Anushtup Nandy, Sivakumar Rathinam +1
Multi-Agent Combinatorial Path Finding (MCPF) seeks collision-free paths for multiple agents from their initial to goal locations, while visiting a set of intermediate target locat…
C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
We introduce a new bounding approach called Continuity* C*, which provides optimality guarantees for the Moving-Target Traveling Salesman Problem (MT-TSP). Our approach relaxes the…
Heuristic Search for Path Finding with Refuelling
Shizhe Zhao, Anushtup Nandy, Howie Choset +2
This paper considers a generalization of the Path Finding (PF) problem with refuelling constraints referred to as the Gas Station Problem (GSP). Similar to PF, given a graph where…