Daniele Gammelli

I am a postdoc at Stanford University, where I work with Marco Pavone on deep learning, reinforcement learning and robotics, with an emphasis on autonomous aerospace vehicles and future mobility systems.

I completed my PhD at the Technical University of Denmark (DTU), working with Francisco Camara Pereira, Filipe Rodrigues, and Dario Pacino. During my PhD, I was fortunate to spend my time in the Machine Learning for Smart Mobility Lab. Before my PhD, I spent some time in Amazon's Operations Research Team.

Email  /  Twitter  /  Google Scholar  /  Github  /  CV  /  LinkedIn

I am interested in the capability of autonomous agents to develop broadly intelligent behavior through learning and interaction, aiming for a reliable and beneficial deployment of AI in the real world.

News

Teaching

Stanford AA203: Optimal and Learning-based Control - Spring 2023

Recent Talks

Tutorial on Graph Reinforcement Learning - Center for Automotive Research at Stanford



Learning and Control for Adaptive Transportation Systems - PhD Thesis



Research

I am interested in the capability of autonomous agents to develop broadly intelligent behavior through learning and interaction, aiming for a reliable and beneficial deployment of AI in the real world. Towards this goal, I focus on machine learning, reinforcement learning, and optimal control for decision-making.

Transformers for Trajectory Optimization with Application to Spacecraft Rendezvous
Tommaso Guffanti*, Daniele Gammelli*, Simone D'Amico, Marco Pavone
IEEE Aerospace Conference, 2024
project page / arXiv / code

We introduce the Autonomous Rendezvous Transformer (ART) for spacecraft trajectory optimization. ART combines optimization-based and AI-based methods, which improves task performance while providing the safety assurances needed for space operations. The method entails embedding high-capacity (namely, transformer-based) neural network models within the optimization process for trajectory generation.

Graph Reinforcement Learning for Network Control via Bi-Level Optimization
Daniele Gammelli, James Harrison, Kaidi Yang, Filipe Rodrigues, Francisco C. Pereira, Marco Pavone
International Conference on Machine Learning (ICML), 2023
project page / arXiv / code

We propose a learning-based framework to handle a broad class of network problems by exploiting the main strengths of graph representation learning, reinforcement learning, and classical operations research tools.

Real-time Control of Electric Autonomous Mobility-on-Demand Systems via Graph Reinforcement Learning
Aaryan Singhal, Daniele Gammelli, Justin Luke, Karthik Gopalakrishnan, Dominik Helmreich, Marco Pavone
arXiv, 2023
arXiv / code

We present the E-AMoD control problem through the lens of reinforcement learning and propose a graph network-based framework to achieve drastically improved scalability and performance over heuristics.

Graph Meta-Reinforcement Learning for Transferable Autonomous Mobility-on-Demand
Daniele Gammelli, James Harrison, Kaidi Yang, Filipe Rodrigues, Francisco C. Pereira, Marco Pavone
Conference on Knowledge Discovery and Data Mining (KDD), 2022 (Oral)
arXiv / code

We formalize the multi-city AMoD problem through the lens of meta-reinforcement learning and devise an RL agent based on recurrent graph neural networks. In our approach, AMoD controllers are explicitly trained such that a small amount of experience within a new city will produce good system performance.

Predictive and Prescriptive Performance of Bike-sharing Demand Forecasts for Inventory Management
Daniele Gammelli, Yihua Wang, Dennis Prak, Filipe Rodrigues, Stefan Minner, Francisco C. Pereira
Transportation Research Part C: Emerging Technologies (TR-C), 2022
podcast / arXiv / code

We devise a deep generative model to forecast future pickup and return rates for shared mobility services. We show how more accurate predictions do not necessarily translate into better inventory decisions. By providing insights into the interplay between forecasts, model assumptions, and decisions, we point out that forecasts and decision models should be carefully evaluated and harmonized to optimally control shared mobility systems.

Generalized Multi-Output Gaussian Process Censored Regression
Daniele Gammelli, Kasper Pryds Rolsted, Dario Pacino, Filipe Rodrigues
Pattern Recognition, 2022
arXiv / code

We propose a novel extension to the multi-output Gaussian process framework that leverages information from multiple correlated outputs to address the censoring problem. We further position the proposed model into a general framework capable of dealing with arbitrary likelihood functions for the purpose of censored modelling.

Recurrent Flow Networks: A Recurrent Latent Variable Model for Density Modelling of Urban Mobility
Daniele Gammelli, Filipe Rodrigues
Pattern Recognition, 2022
ICML Workshop on Invertible Neural Nets and Normalizing Flows, 2022
arXiv / code

We introduce recurrent flow networks (RFN) for spatio-temporal data prediction by explicitly disentangling between temporal and spatial variability.

Graph Neural Network Reinforcement Learning for Autonomous Mobility-on-Demand Systems
Daniele Gammelli, James Harrison, Kaidi Yang, Filipe Rodrigues, Francisco C. Pereira, Marco Pavone
Conference on Decision and Control (CDC), 2021
ICML Workshop on RL for Real Life, 2021 (Best paper candiate)
arXiv / code

We propose a deep reinforcement learning framework to control the rebalancing of AMoD systems through graph neural networks. Crucially, we demonstrate that graph neural networks enable reinforcement learning agents to recover behavior policies that are significantly more transferable, generalizable, and scalable than policies learned through other approaches.

Estimating Latent Demand of Shared Mobility through Censored Gaussian Processes
Daniele Gammelli, Inon Peled, Filipe Rodrigues, Dario Pacino, Haci A. Kurtaran, Francisco C. Pereira
Transportation Research Part C: Emerging Technologies, 2020
Transportation Research Board Annual Meeting (TRB), 2020 (Lectern Session)
arXiv / code

We propose a general method for censorship-aware modeling, for which we devise a censored likelihood function. We apply this method to the task of shared mobility demand prediction by incorporating the censored likelihood within a Gaussian Process model, which can flexibly approximate arbitrary functional forms.


This website is based on this cool template!