Search Results for author: Naomi Leonard

Found 7 papers, 1 papers with code

Blending Data-Driven Priors in Dynamic Games

no code implementations21 Feb 2024 Justin Lidard, Haimin Hu, Asher Hancock, Zixu Zhang, Albert Gimó Contreras, Vikash Modi, Jonathan DeCastro, Deepak Gopinath, Guy Rosman, Naomi Leonard, María Santos, Jaime Fernández Fisac

As intelligent robots like autonomous vehicles become increasingly deployed in the presence of people, the extent to which these systems should leverage model-based game-theoretic planners versus data-driven policies for safe, interaction-aware motion planning remains an open question.

Autonomous Driving Motion Planning

Learning Interpretable Dynamics from Images of a Freely Rotating 3D Rigid Body

1 code implementation23 Sep 2022 Justice Mason, Christine Allen-Blanchette, Nicholas Zolman, Elizabeth Davison, Naomi Leonard

In many real-world settings, image observations of freely rotating 3D rigid bodies, such as satellites, may be available when low-dimensional measurements are not.

A Regret Minimization Approach to Multi-Agent Control

no code implementations28 Jan 2022 Udaya Ghai, Udari Madhushani, Naomi Leonard, Elad Hazan

We study the problem of multi-agent control of a dynamical system with known dynamics and adversarial disturbances.

When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Bandits

no code implementations8 Oct 2021 Udari Madhushani, Naomi Leonard

We propose \textit{ComEx}, a novel cost-effective communication protocol in which the group achieves the same order of performance as full communication while communicating only $O(\log T)$ number of messages.

Decision Making

It Doesn’t Get Better and Here’s Why: A Fundamental Drawback in Natural Extensions of UCB to Multi-agent Bandits

no code implementations NeurIPS Workshop ICBINB 2020 Udari Madhushani, Naomi Leonard

We identify a fundamental drawback of natural extensions of Upper Confidence Bound (UCB) algorithms to the multi-agent bandit problem in which multiple agents facing the same explore-exploit problem can share information.

Heterogeneous Explore-Exploit Strategies on Multi-Star Networks

no code implementations2 Sep 2020 Udari Madhushani, Naomi Leonard

To do so we study a class of distributed stochastic bandit problems in which agents communicate over a multi-star network and make sequential choices among options in the same uncertain environment.

Decision Making

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