S
Sai Krishna Kanth Hari
Researcher at Texas A&M University
Publications - 19
Citations - 130
Sai Krishna Kanth Hari is an academic researcher from Texas A&M University. The author has contributed to research in topics: Travelling salesman problem & Beacon. The author has an hindex of 5, co-authored 17 publications receiving 62 citations. Previous affiliations of Sai Krishna Kanth Hari include Los Alamos National Laboratory.
Papers
More filters
Proceedings ArticleDOI
The Generalized Persistent Monitoring Problem
Sai Krishna Kanth Hari,Sivakumar Rathinam,Swaroop Darbha,Krishnamoorthy Kalyanam,Satyanarayana G. Manyam,David W. Casbeer +5 more
TL;DR: It is proved that for k allowed visits, the problem of planning an optimal route for an unmanned vehicle, tasked with persistently monitoring a set of targets, takes only two values, $\mathcal{R}^{\ast}(k)$ when $k$ is an integral multiple of $m$ and $\math Calculation:R(m)$ otherwise, leading to significant computational savings.
Journal ArticleDOI
Optimal UAV Route Planning for Persistent Monitoring Missions
Sai Krishna Kanth Hari,Sivakumar Rathinam,Swaroop Darbha,Krishnamoorthy Kalyanam,Satyanarayana G. Manyam,David W. Casbeer +5 more
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
An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team
TL;DR: In this article, an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots is presented, where the robots have to travel to a given set of targets and collaboratively work on the tasks at the targets with the human operators.
Posted Content
Persistent Monitoring of Dynamically Changing Environments Using an Unmanned Vehicle.
Sai Krishna Kanth Hari,Sivakumar Rathinam,Swaroop Darbha,K. Krishnamoorthy,Satyanarayana G. Manyam,David W. Casbeer +5 more
TL;DR: For any given target, it is proved that every target is visited at least once and the maximum revisit time over all the targets, $\mathcal R(\mathcal W(k)), is minimized, which suggests significant computational savings.
Proceedings ArticleDOI
Efficient Computation of Optimal UAV Routes for Persistent Monitoring of Targets
Sai Krishna Kanth Hari,Sivakumar Rathinam,Swaroop Darbha,Krishnamoorthy Kalyanam,Satyanarayana G. Manyam,David W. Casbeer +5 more
TL;DR: This article considers a routing problem that arises in the scenario of persistently monitoring a set of targets using an unmanned vehicle, and proposes a new formulation to solve the problem.