Igor Potapov

Papers

Total Citations

H-Index

About

Igor Potapov is a computer scientist whose research lies at the intersection of theoretical computer science, game theory, and robotics. His primary focus is on the decidability and complexity of **robot games**—two-player vector addition games played on integer lattices. Potapov has made significant contributions by establishing fundamental undecidability results for these games, such as in his 2016 paper "Undecidability of Two-dimensional Robot Games" (5 citations), which demonstrates that even in low-dimensional settings, certain strategic problems have no algorithmic solution. He has also explored the boundaries of decidability, as seen in his 2019 work "On decidability and complexity of low-dimensional robot games" (5 citations), and has analyzed games of degree two (2015, 4 citations). Beyond robot games, Potapov has tackled the challenge of **uniform online spherical tessellations** (2022, 2 citations), which has applications in generating uniform rotations for robotics and computer graphics. His most recent work, "Collision-Free Robot Scheduling" (2024, 2 citations), addresses practical scheduling problems in multi-robot systems. With a career marked by deep theoretical insights and practical implications, Potapov’s research has garnered attention for its rigor and relevance to autonomous systems.