Near-optimal search-and-rescue path planning for a moving target

AbstractDiscrete search and rescue path planning for a moving target problem is computationally hard. Despite heuristic methods proposed so far, for which efficiency is further plagued by random ep...