Pavankumar Tallapragada
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
Pavankumar Tallapragada has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Jorge Cortes
Department of Mechanical and Aerospace Engineering, University of California, San Diego, CA, USA
8 shared publications - Anusree Rajan
Department of Electrical Engineering, Indian Institute of Science, Bengaluru, India
3 shared publications - Erfan Nozari
University of California, Riverside
3 shared publications Jorge Cortes
3 shared publicationsMassimo Franceschetti
3 shared publications- Nirabhra Mandal
Contextual Robotics Institute and the Department of Mechanical and Aerospace Engineering, UC San Diego, La Jolla, CA, USA
3 shared publications
Latest Publications
- 23 July 2025
- Published by Elsevier in European Journal of Control
- Vol. 86
A control Lyapunov function approach to event-triggered parameterized control for discrete-time linear systems
- 23 July 2025
- Published by Elsevier in European Journal of Control
- Vol. 86
A control Lyapunov function approach to event-triggered parameterized control for discrete-time linear systems
- 2 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 5-17
Opinion Dynamics for Utility Maximizing Agents: Exploring the Impact of the Resource Penalty
We propose a continuous-time nonlinear model of opinion dynamics with utility-maximizing agents connected via a social influence network. A distinguishing feature of the proposed model is the inclusion of an opinion-dependent resource-penalty term in the utilities, which limits the agents from holding opinions of large magnitude. This model is applicable in scenarios where the opinions pertain to the usage of resources, such as money, time, computational resources etc. Each agent myopically seeks to maximize its utility by revising its opinion in the gradient ascent direction of its utility function, thus leading to the proposed opinion dynamics. We show that, for any arbitrary social influence network, opinions are ultimately bounded. For networks with weak antagonistic relations , we show that there exists a globally exponentially stable equilibrium using contraction theory. We establish conditions for the existence of consensus equilibrium and analyze the relative dominance of the agents at consensus. We also conduct a game-theoretic analysis of the underlying opinion formation game, including on Nash equilibria and on prices of anarchy in terms of satisfaction ratios . Additionally, we also investigate the oscillatory behavior of opinions in a two-agent scenario. Finally, simulations illustrate our findings.
- 2 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 5-17
Opinion Dynamics for Utility Maximizing Agents: Exploring the Impact of the Resource Penalty
We propose a continuous-time nonlinear model of opinion dynamics with utility-maximizing agents connected via a social influence network. A distinguishing feature of the proposed model is the inclusion of an opinion-dependent resource-penalty term in the utilities, which limits the agents from holding opinions of large magnitude. This model is applicable in scenarios where the opinions pertain to the usage of resources, such as money, time, computational resources etc. Each agent myopically seeks to maximize its utility by revising its opinion in the gradient ascent direction of its utility function, thus leading to the proposed opinion dynamics. We show that, for any arbitrary social influence network, opinions are ultimately bounded. For networks with weak antagonistic relations , we show that there exists a globally exponentially stable equilibrium using contraction theory. We establish conditions for the existence of consensus equilibrium and analyze the relative dominance of the agents at consensus. We also conduct a game-theoretic analysis of the underlying opinion formation game, including on Nash equilibria and on prices of anarchy in terms of satisfaction ratios . Additionally, we also investigate the oscillatory behavior of opinions in a two-agent scenario. Finally, simulations illustrate our findings.
- Open Access
A Control Lyapunov Function Approach to Event-Triggered Parameterized Control for Discrete-Time Linear Systems
This paper proposes an event-triggered parameterized control method using a control Lyapunov function approach for discrete time linear systems with external disturbances. In this control method, each control input to the plant is a linear combination of a fixed set of linearly independent scalar functions. The controller updates the coefficients of the parameterized control input in an event-triggered manner so as to minimize a quadratic cost function subject to quadratic constraints and communicates the same to the actuator. We design an event-triggering rule that guarantees global uniform ultimate boundedness of trajectories of the closed loop system and non-trivial inter-event times. We illustrate our results through numerical examples and we also compare the performance of the proposed control method with other existing control methods in the literature.
Open AccessA Control Lyapunov Function Approach to Event-Triggered Parameterized Control for Discrete-Time Linear Systems
This paper proposes an event-triggered parameterized control method using a control Lyapunov function approach for discrete time linear systems with external disturbances. In this control method, each control input to the plant is a linear combination of a fixed set of linearly independent scalar functions. The controller updates the coefficients of the parameterized control input in an event-triggered manner so as to minimize a quadratic cost function subject to quadratic constraints and communicates the same to the actuator. We design an event-triggering rule that guarantees global uniform ultimate boundedness of trajectories of the closed loop system and non-trivial inter-event times. We illustrate our results through numerical examples and we also compare the performance of the proposed control method with other existing control methods in the literature.
- Open Access
- 29 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 104052-104070
Reinforcement Learning Aided Sequential Optimization for Unsignalized Intersection Management of Robot Traffic
We consider the problem of optimal unsignalized intersection management, wherein we seek to obtain safe and optimal trajectories, for a set of robots that arrive randomly and continually. This problem involves repeatedly solving a mixed integer program (with robot acceleration trajectories as decision variables) with different parameters, for which the computation time using a naive optimization algorithm scales exponentially with the number of robots and lanes. Hence, such an approach is not suitable for real-time implementation. In this paper, we propose a solution framework that combines learning and sequential optimization. In particular, we propose an algorithm for learning a shared policy that given the traffic state information, determines the crossing order of the robots. Then, we optimize the trajectories of the robots sequentially according to that crossing order. This approach inherently guarantees safety at all times. We validate the performance of this approach using extensive simulations and compare our approach against 5 different heuristics from the literature in 9 different simulation settings . Our approach, on average, significantly outperforms the heuristics from the literature in various metrics like objective function, weighted average of crossing times and computation time. For example, in some scenarios, we have observed that our approach offers up to 150% improvement in objective value over the first come first serve heuristic. Even on untrained scenarios, our approach shows a consistent improvement (in objective value) of more than 30% over all heuristics under consideration. We also show through simulations that the computation time for our approach scales linearly with the number of robots (assuming all other factors are constant) . We further implement the learnt policies on physical robots with a few modifications to the solution framework to address real-world challenges and establish its real-time implementability.
- 29 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 104052-104070
Open AccessReinforcement Learning Aided Sequential Optimization for Unsignalized Intersection Management of Robot Traffic
We consider the problem of optimal unsignalized intersection management, wherein we seek to obtain safe and optimal trajectories, for a set of robots that arrive randomly and continually. This problem involves repeatedly solving a mixed integer program (with robot acceleration trajectories as decision variables) with different parameters, for which the computation time using a naive optimization algorithm scales exponentially with the number of robots and lanes. Hence, such an approach is not suitable for real-time implementation. In this paper, we propose a solution framework that combines learning and sequential optimization. In particular, we propose an algorithm for learning a shared policy that given the traffic state information, determines the crossing order of the robots. Then, we optimize the trajectories of the robots sequentially according to that crossing order. This approach inherently guarantees safety at all times. We validate the performance of this approach using extensive simulations and compare our approach against 5 different heuristics from the literature in 9 different simulation settings . Our approach, on average, significantly outperforms the heuristics from the literature in various metrics like objective function, weighted average of crossing times and computation time. For example, in some scenarios, we have observed that our approach offers up to 150% improvement in objective value over the first come first serve heuristic. Even on untrained scenarios, our approach shows a consistent improvement (in objective value) of more than 30% over all heuristics under consideration. We also show through simulations that the computation time for our approach scales linearly with the number of robots (assuming all other factors are constant) . We further implement the learnt policies on physical robots with a few modifications to the solution framework to address real-world challenges and establish its real-time implementability.
- 13 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 1673-1678
Event-Triggered Parameterized Control of Nonlinear Systems
This paper deals with event-triggered parameterized control (ETPC) of nonlinear systems with external disturbances. In this control method, between two successive events, each control input to the plant is a linear combination of a set of linearly independent scalar functions. At each event, the controller updates the coefficients of the parameterized control input so as to minimize the error in approximating a continuous time control signal and communicates the same to the actuator. We design an event-triggering rule (ETR) that guarantees global uniform ultimate boundedness of trajectories of the closed loop system. We also ensure the absence of Zeno behavior by showing the existence of a uniform positive lower bound on the inter-event times (IETs). We illustrate our results through numerical examples.
- 13 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 1673-1678
Event-Triggered Parameterized Control of Nonlinear Systems
This paper deals with event-triggered parameterized control (ETPC) of nonlinear systems with external disturbances. In this control method, between two successive events, each control input to the plant is a linear combination of a set of linearly independent scalar functions. At each event, the controller updates the coefficients of the parameterized control input so as to minimize the error in approximating a continuous time control signal and communicates the same to the actuator. We design an event-triggering rule (ETR) that guarantees global uniform ultimate boundedness of trajectories of the closed loop system. We also ensure the absence of Zeno behavior by showing the existence of a uniform positive lower bound on the inter-event times (IETs). We illustrate our results through numerical examples.
- 15 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 7051-7058
Event-Triggered Control for Nonlinear Systems With Center Manifolds
In this work, we consider the problem of event-triggered implementation of control laws designed for the local stabilization of nonlinear systems with center manifolds. We propose event-triggering conditions which are derived from a local input-to-state stability characterization of such systems. The triggering conditions ensure local ultimate boundedness of the trajectories and the existence of a uniform positive lower bound for the inter-event times. The ultimate bound can be made arbitrarily small, by allowing for smaller inter-event times. Under certain assumptions on the controller structure, local asymptotic stability of the origin is also guaranteed. Two sets of triggering conditions are proposed, one for the case where the exact center manifold is known and the other for the case where only an approximation of the center manifold is computable. Two illustrative examples representative of the two scenarios are presented and the applicability of the proposed methods is demonstrated. The second example concerns the event-triggered implementation of a position stabilizing controller for the open-loop unstable Mobile Inverted Pendulum (MIP) robot.
- 15 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 7051-7058
Event-Triggered Control for Nonlinear Systems With Center Manifolds
In this work, we consider the problem of event-triggered implementation of control laws designed for the local stabilization of nonlinear systems with center manifolds. We propose event-triggering conditions which are derived from a local input-to-state stability characterization of such systems. The triggering conditions ensure local ultimate boundedness of the trajectories and the existence of a uniform positive lower bound for the inter-event times. The ultimate bound can be made arbitrarily small, by allowing for smaller inter-event times. Under certain assumptions on the controller structure, local asymptotic stability of the origin is also guaranteed. Two sets of triggering conditions are proposed, one for the case where the exact center manifold is known and the other for the case where only an approximation of the center manifold is computable. Two illustrative examples representative of the two scenarios are presented and the applicability of the proposed methods is demonstrated. The second example concerns the event-triggered implementation of a position stabilizing controller for the open-loop unstable Mobile Inverted Pendulum (MIP) robot.
- Open Access
Asymptotic Behavior of Inter-Event Times in Planar Systems under Event-Triggered Control
This paper analyzes the asymptotic behavior of inter-event times in planar linear systems, under event-triggered control with a general class of scale-invariant event triggering rules. In this setting, the inter-event time is a function of the angle of the state at an event. This viewpoint allows us to analyze the inter-event times by studying the fixed points of the angle map, which represents the evolution of the angle of the state from one event to the next. We provide a sufficient condition for the convergence or non-convergence of inter-event times to a steady state value under a scale-invariant event-triggering rule. Following up on this, we further analyze the inter-event time behavior in the special case of threshold based event-triggering rule and we provide various conditions for convergence or non-convergence of inter-event times to a constant. We also analyze the asymptotic average inter-event time as a function of the angle of the initial state of the system. With the help of ergodic theory, we provide a sufficient condition for the asymptotic average inter-event time to be a constant for all non-zero initial states of the system. Then, we consider a special case where the angle map is an orientation-preserving homeomorphism. Using rotation theory, we comment on the asymptotic behavior of the inter-event times, including on whether the inter-event times converge to a periodic sequence. We illustrate the proposed results through numerical simulations.
Open AccessAsymptotic Behavior of Inter-Event Times in Planar Systems under Event-Triggered Control
This paper analyzes the asymptotic behavior of inter-event times in planar linear systems, under event-triggered control with a general class of scale-invariant event triggering rules. In this setting, the inter-event time is a function of the angle of the state at an event. This viewpoint allows us to analyze the inter-event times by studying the fixed points of the angle map, which represents the evolution of the angle of the state from one event to the next. We provide a sufficient condition for the convergence or non-convergence of inter-event times to a steady state value under a scale-invariant event-triggering rule. Following up on this, we further analyze the inter-event time behavior in the special case of threshold based event-triggering rule and we provide various conditions for convergence or non-convergence of inter-event times to a constant. We also analyze the asymptotic average inter-event time as a function of the angle of the initial state of the system. With the help of ergodic theory, we provide a sufficient condition for the asymptotic average inter-event time to be a constant for all non-zero initial states of the system. Then, we consider a special case where the angle map is an orientation-preserving homeomorphism. Using rotation theory, we comment on the asymptotic behavior of the inter-event times, including on whether the inter-event times converge to a periodic sequence. We illustrate the proposed results through numerical simulations.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2545-2551
Analysis of Interevent Times in Linear Systems Under Region-Based Self-Triggered Control
This paper analyzes the evolution of inter-event times (IETs) in linear systems under region-based self-triggered control (RBSTC). In this control method, the state space is partitioned into a finite number of conic regions and each region is associated with a fixed IET. In this framework, studying the steady state behavior of the IETs is equivalent to studying the existence of a conic subregion that is positively invariant under the map that gives the evolution of the state from one event to the next. We provide necessary conditions and sufficient conditions for the existence of a positively invariant subregion (PIS). We also provide necessary and sufficient conditions for a PIS to be asymptotically stable. Indirectly, they provide necessary and sufficient conditions for local convergence of IETs to a constant or to a given periodic sequence. We illustrate the proposed method of analysis and results through numerical simulations.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2545-2551
Analysis of Interevent Times in Linear Systems Under Region-Based Self-Triggered Control
This paper analyzes the evolution of inter-event times (IETs) in linear systems under region-based self-triggered control (RBSTC). In this control method, the state space is partitioned into a finite number of conic regions and each region is associated with a fixed IET. In this framework, studying the steady state behavior of the IETs is equivalent to studying the existence of a conic subregion that is positively invariant under the map that gives the evolution of the state from one event to the next. We provide necessary conditions and sufficient conditions for the existence of a positively invariant subregion (PIS). We also provide necessary and sufficient conditions for a PIS to be asymptotically stable. Indirectly, they provide necessary and sufficient conditions for local convergence of IETs to a constant or to a given periodic sequence. We illustrate the proposed method of analysis and results through numerical simulations.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1116-1127
Dynamics of a Stratified Population of Optimum Seeking Agents on a Network—Part II: Steady-State Analysis
In this second part of our work, we study the steady state of the population and the social utility for a general class of dynamics that converge to the set of Nash equilibria and follow a certain positive correlation property. This class of dynamics includes the three dynamics introduced in the first part. We provide sufficient conditions on the network based on a maximum payoff density parameter of each node under which there exists a unique Nash equilibrium. We then utilize the positive correlation properties of the dynamics to reduce the flow graph in order to provide an upper bound on the steady-state social utility. Finally, we extend the idea behind the sufficient condition for the existence of a unique Nash equilibrium to partition the graph appropriately in order to provide a lower bound on the steady-state social utility. We also illustrate interesting cases as well as our results using simulations.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1116-1127
Dynamics of a Stratified Population of Optimum Seeking Agents on a Network—Part II: Steady-State Analysis
In this second part of our work, we study the steady state of the population and the social utility for a general class of dynamics that converge to the set of Nash equilibria and follow a certain positive correlation property. This class of dynamics includes the three dynamics introduced in the first part. We provide sufficient conditions on the network based on a maximum payoff density parameter of each node under which there exists a unique Nash equilibrium. We then utilize the positive correlation properties of the dynamics to reduce the flow graph in order to provide an upper bound on the steady-state social utility. Finally, we extend the idea behind the sufficient condition for the existence of a unique Nash equilibrium to partition the graph appropriately in order to provide a lower bound on the steady-state social utility. We also illustrate interesting cases as well as our results using simulations.
- 26 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1104-1115
Dynamics of a Stratified Population of Optimum Seeking Agents on a Network—Part I: Modeling and Convergence Analysis
In this article, we consider a population composed of a continuum of agents that seek to maximize a payoff function by moving on a network. The nodes in the network may represent physical locations or abstract choices. The population is stratified, i.e., agents opting for the same choice may not get the same payoff. In particular, we assume payoff functions with diminishing returns, i.e., agents in “newer” strata of a node receive a smaller payoff compared to “older” strata. In this first part of this two-part work, we model the population dynamics under three choice revision policies, having varying levels of coordination: 1) no coordination and the agents are selfish; 2) coordination among agents in each node; and 3) coordination across the entire population. For the case with selfish agents, we generalize the Smith dynamics to our setting, where we have a stratified population and network constraints. To model nodal coordination, we allow the fraction of population in a node, as a whole, to take the “best response” to the state of the population in the node’s neighborhood. For the case of population-wide coordination, we explore a dynamics where the population evolves according to centralized gradient ascent of the social utility, though constrained by the network. In each case, we show that the dynamics has existence and uniqueness of solutions and also show that the solutions from any initial condition asymptotically converge to the set of Nash equilibria.
- 26 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1104-1115
Dynamics of a Stratified Population of Optimum Seeking Agents on a Network—Part I: Modeling and Convergence Analysis
In this article, we consider a population composed of a continuum of agents that seek to maximize a payoff function by moving on a network. The nodes in the network may represent physical locations or abstract choices. The population is stratified, i.e., agents opting for the same choice may not get the same payoff. In particular, we assume payoff functions with diminishing returns, i.e., agents in “newer” strata of a node receive a smaller payoff compared to “older” strata. In this first part of this two-part work, we model the population dynamics under three choice revision policies, having varying levels of coordination: 1) no coordination and the agents are selfish; 2) coordination among agents in each node; and 3) coordination across the entire population. For the case with selfish agents, we generalize the Smith dynamics to our setting, where we have a stratified population and network constraints. To model nodal coordination, we allow the fraction of population in a node, as a whole, to take the “best response” to the state of the population in the node’s neighborhood. For the case of population-wide coordination, we explore a dynamics where the population evolves according to centralized gradient ascent of the social utility, though constrained by the network. In each case, we show that the dynamics has existence and uniqueness of solutions and also show that the solutions from any initial condition asymptotically converge to the set of Nash equilibria.