Alok Aggarwal

Papers

Total Citations

H-Index

About

Alok Aggarwal is a distinguished researcher whose work bridges theoretical computer science and practical robotics applications. His primary research areas include combinatorial optimization, computational geometry, and the algorithmic foundations of robotics. Aggarwal’s most notable contribution is his pioneering work on the Angular-Metric Traveling Salesman Problem (TSP), introduced in his highly cited 2000 paper (72 citations). In this work, he formulated a novel variant of the classic TSP that minimizes the total angular cost of a tour—the sum of direction changes at each point—rather than the traditional Euclidean distance. This problem is directly motivated by real-world robotics challenges, such as planning efficient paths for robots that must minimize turning angles to conserve energy or reduce mechanical wear. Aggarwal established the NP-hardness of this angular-metric TSP and its relaxations, providing a rigorous theoretical foundation that has influenced subsequent research in robot motion planning and path optimization. His work is widely recognized for its elegance and practical impact, offering a fresh perspective on a classic problem and inspiring further exploration into angle-based optimization. Aggarwal’s contributions continue to be a touchstone for researchers seeking to bridge algorithmic theory with tangible engineering challenges.