5 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.MA2022★ 5 cited
Refined Hardness of Distance-Optimal Multi-Agent Path Finding
Tzvika Geft, Dan Halperin
We study the computational complexity of multi-agent path finding (MAPF). Given a graph and a set of agents, each having a start and target vertex, the goal is to find collisio…
cs.RO2020★ 5 cited
Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores
Tzvika Geft, Aviv Tamar, Ken Goldberg +1
To compute robust 2D assembly plans, we present an approach that combines geometric planning with a deep neural network. We train the network using the Box2D physics simulator with…