V. S. Anil Kumar

Papers

Total Citations

H-Index

About

V. S. Anil Kumar is a leading researcher in algorithmic graph theory and constrained robotics, whose work has fundamentally advanced our understanding of how autonomous agents navigate unknown environments under resource limitations. His most influential contribution, the 2006 paper "Optimal constrained graph exploration" (72 citations), tackles the critical challenge of exploring unknown graphs with tethered robots or fuel-constrained agents. In this seminal work, Kumar and his co-authors develop optimal strategies for robots that can only traverse edges while tethered to a base station or operating with limited fuel capacity—a problem with direct applications to planetary rovers, search-and-rescue operations, and network exploration. By establishing tight bounds on exploration time and distance traveled, his research provides the theoretical foundation for designing efficient autonomous systems that must balance exploration coverage against severe energy or connectivity constraints. Kumar's work bridges theoretical computer science and practical robotics, offering elegant algorithmic solutions that continue to influence modern research in mobile agent computing, graph exploration, and resource-aware path planning. His contributions remain essential reading for anyone studying autonomous navigation in constrained environments.