Satyanarayana G. Manyam

TL;DR: Heuristics are presented to find suboptimal feasible solutions that require much less computation time in a Persistent Intelligence, Surveillance and Reconnaissance routing problem, and their performance is compared with respect to the optimal cost and computation time.

TL;DR: Novel tight lower bounding algorithms are presented in this article by relaxing some of the heading angle constraints at the target points by solving variants of an optimization problem called the Dubins interval problem between two points where the heading angles at the points are constrained to be within a specified interval.

TL;DR: In this article, the problem of tracking reference signals can also be handled by synthesizing feedforward control to aid the regulation of output of a nonlinear system in the presence of partially known exogenous inputs.

TL;DR: In this paper, the authors considered a cooperative vehicle routing problem for surveillance and reconnaissance missions with communication constraints between the vehicles, and proposed 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.

TL;DR: This paper addresses the coordinated routing problem involving these two vehicles and presents an algorithm to obtain an optimal solution for this problem, fast heuristics to obtain good feasible solutions, and also a transformation method to transform any instance of this cooperative vehicle routing problem to an instance of the one-in-a-set traveling salesman problem.