Tzvika Geft
I am a Ph.D.
candidate at the School of Computer Science, Tel Aviv University, where I am a
member of the Computational Geometry Lab
led by Dan Halperin. My current interest is improving the understanding of the complexity of NP-hard motion planning problems, in order to better confront them. I have been working on problems in multi-robot motion planning, assembly planning, and geometric reconfiguration. Previously I completed my B.Sc. and M.Sc. in Computer Science at
Tel Aviv University, with the latter advised by Dan Halperin. Contact me zvigreg@mail.tau.ac.il
Selected Projects
Publications[dblp] Multi-Robot Motion Planning for Unit Discs with Revolving Areas In 33rd International Symposium on Algorithms and Computation (ISAAC 2022) [arXiv] Refined Hardness of Distance-Optimal Multi-Agent Path Finding In 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022) Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold Under review [arXiv] On Two-Handed Planar Assembly Partitioning with Connectivity Constraints In 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) Videos: [25 minute summary] [Extended talk on algorithmic results] [Extended talk on hardness] Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores In 2019 IEEE International Conference on Automation Science and Engineering (CASE 2019) Teaching
|