SMSatyanarayana Gupta Manyam

Satyanarayana Gupta Manyam

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Satyanarayana Gupta Manyam has a total of 59 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A New Approach to Motion Planning in 3-D for a Dubins Vehicle: Special Case on a Sphere

    by Deepak Prakash Kumar, Swaroop Darbha, Satyanarayana Gupta Manyam, David W. Casbeer

    In this article, a new model for 3D motion planning, applicable to aerial vehicles, is proposed to connect an initial and final configuration subject to pitch rate and yaw rate constraints. The motion planning problem for a curvature-constrained vehicle over the surface of a sphere is identified as an intermediary problem to be solved, and it is the focus of this paper. In this article, the optimal path candidates for a vehicle with a minimum turning radius $r$ moving over a unit sphere are derived using a phase portrait approach. We show that the optimal path is $CGC$ or concatenations of $C$ segments through simple proofs, where $C = L, R$ denotes a turn of radius $r$ and $G$ denotes a great circular arc. We generalize the previous result of optimal paths being $CGC$ and $CCC$ paths for $r \in (0, \frac{1}{2}]\bigcup \lbrace \frac{1}{\sqrt{2}}\rbrace$ to $r \leq \frac{\sqrt{3}}{2}$ to account for vehicles with a larger $r$. We show that the optimal path is $CGC, CCCC,$ for $r \leq \frac{1}{\sqrt{2}},$ and $CGC, CC_\pi C, CCCCC$ for $r \leq \frac{\sqrt{3}}{2}.$ Additionally, we analytically construct all candidate paths and provide the code in a publicly accessible repository.


  • Open Access

    A Novel Model for 3D Motion Planning for a Generalized Dubins Vehicle with Pitch and Yaw Rate Constraints

    by Deepak Prakash Kumar, Swaroop Darbha, Satyanarayana Gupta Manyam, David Casbeer

    In this paper, we propose a new modeling approach and a fast algorithm for 3D motion planning, applicable for fixed-wing unmanned aerial vehicles. The goal is to construct the shortest path connecting given initial and final configurations subject to motion constraints. Our work differs from existing literature in two ways. First, we consider full vehicle orientation using a body-attached frame, which includes roll, pitch, and yaw angles. However, existing work uses only pitch and/or heading angle, which is insufficient to uniquely determine orientation. Second, we use two control inputs to represent bounded pitch and yaw rates, reflecting control by two separate actuators. In contrast, most previous methods rely on a single input, such as path curvature, which is insufficient for accurately modeling the vehicle's kinematics in 3D. We use a rotation minimizing frame to describe the vehicle's configuration and its evolution, and construct paths by concatenating optimal Dubins paths on spherical, cylindrical, or planar surfaces. Numerical simulations show our approach generates feasible paths within 10 seconds on average and yields shorter paths than existing methods in most cases.

  • Open Access

    Cooperative Pursuit-Evasion Games With a Flat Sphere Condition

    by Dejan Milutinović, Alexander Von Moll, Satyanarayana Gupta Manyam, David W. Casbeer, Isaac E. Weintraub, Meir Pachter

    In planar pursuit-evasion differential games considering a faster pursuer and a slower evader, the interception points resulting from equilibrium strategies lie on the Apollonius circle. This property is instrumental for leveraging geometric approaches for solving multiple pursuit-evasion scenarios in the plane. In this paper, we study a pursuit-evasion differential game on a sphere and generalize the planar Apollonius circle to the spherical domain. For the differential game, we provide equilibrium strategies for all initial positions of the pursuer and evader, including a special case when they are on the opposite sides of the sphere and on the same line with the center of the sphere when there are infinitely many geodesics between the two players. In contrast to planar scenarios, on the sphere we find that the interception point from the equilibrium strategies can leave the Apollonius domain boundary. We present a condition to ensure the intercept point remains on the boundary of the Apollonius domain. This condition allows for generalizing planar pursuit-evasion strategies to the sphere, and we show how these results are applied by analyzing the scenarios of target guarding and two-pursuer, single evader differential games on the sphere.

  • Dubins Path With Terminal Range and Field-of-View Constraints

    by Satyanarayana G. Manyam, David W. Casbeer, Alexander Von Moll, Isaac E. Weintraub

    This paper addresses a path planning problem for a turn-constrained vehicle equipped with a sensor that has a limited range and field of view (FOV). The vehicle is modeled using Dubins kinematics, and the objective is to determine the shortest path to point where that the target is detectable, i.e., within the sensor’s range and FOV. The limited sensor range imposes a constraint requiring the vehicle to reach a circle centered at the target’s position, with a radius equal to the sensor range. The field-of-view constraints are expressed as coupled conditions on the terminal position and heading. Pontryagin’s minimum principle restricts the optimal path to straight lines and arcs of minimum turn radius. Further analysis shows that the paths are limited to at most two segments. Straight-line segments occur exclusively when the final position lies on the boundary of the target circle. Furthermore, we present an analytical approach for computing optimal paths in scenarios where the optimality conditions result in complex geometric configurations.

  • Open Access

    Generation of Paths for Motion Planning for a Dubins Vehicle on Sphere

    by Deepak Prakash Kumar, Swaroop Darbha, Satyanarayana Gupta Manyam, David Casbeer

    In this article, the candidate optimal paths for a Dubins vehicle on a sphere are analytically derived. In particular, the arc angles for segments in $CGC$, $CCC$, $CCCC$, and $CCCCC$ paths, which have previously been shown to be optimal depending on the turning radius $r$ of the vehicle by Kumar \textit{et al.}, are analytically derived. The derived expressions are used for the implementation provided in https://github.com/DeepakPrakashKumar/Motion-planning-on-sphere.

  • Equivalence of Dubins Path on Sphere with Geographic Coordinates and Moving Frames

    by Deepak Prakash Kumar, Swaroop Darbha, Satyanarayana G. Manyam, David W. Casbeer, Meir Pachter


  • Hybrid Theta$^*$: Motion Planning for Dubins Vehicles With Integral Constraints

    by Satyanarayana G. Manyam, David W. Casbeer, Colin Taylor

    We consider a motion planning problem for vehicles with curvature constraints, such as minimum turn radius, and a secondary cost such as resource cost. Traditional motion planning problems address the secondary cost as a soft constraint within the cost function. In the current paper, we take a different approach and treat this as a constraint, separate from the primary objective cost. Specifically, the integrated resource cost along the vehicle's path is constrained to be within a pre-specified limit, which is separate from the main travel cost being optimized. This approach is suitable for applications such as fire fighting, where finding the paths of minimum cost or time is essential while limiting exposure to the high heat areas. To address the resource constraints, we introduce the Hybrid Theta$^*$ (H$\boldsymbol{\Theta }^*$) algorithm. This is an incremental sampling based search algorithm and draws inspiration from labeling algorithms used in resource constrained shortest path problems. We present two versions of the (H$\boldsymbol{\Theta }^*$) algorithm, label-select and focal-select; these variants differs in how labels to be expanded are selected from the processing queue. The proposed algorithms significantly outperform the baseline methods that uses the traditional motion planning algorithms in terms of both the success rate and the solution cost. We validate the algorithms through computational experiments and real-world flight testing with on-board computation.


  • Generalization of Optimal Geodesic Curvature Constrained Dubins’ Path on Sphere With Free Terminal Orientation

    by Deepak Prakash Kumar, Swaroop Darbha, Satyanarayana Gupta Manyam, David Casbeer

    In this paper, motion planning for a Dubins vehicle on a unit sphere to attain a desired final location is considered. The radius of the Dubins path on the sphere is lower bounded by r, where r represents the radius of the tightest left or right turn the vehicle can take on the sphere. Noting that r(0,1) and can affect the trajectory taken by the vehicle, it is desired to determine the candidate optimal paths for r ranging from nearly zero to close to one to attain a desired final location. In a previous study, this problem was addressed, wherein it was shown that the optimal path is of type CG,CC, or a degenerate path of the CG and CC paths, which includes C, G paths, for r≤12. Here, CL,R denotes an arc of a tight left or right turn of minimum turning radius r, and G denotes an arc of a great circle. In this study, the candidate paths for the same problem are generalized to model vehicles with a larger turning radius. In particular, it is shown that the candidate optimal paths are of type CG,CC, or a degenerate path of the CG and CC paths for r≤32. Noting that at most two LG paths and two RG paths can exist for a given final location, this article further reduces the candidate optimal paths by showing that only one LG and one RG path can be optimal, yielding a total of seven candidate paths for r≤32. Additional conditions for the optimality of CC paths are also derived in this study.


  • Noise Aware Path Planning and Power Management of Hybrid Fuel UAVs

    by Drew Scott, Satyanarayana G. Manyam, Isaac E. Weintraub, David W. Casbeer, Manish Kumar

    Hybrid fuel Unmanned Aerial Vehicles (UAV), through their combination of multiple energy sources, offer several advantages over the standard single fuel source configuration, the primary one being increased range and efficiency. Multiple power or fuel sources also allow the distinct pitfalls of each source to be mitigated while exploiting the advantages within the mission or path planning. We consider here a UAV equipped with a combustion engine-generator and battery pack as energy sources. We consider the path planning and power-management of this platform in a noise-aware manner. To solve the path planning problem, we first present the Mixed Integer Linear Program (MILP) formulation of the problem. We then present and analyze a label-correcting algorithm, for which a pseudo-polynomial running time is proven. Results of extensive numerical testing are presented which analyze the performance and scalability of the labeling algorithm for various graph structures, problem parameters, and search heuristics. It is shown that the algorithm can solve instances on graphs as large as twenty thousand nodes in only a few seconds Note to Practitioners —The problem and algorithms proposed in this paper are relevant to constrained planning problems in general and specifically to those focused on widespread usage of small aerial vehicles in congested, urban environments. We are concerned here with the path planning of hybrid-fuel aerial vehicles in a noise-aware manner. This is motivated by the increasing usage of aerial vehicles, envisioning a probable future restriction on noise production in certain airspaces and the planning of such vehicles in those airspaces. We explore this novel problem, and present an approach to quickly find the optimal path and power plan in the presence of the noise constraints. The approach here is a discrete one, where the solution is a discrete set of edges and discrete generator settings which must be smoothed to obtain control inputs for a real system. The discrete approach allows solutions to be found quickly while giving up the true optimal trajectory that can be found when considering from a continuous framework. In practice, environment sampling and graph construction will greatly affect time-to-solve and as overall solution quality relative to a continuous approach to the trajectory and generator control.