DKDeepak Prakash Kumar

Deepak Prakash Kumar

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Deepak Prakash Kumar has a total of 21 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.


  • A Mixed-Integer Convex Optimization-Based Approach for Hybrid UAV Path Planning in Noise-Restricted Zones

    by Saurabh Belgaonkar, Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha, Trevor Bihl

    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 systems. These HUAVs operate in environments that include noise-restricted zones, referred to as quiet zones, where only electric mode is permitted. We address the problem by parameterizing the position of a point along the side of the quiet zone using its endpoints and a scalar parameter, which transforms the problem into a variant of finding the shortest path over a graph of convex sets. We formulate this problem as a mixed-integer convex program (MICP), which can be efficiently solved using commercial solvers. Additionally, a tight lower bound can be obtained by relaxing the path-selection variable. Through extensive computations across 200 instances over four maps, we show a substantial improvement in computational efficiency over a state-of-the-art method, achieving up to a 100-fold and 10-fold decrease in computation time for calculating the lower bound and the exact solution, respectively. Moreover, the average gap between the exact cost and the lower bound was approximately 0.24%, and the exact cost was 1.05% lower than the feasible solution obtained from the state-of-the-art approach on average, highlighting the effectiveness of our proposed method. We also extend our approach to plan the route of the HUAV to visit a set of targets and return to its starting location in environments with quiet zones, yielding a Traveling Salesman Problem (TSP). We employ two methodologies to solve the TSP: one wherein the battery's State of charge (SOC) at each target is discretized, whereas, in another approach, the battery's SOC at each target is assumed to be the minimum allowable level when the HUAV departs it. A comparative analysis reveals that the second method achieves a cost within 1.02% of the first method on average while requiring significantly less computational time.


  • 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

    A Path Planning Algorithm for a Hybrid UAV Traveling in Noise Restricted Zones

    by Saurabh Belgaonkar, Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha, Trevor Bihl

    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 systems. These HUAVs operate in environments that include noise-restricted zones, referred to as quiet zones, where only electric mode is permitted. We address the problem by parameterizing the position of a point along the side of the quiet zone using its endpoints and a scalar parameter, transforming the problem into a variant of finding the shortest path over a graph of convex sets. We formulate this problem as a mixed-integer convex program (MICP), which can be efficiently solved using commercial solvers. Additionally, a tight lower bound can be obtained by relaxing the path-selection variable. Through extensive computations across 200 instances over four maps, we show a substantial improvement in computational efficiency over a state-of-the-art method, achieving up to a 100-fold and 10-fold decrease in computation time for calculating the lower bound and the exact solution, respectively. Moreover, the average gap between the exact cost and the lower bound was approximately 0.24%, and the exact cost was 1.05% lower than the feasible solution from the state-of-the-art approach on average, highlighting the effectiveness of our method. We also extend our approach to plan the HUAV route to visit a set of targets and return to its starting location in environments with quiet zones, yielding a Traveling Salesman Problem (TSP). We employ two methodologies to solve the TSP: one where the SOC at each target is discretized, and another where it is assumed to be the minimum allowable level upon departure. A comparative analysis reveals the second method achieves a cost within 1.02% of the first on average while requiring significantly less computational time.

  • 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


  • 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.


  • Open Access

    Heterogeneous Min-Max Multi-Vehicle Multi-Depot Traveling Salesman Problem: Heuristics and Computational Results

    by Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha, Trevor Bihl

    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 locations and need to cover a given set of targets. In the considered problem, vehicles can be structurally heterogeneous due to different vehicle speeds and/or functionally heterogeneous due to different vehicle-target assignments originating from different sensing capabilities of vehicles. The proposed heuristic for the considered problem has three stages: an initialization stage to generate an initial feasible solution, a local search stage to improve the incumbent solution by searching through different neighborhoods, and a perturbation/shaking stage, wherein the incumbent solution is perturbed to break from a local minimum. In this study, three types of neighborhood searches are employed. Furthermore, two different methods for constructing the initial feasible solution are considered, and multiple variations in the neighborhoods considered are explored in this study. The considered variations and construction methods are evaluated on a total of 128 instances generated with varying vehicle-to-target ratios, distribution for generating the targets, and vehicle-target assignment and are benchmarked against the best-known heuristic for this problem. Two heuristics were finally proposed based on the importance provided to objective value or computation time through extensive computational studies.