Saurabh Belgaonkar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Saurabh Belgaonkar has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Deepak Prakash Kumar
Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA
1 shared publication - Jishnu Keshavan
Robert Bosch Centre for Cyber-Physical Systems, Indian Institute of Science, Bengaluru, India
1 shared publication Shreeram Murali
Department of Mechanical Engineering, Indian Institute of Science, Bengaluru, Karnataka, India
1 shared publication- Sivakumar Rathinam
Texas A&M University
1 shared publication - Swaroop Darbha
Texas A&M University
1 shared publication - Trevor Joseph Bihl
Air Force Research Laboratory (AFRL), Dayton, OH, USA
1 shared publication
Latest Publications
- 15 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 3536-3551
A Mixed-Integer Convex Optimization-Based Approach for Hybrid UAV Path Planning in Noise-Restricted Zones
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.
- 15 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 3536-3551
A Mixed-Integer Convex Optimization-Based Approach for Hybrid UAV Path Planning in Noise-Restricted Zones
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
- 11 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 112263-112275
Adaptive Control of a Constrained First Order Sliding Mode for Visual Formation Convergence Applications
Most existing solutions that guarantee finite-time convergence of a constrained first-order sliding mode either assume that the structure of the perturbation is known apriori , or the perturbation and its derivative are bounded by unknown constants. Moreover, convergence is usually guaranteed only in a small domain of attraction of the predefined constrained region through discontinuous control action. In contrast with these approaches, the sliding mode is assumed to be subject to perturbations with a state-dependent structure in this study, and two adaptive integral control strategies are proposed that guarantee finite-time convergence of this perturbed sliding mode from any initial condition within the predefined constrained region. First, an invertible nonlinear map is used to transform the constrained system into a constraint-free system, and an adaptive integral control strategy is used to guarantee finite-time convergence of the resulting sliding mode to a uniform ultimate bound using continuous and bounded control action. Subsequently, an alternative barrier-function based adaptive control policy is synthesized that ensures sliding mode convergence in a prescribed time to a prescribed bound that is independent of the magnitude of the perturbation term. Experimental studies of vision-based leader-follower formation control are used to validate and demonstrate superior performance of the proposed schemes compared to leading alternative designs.
- 11 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 112263-112275
Open AccessAdaptive Control of a Constrained First Order Sliding Mode for Visual Formation Convergence Applications
Most existing solutions that guarantee finite-time convergence of a constrained first-order sliding mode either assume that the structure of the perturbation is known apriori , or the perturbation and its derivative are bounded by unknown constants. Moreover, convergence is usually guaranteed only in a small domain of attraction of the predefined constrained region through discontinuous control action. In contrast with these approaches, the sliding mode is assumed to be subject to perturbations with a state-dependent structure in this study, and two adaptive integral control strategies are proposed that guarantee finite-time convergence of this perturbed sliding mode from any initial condition within the predefined constrained region. First, an invertible nonlinear map is used to transform the constrained system into a constraint-free system, and an adaptive integral control strategy is used to guarantee finite-time convergence of the resulting sliding mode to a uniform ultimate bound using continuous and bounded control action. Subsequently, an alternative barrier-function based adaptive control policy is synthesized that ensures sliding mode convergence in a prescribed time to a prescribed bound that is independent of the magnitude of the perturbation term. Experimental studies of vision-based leader-follower formation control are used to validate and demonstrate superior performance of the proposed schemes compared to leading alternative designs.