369 citations · 447 across the 15 of their papers we have counts for
3 papers · 1 filter
On the Approximability of Time Disjoint Walks
Alexandre Bayen, Jesse Goodman, Eugene Vinitsky
We introduce the combinatorial optimization problem Time Disjoint Walks (TDW), which has applications in collision-free routing of discrete objects (e.g., autonomous vehicles) over…
A unified software framework for solving traffic assignment problems
Juliette Ugirumurera, Gabriel Gomes, Emily Porter +2
We describe a software framework for solving user equilibrium traffic assignment problems. The design is based on the formulation of the problem as a variational inequality. The so…
Variance Reduction for Policy Gradient with Action-Dependent Factorized Baselines
Cathy Wu, Aravind Rajeswaran, Yan Duan +5
Policy gradient methods have enjoyed great success in deep reinforcement learning but suffer from high variance of gradient estimates. The high variance problem is particularly exa…