8 citations · 20 across the 6 of their papers we have counts for
Showing 2021 · cs.AIShow all
2 papers · 2 filters
cs.AI2021★ 2 cited
Learning Space Partitions for Path Planning
Kevin Yang, Tianjun Zhang, Chris Cummins +6
Path planning, the problem of efficiently discovering high-reward trajectories, often requires optimizing a high-dimensional and multimodal reward function. Popular approaches like…
cs.AI2021★ 2 cited
Off-Belief Learning
Hengyuan Hu, Adam Lerer, Brandon Cui +4
The standard problem setting in Dec-POMDPs is self-play, where the goal is to find a set of policies that play optimally together. Policies learned through self-play may adopt arbi…