Kunal Garg

Dr. Kunal Garg


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
10 June 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
KGKunal Garg
Kunal Garg
DPDimitra Panagou
Dimitra Panagou
This paper proposes novel gradient-flow schemes that yield convergence to the optimal point of a convex optimization problem within a fixed time from any given initial condition for unconstrained optimization, constrained optimization, and min-max problems. It is shown that the solution of the modified gradient flow dynamics exists and is unique under certain regularity conditions on the objective function, while fixed-time convergence to the optimal point is shown via Lyapunov-based analysis. The application of the modified gradient flow to unconstrained optimization problems is studied under the assumption of gradient-dominance, a relaxation of strong-convexity. Then, a modified Newton's method is presented that exhibits fixed-time convergence under some mild conditions on the objective function. Building upon this method, a novel technique for solving convex optimization problems with linear equality constraints that yields convergence to the optimal point in fixed time is developed. Finally, the general min-max problem is considered, and a modified scheme to obtain the optimal solution of saddle-point dynamics in fixed time is developed.

28 April 2021 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
JBJoseph Breeden
Joseph Breeden
KGKunal Garg
Kunal Garg
DPDimitra Panagou
Dimitra Panagou
This letter presents conditions for ensuring forward invariance of safe sets under sampled-data system dynamics with piecewise-constant controllers and fixed time-steps. First, we introduce two different metrics to compare the conservativeness of sufficient conditions on forward invariance under piecewise-constant controllers. Then, we propose three approaches for guaranteeing forward invariance, two motivated by continuous-time barrier functions, and one motivated by discrete-time barrier functions. All proposed conditions are control affine, and thus can be incorporated into quadratic programs for control synthesis. We show that the proposed conditions are less conservative than those in earlier studies, and show via simulation how this enables the use of barrier functions that are impossible to implement with the desired time-step using existing methods.

15 January 2025 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
SZSongyuan Zhang
Songyuan Zhang
OSOswin So
Oswin So
KGKunal Garg
Kunal Garg
CFChuchu Fan
Chuchu Fan
Distributed, scalable, and safe control of large-scale multi-agent systems is a challenging problem. In this paper, we design a distributed framework for safe multi-agent control in large-scale environments with obstacles, where a large number of agents are required to maintain safety using only local information and reach their goal locations. We introduce a new class of certificates, termed graph control barrier function (GCBF), which are based on the well-established control barrier function theory for safety guarantees and utilize a graph structure for scalable and generalizable distributed control of MAS. We develop a novel theoretical framework to prove the safety of an arbitrary-sized MAS with a single GCBF. We propose a new training framework GCBF+ that uses graph neural networks to parameterize a candidate GCBF and a distributed control policy. The proposed framework is distributed and is capable of taking point clouds from LiDAR, instead of actual state information, for real-world robotic applications. We illustrate the efficacy of the proposed method through various hardware experiments on a swarm of drones with objectives ranging from exchanging positions to docking on a moving target without collision. Additionally, we perform extensive numerical experiments, where the number and density of agents, as well as the number of obstacles, increase. Empirical results show that in complex environments with agents with nonlinear dynamics (e.g., Crazyflie drones), GCBF+ outperforms the hand-crafted CBF-based method with the best performance by up to $20\%$ for relatively small-scale MAS with up to 256 agents, and leading reinforcement learning (RL) methods by up to $40\%$ for MAS with 1024 agents. Furthermore, the proposed method does not compromise on the performance, in terms of goal reaching, for achieving high safety rates, which is a common trade-off in RL-based methods.

21 March 2024 in Annual Reviews in Control
Verified
Journal Article
Closed access
KGKunal Garg
Kunal Garg
SZSongyuan Zhang
Songyuan Zhang
OSOswin So
Oswin So
CDCharles Dawson
Charles Dawson
CFChuchu Fan
Chuchu Fan

14 October 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
KGKunal Garg
Kunal Garg
MBMayank Baranwal
Mayank Baranwal
RGRohit Gupta
Rohit Gupta
MBMouhacine Benosman
Mouhacine Benosman
In this paper, a novel modified proximal dynamical system is proposed to compute the solution of a mixed variational inequality problem (MVIP) within a fixed time, where the time of convergence is finite and is uniformly bounded for all initial conditions. Under the assumptions of strong monotonicity and Lipschitz continuity, it is shown that a solution of the modified proximal dynamical system exists, is uniquely determined, and converges to the unique solution of the associated MVIP within a fixed time. Furthermore, the fixed-time stability of the modified projected dynamical system continues to hold, even if the assumption of strong monotonicity is relaxed to that of strong pseudomonotonicity. Finally, it is shown that the solution obtained using the forward-Euler discretization of the proposed modified proximal dynamical system converges to an arbitrarily small neighborhood of the solution of the associated MVIP within a fixed number of time steps, independent of the initial conditions.

1 December 2019
Verified
Conference Paper
Closed access
KGKunal Garg
Kunal Garg
DPDimitra Panagou
Dimitra Panagou
This paper presents a method for control synthesis under spatio-temporal constraints. First, we consider the problem of reaching a set S in a user-defined or prescribed time T. We define a new class of control Lyapunov functions, called prescribed-time control Lyapunov functions (PT CLF), and present sufficient conditions on the existence of a controller for this problem in terms of PT CLF. Then, we formulate a quadratic program (QP) to compute a control input that satisfies these sufficient conditions. Next, we consider control synthesis under spatio-temporal objectives given as: the closed- loop trajectories remain in a given set S s at all times; and, remain in a specific set S i during the time interval [t i ,t i+1 ) for i = 0,1,⋯, N; and, reach the set S i+1 on or before t = t i+1 . We show that such spatio-temporal specifications can be translated into temporal logic formulas. We present sufficient conditions on the existence of a control input in terms of PT CLF and control barrier functions. Then, we present a QP to compute the control input efficiently, and show its feasibility under the assumptions of existence of a PT CLF. To the best of authors’ knowledge, this is the first paper proposing a QP based method for the aforementioned problem of satisfying spatiotemporal specifications for nonlinear control-affine dynamics with input constraints. We also discuss the limitations of the proposed methods and directions of future work to overcome these limitations. We present numerical examples to corroborate our proposed methods.