Searching with Two-Speed Autonomous Mobile Robots

Abstract

We introduce and study various search problems using mobile robots. Specifically we study the problems of exploration and patrolling using a new two-speed model of robots, as well as studying the problems of rendezvous and evacuation using a more traditional one-speed model of mobile robots. The problems are executed on a continuous finite domain by a swarm of n robots r 1 , r 2 , . . . , r n . For the two-speed model, each robot r i has a walking speed w i and a searching speed s i , where s i < w i . At each moment a