Max Robotics — Global Service Robot Directory + US Certification

About

Binay Bhattacharya is a pioneering researcher in computational geometry and robotics, with a focus on path planning, surveillance, and visibility problems in two-dimensional environments. His work addresses fundamental challenges in autonomous navigation, particularly for robots operating in polygonal spaces. In his seminal 1988 paper, "Solving the two-dimensional findpath problem using a line-triangle representation of the robot," Bhattacharya introduced an efficient approach to robot motion planning, laying groundwork for later advances in geometric algorithms. His 2009 study on surveillance of polygonal areas by a mobile searcher equipped with a flashlight proposed an O(n)-time algorithm for testing searchability from the boundary, a critical contribution to security and monitoring applications. Earlier, in 1987, he tackled the NP-hard problem of planning optimal viewpoints and navigation routes for patrol robots, developing two heuristic approaches with O(N² log N) complexity. Though his citation counts are modest—reflecting the specialized nature of his work—Bhattacharya’s research has influenced subsequent generations of algorithms in computational geometry and robotics, particularly in visibility-based pursuit-evasion and autonomous patrol systems.