Toshinori Sakuma
Papers
2
Total Citations
11
H-Index
2
About
Toshinori Sakuma is a Japanese mathematician whose research lies at the intersection of computational geometry, combinatorial optimization, and motion planning. His most recognized work, "How to Collect Balls Moving in the Euclidean Plane" (2004, 6 citations), addresses a fundamental problem in multi-robot systems: how to efficiently collect multiple moving targets using a limited number of robots constrained to straight-line paths through the origin. Unlike classical problems such as the Moving-Target Traveling Salesman Problem, Sakuma’s framework accounts for the possibility that not all balls can be caught, introducing practical constraints for real-world robotics and surveillance. His follow-up paper (2006, 5 citations) refines these models, exploring variations in robot speed and ball velocity. Though his citation counts are modest, Sakuma’s work is notable for its theoretical elegance and direct applicability to automated logistics, drone interception, and search-and-rescue operations. His contributions offer a rigorous foundation for researchers tackling dynamic collection problems in Euclidean spaces, making him a respected figure in algorithmic geometry and autonomous systems.
Research Focus
Key Achievements
Top Papers
- 1How to Collect Balls Moving in the Euclidean Plane6 citations · 2004
- 2How to collect balls moving in the Euclidean plane5 citations · 2006