Tzvika Geft

I'm a PhD candidate at the School of Computer Science, Tel Aviv University, where I am a member of the Computational Geometry Lab led by Dan Halperin. 

I'm interested in algorithmic and computational challenges in planning for robotics, mobility, and related multi-agent settings. My current focus is coordinated motion planning for multiple moving agents/bodies. I've been deepening our understanding of what makes core problems computationally hard, thereby identifying new algorithms and tractability frontiers towards more effective practical solutions.

Previously I completed my BSc and MSc in Computer Science at Tel Aviv University, with the latter advised by Dan Halperin.

Email: zvigreg@mail.tau.ac.il

News

• Oct 2023: Won a scholarship from the Israeli Smart Transportation Research Center

• Apr 2023: Paper Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids accepted to SoCS2023!

• Jan 2023: Won a scholarship from the Shlomo Shmeltzer Institute for Smart Transportation

• Dec 2022: Dean’s teaching excellence award from the Faculty of Engineering, Tel Aviv University

• Dec 2022: Visited Mikkel Abrahamsen and gave a talk at BARC, University of Copenhagen

• Oct 2022: Paper Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity accepted to AAMAS2023!

• Sep 2022: Won a scholarship from the Israeli Smart Transportation Research Center

Papers
(alphabetical author ordering unless indicated by *)

Tractability Frontiers in Multi-Robot Coordination and Geometric Reconfiguration
Tzvika Geft, Dan Halperin, Yonatan Nakar
(Preprint)

Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Tzvika Geft
In 16th International Symposium on Combinatorial Search (SoCS 2023)

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity
Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav
In 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023)

Multi-Robot Motion Planning for Unit Discs with Revolving Areas
Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor
In 33rd International Symposium on Algorithms and Computation (ISAAC 2022) and Computational Geometry (special issue)

Refined Hardness of Distance-Optimal Multi-Agent Path Finding
Tzvika Geft and Dan Halperin
In 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022)
Talks: [Summary (12 min)] [Extended Talk (40 min, first part of video)]

On Two-Handed Planar Assembly Partitioning with Connectivity Constraints [featured work - more details]
Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin
In 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) [SODA version]
Talks: [Summary (25 min)] [Algorithm (55 min)] [Hardness (50 min)]

Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold
Prosenjit Bose, Efi Fogel, Tzvika Geft, Dan Halperin, Shahar Shamai
Under review

*Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores
Tzvika Geft, Aviv Tamar, Ken Goldberg, Dan Halperin
In 2019 IEEE International Conference on Automation Science and Engineering (CASE 2019)

Teaching

Instructor
First Steps in Computer Science and Python Programming for Labor Studies (Spring '21 & '22)
Python Programming for Engineers (Fall '20)

Teaching Assistant
Python Programming for Engineers (Fall '19, Spring '20, Spring '21, Fall '21)
Python Programming for Chemists  (Spring '17)