Abstract
Retrieval tasks are a form of search task where a robot must explore, find an object, and return with it as quickly as possible. Recent work in ergodic control has demonstrated time-optimal path planning for search tasks where visitation is proportionally matched, within some tolerance, to a given target distribution. However, these planners minimize the duration of a full deterministic search, while retrieval missions end their search at an unknown point in the trajectory and must return to a given base. In this work, we propose a new formulation of the time-optimal ergodic search problem that models detection as a Poisson process and minimizes total mission time by including the return phase in the objective. Experimental results show that time-optimal ergodic retrieval (TOER) achieves up to $19\%$ shorter mission durations relative to ergodic baselines and that this advantage grows as the return phase becomes more costly. Simulation and hardware implementations validate TOER's compatibility with environments of non-convex geometry as well as both 2D and 3D search domains.
Abstract (translated)
URL
https://arxiv.org/abs/2610.21823
