Somnath Kundu

Papers

Total Citations

H-Index

About

Somnath Kundu is a researcher in theoretical computer science, with a focus on multi-robot coordination, online algorithms, and geometric search problems. His work addresses fundamental challenges in evacuation and exploration scenarios, often involving unit-speed robots operating under limited communication or adversarial conditions. In his highly cited paper "Evacuating from ℓ unit disks in the wireless model" (9 citations), Kundu develops strategies for robots to efficiently escape from a set of disks, a problem with direct applications to disaster response and autonomous systems. He is perhaps best known for his breakthrough in "Lower Bounds for Shoreline Searching with 2 or More Robots" (8 citations), where he dramatically improved the competitive ratio lower bound for two robots searching for a line—a classic online problem dating back to the 1950s—from 1.5993 to 3, settling a long-standing open question. His work on "Makespan Trade-Offs for Visiting Triangle Edges" (4 and 2 citations) further explores vehicle routing-type problems, designing optimal trajectories for fleets of robots to visit all edges of a triangle with minimal makespan. Kundu’s contributions lie at the intersection of geometry, distributed algorithms, and optimization, offering both theoretical depth and practical insights for multi-agent systems.