Researchers built a "ghost mode" for robots that calculates the exact path to sneak around without being seen.
arXiv · March 18, 2026 · 2603.16510
The Takeaway
While most robot pathfinding focuses on speed or battery life, this study introduces the concept of 'Minimum Exposure,' which calculates paths that minimize the time a robot spends in open, uncovered areas. It provides a mathematical framework for how autonomous machines can 'sneak' through an environment.
From the abstract
We investigate multiple fundamental variants of the classic coordinated motion planning (CMP) problem for unit square robots in the plane under the $L_1$ metric. In coordinated motion planning, we are given two arrangements of $k$ robots and are tasked with finding a movement schedule that minimizes a certain objective function. The two most prominent objective functions are the sum of distances traveled (Min-Sum) and the latest time of arrival (Min-Makespan). Both objectives have previously bee