Search Results for author: Shankar Sastry

Found 21 papers, 2 papers with code

Privacy Preserving Mechanisms for Coordinating Airspace Usage in Advanced Air Mobility

no code implementations6 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.

Privacy Preserving

Parameter Estimation in Optimal Tolling for Traffic Networks Under the Markovian Traffic Equilibrium

no code implementations29 Sep 2024 Chih-Yuan Chiu, Shankar Sastry

Tolling, or congestion pricing, has emerged as an effective tool for preventing gridlock in traffic systems.

ARC

Convergence of Decentralized Actor-Critic Algorithm in General-sum Markov Games

no code implementations6 Sep 2024 Chinmay Maheshwari, Manxi Wu, Shankar Sastry

Markov games provide a powerful framework for modeling strategic multi-agent interactions in dynamic environments.

Incentive-Compatible Vertiport Reservation in Advanced Air Mobility: An Auction-Based Approach

no code implementations27 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.

Dynamic Tolling in Arc-based Traffic Assignment Models

no code implementations11 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.

ARC

Markov $α$-Potential Games

no code implementations21 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.

Representation Learning via Manifold Flattening and Reconstruction

1 code implementation2 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.

Data Compression Representation Learning

Arc-based Traffic Assignment: Equilibrium Characterization and Learning

no code implementations10 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.

ARC

Towards Dynamic Causal Discovery with Rare Events: A Nonparametric Conditional Independence Test

1 code implementation29 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.

Causal Discovery

Competing Bandits in Time Varying Matching Markets

no code implementations21 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.

Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets

no code implementations6 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.

Independent and Decentralized Learning in Markov Potential Games

no code implementations29 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

Simultaneous Localization and Mapping: Through the Lens of Nonlinear Optimization

no code implementations11 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.

Simultaneous Localization and Mapping

Dynamic Tolling for Inducing Socially Optimal Traffic Loads

no code implementations17 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?

Residual Networks: Lyapunov Stability and Convex Decomposition

no code implementations22 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.

Surprise-Based Intrinsic Motivation for Deep Reinforcement Learning

no code implementations6 Mar 2017 Joshua Achiam, Shankar Sastry

Exploration in complex domains is a key challenge in reinforcement learning, especially for tasks with very sparse rewards.

continuous-control Continuous Control +3

Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained $\ell_1$-Minimization

no code implementations23 Dec 2014 Ehsan Elhamifar, Mahdi Soltanolkotabi, Shankar Sastry

High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to.

Clustering

CPRL -- An Extension of Compressive Sensing to the Phase Retrieval Problem

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.

Compressive Sensing Retrieval

Markov Chain Monte Carlo Data Association for Multiple-Target Tracking

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.

Geometric Models of Rolling-Shutter Cameras

no code implementations29 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.