Tzvika Geft
Postdoctoral Researcher, Rutgers University
Research Interests
Algorithmic problems in robotics and automation such as multi-body motion planning
Automating the discovery of algorithms with guarantees
Postdoctoral Researcher, Rutgers University
Research Interests
Algorithmic problems in robotics and automation such as multi-body motion planning
Automating the discovery of algorithms with guarantees
I'm a postdoc working with Kostas Bekris and Jingjin Yu at Rutgers University.
I obtained my BSc, MSc, and PhD in Computer Science at Tel Aviv University, where I was fortunate to work with Dan Halperin at the Computational Geometry Lab.
My PhD research focuses on coordinated motion planning for multiple moving agents/bodies. I've been deepening our understanding of what makes key problems computationally hard, identifying new algorithms and pushing tractability frontiers.
Contact: tzvika.geft [at] gmail [dot] com
News
Nov 2025: Paper accepted at AAAI 2026 (oral, 17.6% acceptance)!
Sep 2025: Gave a talk at the NYC Geometry Seminar at the Courant Institute, NYU!
Apr 2025: Gave a virtual talk at Sven Koenig's lab at UC Irvine!
Sep 2024: Started a postdoc at Rutgers University!
Aug 2024: Paper Tractability Frontiers in Multi-Robot Coordination and Geometric Reconfiguration accepted at WAFR 2024!
Jun 2024: Excited to serve as a PC member for WAFR 2024!
Apr 2024: Paper Introducing Delays in Multi Agent Path Finding accepted at SoCS 2024!
Oct 2023: Won a scholarship from the Israeli Smart Transportation Research Center!
Older News
Apr 2023: Paper Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids accepted at SoCS 2023!
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 AAMAS 2023!
Sep 2022: Won a scholarship from the Israeli Smart Transportation Research Center!
Papers
(author order is alphabetical, as is common in some venues, except where indicated by *)
Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval [more details]
*Tzvika Geft, Kostas Bekris, Jingjin Yu
Preprint
Talk: [40 min]
Tractability Frontiers in Multi-Robot Coordination and Geometric Reconfiguration
Tzvika Geft, Dan Halperin, Yonatan Nakar
In 16th International Workshop on the Algorithmic Foundations of Robotics (WAFR 2024)
Introducing Delays in Multi Agent Path Finding
*Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian
In 17th International Symposium on Combinatorial Search (SoCS 2024)
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)
Talk: [20 min]
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 [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
In Computing in Geometry and Topology
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
CS206: Introduction to Discrete Structures II, Rutgers (Fall '24)
First Steps in Computer Science and Python Programming for Labor Studies, TAU (Spring '21 & '22)
Python Programming for Engineers, TAU (Fall '20)
Teaching Assistant
Python Programming for Engineers, TAU (Fall '19, Spring '20, Spring '21, Fall '21)
Python Programming for Chemists, TAU (Spring '17)