Aakash Aakash
Papers
2
Total Citations
8
H-Index
2
About
Aakash Aakash is a rising researcher in multi-robot systems, focusing on the critical challenge of goal assignment—the problem of efficiently allocating unique goals to robots to optimize mission performance. His work tackles two fundamental optimization objectives: minimizing total movement cost and minimizing the maximum individual robot cost (makespan). In his highly cited 2022 paper, "It Costs to Get Costs!", Aakash introduced a heuristic-based scalable algorithm that dramatically reduces the computational burden of calculating robot-goal pair costs, a major bottleneck in state-of-the-art solutions. Building on this, his 2024 work, "Optimal Makespan in a Minute Timespan!", presents a novel algorithm that achieves near-optimal makespan minimization with unprecedented speed, demonstrating that complex multi-robot coordination can be solved in minutes. With over 8 citations across his early publications, Aakash’s contributions are already shaping the field of scalable multi-robot coordination. His algorithms promise to enable real-time deployment of large robot teams in time-critical applications like disaster response and warehouse automation, marking him as a key innovator in practical multi-agent systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2