Addison Kalanther

I’m a first-year EECS PhD Student at UC Berkeley, advised by Professor Shankar Sastry in Berkeley Artificial Intelligence Research (BAIR). I am interested in long-horizon reasoning for manipulation tasks and, more broadly, general intelligence for robotics. My current research concerns robot learning and reinforcement learning, and I previously researched multi-agent reinforcement learning. Outside of research, I enjoy sports and music.

I’m also a researcher at Tensr and involved with BAIR media, serving as editor for the blog and manager for the website.

Research

NePPO: Near-Potential Policy Optimization for General-Sum Multi-Agent Reinforcement Learning

A. Kalanther, S. Bharvirkar, S. Sastry, C. Maheshwari
IEEE Conference on Decision and Control (CDC), 2026 [Accepted]
project page / arXiv
We propose NePPO, a multi-agent RL algorithm for approximating Nash equilibria in general-sum games. It learns a player-independent potential function by minimizing a novel objective with zeroth-order gradient descent.

Coordinated Autonomous Drones for Human-Centered Fire Evacuation in Partially Observable Urban Environments

M. Mendoza, A. Kalanther, D. Bostwick, E. Stephan, C. Maheshwari, S. Sastry
IEEE Global Humanitarian Technology Conference (GHTC), 2025
project page / arXiv
We train heterogeneous UAVs to guide human evacuees through a simulated urban fire, modeling it as a POMDP and using RL to learn policies robust to unknown panic behavior.

Evader-Agnostic Team-Based Pursuit Strategies in Partially-Observable Environments

A. Kalanther, D. Bostwick, C. Maheshwari, S. Sastry
Workshop on Multi-Agent Systems, Robotics: Science and Systems (RSS), 2025
project page / arXiv
We develop a sample-efficient strategy for unknown adversaries in a partially-observable pursuit-evasion game, using a bounded-rationality model to collect diverse evader policies and deep RL to train an adaptive pursuer team.