Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Umesh Vaidya

dblp:63/8128 · also Umesh G. Vaidya · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0002-0483-4921ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 5 since 2021Systems, architecture and hardware · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Motion planning and robot control · 46% Robot navigation and mapping · 30% Learning theory · 23%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%
Theoretical computer science
2 papers
Computational complexity · 50% Mathematical optimization · 50%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › mobile robot navigation
off-road navigation
0.912025
Digital Twins Meet the Koopman Operator: Data-Driven Learning for Robust Autonomy · ICRA 2025
Robotics › Motion planning and robot control › robot control
optimal control
0.712023
Data-driven optimal control under safety constraints using sparse Koopman approximation · ICRA 2023
Robotics › Motion planning and robot control
robot control
0.712023
Data-driven optimal control under safety constraints using sparse Koopman approximation · ICRA 2023
Machine learning and data management
sparse learning
0.712023
Sparse Learning of Dynamical Systems in RKHS: An Operator-Theoretic Approach · ICML 2023
Mathematical optimization
linear programming
0.212023
Data-driven optimal control under safety constraints using sparse Koopman approximation · ICRA 2023
Computational complexity › learning theory
sample complexity
0.212023
Sparse Learning of Dynamical Systems in RKHS: An Operator-Theoretic Approach · ICML 2023

Methods — techniques the papers use, named apart from their topics

reproducing kernel hilbert space · 2.0covariance-type operators · 2.0sparse approximation · 1.3least squares · 1.3koopman operator · 1.3koopman operator theory · 0.9digital twin · 0.9
YearPublicationVenuePosition
2025 Digital Twins Meet the Koopman Operator: Data-Driven Learning for Robust Autonomy
abstract
Contrary to on-road autonomous navigation, off-road autonomy is complicated by various factors ranging from sensing challenges to terrain variability. In such a milieu, data-driven approaches have been commonly employed to capture intricate vehicle-environment interactions effectively. However, the success of data-driven methods depends crucially on the quality and quantity of data, which can be compromised by large variability in off-road environments. To address these concerns, we present a novel methodology to recreate the exact vehicle and its target operating conditions digitally for domain-specific data generation. This enables us to effectively model off-road vehicle dynamics from simulation data using the Koopman operator theory, and employ the obtained models for local motion planning and optimal vehicle control. The capabilities of the proposed methodology are demonstrated through an autonomous navigation problem of a 1:5 scale vehicle, where a terrain-informed planner is employed for global mission planning. Results indicate a substantial improvement in off-road navigation performance with the proposed algorithm (↑ 5.84×) and underscore the efficacy of digital twinning in terms of improving the sample efficiency (↑ 3.2×) and reducing the sim2real gap (↓ 5.2%).
Chinmay Vilas Samak, Tanmay Vilas Samak, Ajinkya Joglekar, Umesh Vaidya, Venkat N. Krovi
ICRA4
2025 Functional control of network dynamical systems: An information theoretic approach
Moirangthem Sailash Singh, Ramkrishna Pasumarthy, Umesh Vaidya, Steffen Leonhardt
Inf. Sci.3
2023 Sparse Learning of Dynamical Systems in RKHS: An Operator-Theoretic Approach
abstract
Transfer operators provide a rich framework for representing the dynamics of very general, nonlinear dynamical systems. When interacting with reproducing kernel Hilbert spaces (RKHS), descriptions of dynamics often incur prohibitive data storage requirements, motivating dataset sparsification as a precursory step to computation. Further, in practice, data is available in the form of trajectories, introducing correlation between samples. In this work, we present a method for sparse learning of transfer operators from $\beta$-mixing stochastic processes, in both discrete and continuous time, and provide sample complexity analysis extending existing theoretical guarantees for learning from non-sparse, i.i.d. data. In addressing continuous-time settings, we develop precise descriptions using covariance-type operators for the infinitesimal generator that aids in the sample complexity analysis. We empirically illustrate the efficacy of our sparse embedding approach through deterministic and stochastic nonlinear system examples.
Boya Hou, Sina Sanjari, Nathan Dahlin, Subhonmesh Bose, Umesh Vaidya
ICML5
2023 Data-driven optimal control under safety constraints using sparse Koopman approximation
abstract
In this work we approach the dual optimal reach-safe control problem using sparse approximations of Koopman operator. Matrix approximation of Koopman operator needs to solve a least-squares (LS) problem in the lifted function space, which is computationally intractable for fine discretizations and high dimensions. The state transitional physical meaning of the Koopman operator leads to a sparse LS problem in this space. Leveraging this sparsity, we propose an efficient method to solve the sparse LS problem where we reduce the problem dimension dramatically by formulating the problem using only the non-zero elements in the approximation matrix with known sparsity pattern. The obtained matrix approximation of the operators is then used in a dual optimal reach-safe problem formulation where a linear program with sparse linear constraints naturally appears. We validate our proposed method on various dynamical systems and show that the computation time for operator approximation is greatly reduced with high precision in the solutions.
Hongzhe Yu, Joseph Moyalan, Umesh Vaidya, Yongxin Chen 0002
ICRA3
2023 Data-Driven Modeling and Experimental Validation of Autonomous Vehicles Using Koopman Operator: Distribution A: Approved for Public Release; Distribution Unlimited. OPSEC # 7248
abstract
This paper presents a data-driven framework to discover underlying dynamics on a scaled F1TENTH vehicle using the Koopman operator linear predictor. Traditionally, a range of white, gray, or black-box models are used to develop controllers for vehicle path tracking. However, these models are constrained to either linearized operational domains, unable to handle significant variability or lose explainability through end-2-end operational settings. The Koopman Extended Dynamic Mode Decomposition (EDMD) linear predictor seeks to utilize data-driven model learning whilst providing benefits like explainability, model analysis and the ability to utilize linear model-based control techniques. Consider a trajectory-tracking problem for our scaled vehicle platform. We collect pose measurements of our F1TENTH car undergoing standard vehicle dynamics benchmark maneuvers with an OptiTrack indoor localization system. Utilizing these uniformly spaced temporal snapshots of the states and control inputs, a data-driven Koopman EDMD model is identified. This model serves as a linear predictor for state propagation, upon which an MPC feedback law is designed to enable trajectory tracking. The prediction and control capabilities of our framework are highlighted through real-time deployment on our scaled vehicle.
Ajinkya Joglekar, Sarang Sutavani, Chinmay Vilas Samak, Tanmay Vilas Samak, Krishna Chaitanya Kosaraju, Jonathon M. Smereka, David J. Gorsich, Umesh Vaidya, Venkat N. Krovi
IROS8
2021 A fast saddle-point dynamical system approach to robust deep learning
Yasaman Esfandiari, Aditya Balu, Keivan Ebrahimi, Umesh Vaidya, Nicola Elia, Soumik Sarkar
Neural Networks4
2015 Vulnerability analysis of dynamical power networks to stochastic link failure attacks
abstract
In this paper, we present results for the vulnerability analysis of a power network to stochastic link failure attacks. We assume a network links are subjected to attacks where the link-based attack is modeled as stochastic perturbation to link weight. The objective is to determine which links in the network can tolerate the least amount of stochastic perturbation to maintain stochastic stability of a power network. We develop a system theoretical-based, analytical, and computation framework that allows us to rank links in the order of their critical importance to maintain stochastic stability of the network. The computational approach relies on solving a Linear Matrix Inequality (LMI). The developed framework is applied to a structure preserving model of the power network. The structure preserving model allows for the representation of original network topology, thereby identifying critical links connecting generators and load buses. Simulations are performed on IEEE 14 bus system to demonstrate the application of the developed framework.
Sai Pushpak Nandanoori, Amit Diwadkar, Umesh Vaidya
HSCC3