Satyanarayana Gupta Manyam

Satyanarayana Gupta Manyam

Auto-generated profile, based on publicly available information

Satyanarayana Gupta Manyam

DCS Corporation, Dayton, OH, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2021 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
SHSai Krishna Kanth Hari
Sai Krishna Kanth Hari
SRSivakumar Rathinam
Sivakumar Rathinam
SDSwaroop Darbha
Swaroop Darbha
KKKrishna Kalyanam
Krishna Kalyanam
SMSatyanarayana Gupta Manyam
Satyanarayana Gupta Manyam
DCDavid Casbeer
David Casbeer
This article addresses a persistent monitoring problem (PMP) that requires an unmanned aerial vehicle (UAV) to repeatedly visit $n$ targets of equal priority. The UAV has limited onboard fuel/charge and must be regularly serviced at a depot. Given a fixed number of visits, $k$ , for the UAV to the targets between successive services, the objective of the PMP is to determine an optimal sequence of visits such that the maximum time elapsed between successive visits to any target is minimized. This planning problem is a generalization of the traveling salesman problem and is NP-hard. We characterize the optimal solutions to this problem for different values of $k$ and develop algorithms that can compute the optimal solutions relatively fast. Numerical results are also presented to corroborate the performance of the proposed approach.

1 June 2017
Verified
Conference Paper
Closed access
SMSatyanarayana G. Manyam
Satyanarayana G. Manyam
SRSteven Rasmussen
Steven Rasmussen
DCDavid W. Casbeer
David W. Casbeer
KKKrishnamoorthy Kalyanam
Krishnamoorthy Kalyanam
SMSuresh Manickam
Suresh Manickam
We consider a Persistent Intelligence, Surveillance and Reconnaissance (PISR) routing problem, which includes collecting data from a set of specified task locations and delivering that data to a control station. Each task is assigned a refresh rate based on its priority, where higher priority tasks require higher refresh rates. The UAV team's objective is to minimize the maximum of the delivery times of all the tasks' data to the control station, while simultaneously, satisfying each task's revisit period constraint. The centralized path planning problem for this PISR routing problem is formulated using mixed integer linear programming and solved using a branch-and-cut algorithm. Heuristics are presented to find suboptimal feasible solutions that require much less computation time. The algorithms are tested on several instances and their performance is compared with respect to the optimal cost and computation time.

19 January 2017 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Closed access
PDF file
SMSatyanarayana G. Manyam
Satyanarayana G. Manyam
SRSivakumar Rathinam
Sivakumar Rathinam
DCDavid Casbeer
David Casbeer
EGEloy Garcia
Eloy Garcia

1 July 2016
Verified
Conference Paper
Closed access
SMSatyanarayana G. Manyam
Satyanarayana G. Manyam
DCDavid W. Casbeer
David W. Casbeer
KSKaarthik Sundar
Kaarthik Sundar
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 programming (MILP) formulation and develop a branch-and-cut algorithm to solve the path planning problem for the ground and air vehicles. The effectiveness of the proposed approach is corroborated through extensive computational experiments on several randomly generated instances.

20 November 2014 in IEEE/ASME Transactions on Mechatronics
Verified
Journal Article
Closed access
PRPramod R. Raul
Pramod R. Raul
SMSatyanarayana G. Manyam
Satyanarayana G. Manyam
PPPrabhakar R. Pagilla
Prabhakar R. Pagilla
SDSwaroop Darbha
Swaroop Darbha
This paper deals with the problem of synthesizing feedforward control to aid the regulation of output of a nonlinear system in the presence of partially known exogenous inputs. The problem appears in many engineering applications including Roll-to-Roll (R2R) manufacturing systems. Currently known methods for this problem either require the solution of a constrained partial differential equation or the preview information of the signal to be tracked. The novelty of this paper lies in synthesizing feedforward control as the solution of a system of differential-algebraic equations, which is considerably less complex and suitable for practical implementation. In this paper, we consider the problem of regulating the output while rejecting the disturbances and apply it to R2R manufacturing systems. The problem of tracking reference signals can also be handled with the suggested technique. We assume that the disturbance signal is the output of a known exogenous system with unknown initial conditions. A parameter identification scheme to estimate the unknown initial conditions is developed. The proposed technique is successfully applied to control of web tension in a large R2R machine which mimics most of the features of industrial R2R machines and contains real-time hardware and software that is used in industrial practice. Extensive experiments were conducted to evaluate the proposed scheme for web tension control under various experimental conditions, including different web speeds and materials. We will present and discuss the representative experimental results with the proposed technique and provide a comparison with an industrial PI control scheme to highlight the benefits of using the proposed scheme.

3 March 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
BDBin Du
Bin Du
JCJun Chen
Jun Chen
DSDengfeng Sun
Dengfeng Sun
SMSatyanarayana Gupta Manyam
Satyanarayana Gupta Manyam
DCDavid W. Casbeer
David W. Casbeer
Chance-constrained optimization provides a promi-sing framework for solving control and planning problems with uncertainties, due to its modeling capability to capture randomness in real-world applications. In this paper, we consider a UAV trajectory planning problem with probabilistic geo-fence, building on the chance-constrained optimization approach. In the considered problem, randomness of the model, such as the uncertain boundaries of geo-fences, is incorporated in the formulation. By solving the formulated chance-constrained optimization with a novel sampling based solution method, the optimal UAV trajectory is achieved while limiting the probability of collision with geo-fences to a prefixed threshold. Furthermore, to obtain a totally collision-free trajectory, i.e., avoiding the collision not only at the discrete time-steps but also within the entire time horizon, we build on the idea of an iterative scheme. That is, to iterate the solving of the chance-constrained optimization until the collision with probabilistic geo-fence is avoided at any time within the time horizon. At last, we validate the effectiveness of our method via numerical simulations.