no code implementations • 6 Nov 2024 • Chinmay Maheshwari, Maria G. Mendoza, Victoria Marie Tuck, Pan-Yang Su, Victor L. Qin, Sanjit A. Seshia, Hamsa Balakrishnan, Shankar Sastry
To ensure the cost information of AAM vehicles remains private, we introduce a novel mechanism that allocates each vehicle a budget of "air-credits" and anonymously charges prices for traversing the edges of the time-extended graph.
no code implementations • 29 Sep 2024 • Chih-Yuan Chiu, Shankar Sastry
Tolling, or congestion pricing, has emerged as an effective tool for preventing gridlock in traffic systems.
no code implementations • 6 Sep 2024 • Chinmay Maheshwari, Manxi Wu, Shankar Sastry
Markov games provide a powerful framework for modeling strategic multi-agent interactions in dynamic environments.
no code implementations • 27 Mar 2024 • Pan-Yang Su, Chinmay Maheshwari, Victoria Tuck, Shankar Sastry
The rise of advanced air mobility (AAM) is expected to become a multibillion-dollar industry in the near future.
no code implementations • 18 Jan 2024 • Marsalis Gibson, David Babazadeh, Claire Tomlin, Shankar Sastry
Adversarial attacks on learning-based multi-modal trajectory predictors have already been demonstrated.
no code implementations • 11 Jul 2023 • Chih-Yuan Chiu, Chinmay Maheshwari, Pan-Yang Su, Shankar Sastry
We prove that our adaptive learning and marginal pricing dynamics converge to a neighborhood of the socially optimal loads and tolls.
no code implementations • 21 May 2023 • Xin Guo, Xinyu Li, Chinmay Maheshwari, Shankar Sastry, Manxi Wu
We study two important classes of practically significant Markov games, Markov congestion games and the perturbed Markov team games, via the framework of Markov $\alpha$-potential games, with explicit characterization of an upper bound for $\mnpg$ and its relation to game parameters.
1 code implementation • 2 May 2023 • Michael Psenka, Druv Pai, Vishal Raman, Shankar Sastry, Yi Ma
This work proposes an algorithm for explicitly constructing a pair of neural networks that linearize and reconstruct an embedded submanifold, from finite samples of this manifold.
no code implementations • 10 Apr 2023 • Chih-Yuan Chiu, Chinmay Maheshwari, Pan-Yang Su, Shankar Sastry
Arc-based traffic assignment models (TAMs) are a popular framework for modeling traffic network congestion generated by self-interested travelers who sequentially select arcs based on their perceived latency on the network.
1 code implementation • 29 Nov 2022 • Chih-Yuan Chiu, Kshitij Kulkarni, Shankar Sastry
Causal phenomena associated with rare events occur across a wide range of engineering problems, such as risk-sensitive safety analysis, accident analysis and prevention, and extreme value theory.
no code implementations • 21 Oct 2022 • Deepan Muthirayan, Chinmay Maheshwari, Pramod P. Khargonekar, Shankar Sastry
We study the problem of online learning in two-sided non-stationary matching markets, where the objective is to converge to a stable match.
no code implementations • 6 Jun 2022 • Chinmay Maheshwari, Eric Mazumdar, Shankar Sastry
We study the problem of online learning in competitive settings in the context of two-sided matching markets.
no code implementations • 29 May 2022 • Chinmay Maheshwari, Manxi Wu, Druv Pai, Shankar Sastry
We study a multi-agent reinforcement learning dynamics, and analyze its convergence in infinite-horizon discounted Markov potential games.
Multi-agent Reinforcement Learning
reinforcement-learning
+1
no code implementations • 11 Dec 2021 • Amay Saxena, Chih-Yuan Chiu, Joseph Menke, Ritika Shrivastava, Shankar Sastry
This work presents an optimization-based framework that unifies these approaches, and allows users to flexibly implement different design choices, e. g., the number and types of variables maintained in the algorithm at each time.
no code implementations • 17 Oct 2021 • Chinmay Maheshwari, Kshitij Kulkarni, Manxi Wu, Shankar Sastry
How to design tolls that induce socially optimal traffic loads with dynamically arriving travelers who make selfish routing decisions?
no code implementations • 22 Mar 2018 • Kamil Nar, Shankar Sastry
While training error of most deep neural networks degrades as the depth of the network increases, residual networks appear to be an exception.
no code implementations • 6 Mar 2017 • Joshua Achiam, Shankar Sastry
Exploration in complex domains is a key challenge in reinforcement learning, especially for tasks with very sparse rewards.
no code implementations • 23 Dec 2014 • Ehsan Elhamifar, Mahdi Soltanolkotabi, Shankar Sastry
High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to.
no code implementations • NeurIPS 2012 • Henrik Ohlsson, Allen Yang, Roy Dong, Shankar Sastry
This paper presents a novel extension of CS to the phase retrieval problem, where intensity measurements of a linear system are used to recover a complex sparse signal.
no code implementations • IEEE Transactions on Automatic Control 2009 • Songhwai Oh, Stuart Russell, Shankar Sastry
This paper presents Markov chain Monte Carlo data association (MCMCDA) for solving data association problems arising in multiple-target tracking in a cluttered environment.
no code implementations • 29 Mar 2005 • Marci Meingast, Christopher Geyer, Shankar Sastry
We develop a general projection equation for a rolling shutter camera and show how it is affected by different types of camera motion.