SDSwaroop Darbha

Swaroop Darbha

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Swaroop Darbha has a total of 90 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

    Robust Underwater Vehicle Pose Estimation via Convex Optimization Using Range-Only Remote Sensing Data

    by Sai Krishna Kanth Hari, Kaarthik Sundar, José Braga, João Teixeira, Swaroop Darbha, João Sousa

    Accurate localization plays a critical role in enabling underwater vehicle autonomy. In this work, we develop a robust infrastructure-based localization framework that estimates the position and orientation of underwater vehicles using only range measurements from long baseline (LBL) acoustic beacons to multiple on-board receivers. The proposed framework integrates three key components, each formulated as a convex optimization problem. First, we introduce a robust calibration function that unifies multiple sources of measurement error—such as range-dependent degradation, variable sound speed, and latency—by modeling them through a monotonic function. This function bounds the true distance and defines a convex feasible set for each receiver location. Next, we estimate the receiver positions as the center of this feasible region, using two notions of centrality: the Chebyshev center and the maximum volume inscribed ellipsoid (MVE), both formulated as convex programs. Finally, we recover the vehicle’s full 6-DOF pose by enforcing rigid-body constraints on the estimated receiver positions. To do this, we leverage the known geometric configuration of the receivers in the vehicle and solve the Orthogonal Procrustes Problem to compute the rotation matrix that best aligns the estimated and known configurations, thereby correcting the position estimates and determining the vehicle orientation. We evaluate the proposed method through both numerical simulations and field experiments. To further enhance robustness under real-world conditions, we model beacon-location uncertainty—due to mooring slack and water currents—as bounded spherical regions around nominal beacon positions. We then mitigate the uncertainty by integrating the modified range constraints into the MVE position estimation formulation, ensuring reliable localization even under infrastructure drift.


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

  • Robust Cooperative Adaptive Cruise Control System Design: Trade-Off Between Parasitic Actuation Lag and Communication Delay

    by Guoqi Ma, Prabhakar R. Pagilla, Swaroop Darbha

    In this paper, we provide a systematic procedure for designing cooperative adaptive cruise control (CACC) systems that are robust to parasitic actuation lag in braking and propulsion and delay in the communicated acceleration from the predecessor vehicle. In particular, we derive a tight lower bound on the employable time headway in CACC systems for guaranteeing robust string stability. The lower bound on the time headway is dependent on the upper bound on the parasitic actuation lag (τ0) and the communication delay (ℓ). The main result of the paper is that if τ0 exceeds ℓ, then the employable time headway is lower bounded by τ0+ℓ. Otherwise, it is better to use adaptive cruise control (ACC) where the employable time headway is lower bounded by 2τ0. The above results on CACC systems are then extended to next-generation CACC (CACC+) systems that employ information from multiple predecessor vehicles. Several comparative numerical simulations for a representative maneuver corroborate the main results.