Competitive Ant Coverage: The Value of Pursuit
Alon Shats,Michael Amir,Noa Agmon,Alon Shats,Michael Amir,Noa Agmon
This paper studies the problem of Competitive Ant Coverage, in which two ant-like robots with very limited capabilities in terms of sensing range, computational power, and knowledge of the world compete in an area coverage task. We examine two variants of the problem that differ in the robot's objective: either being the First to Cover a Cell (FCC), or being the Last to Cover a Cell (LCC). Each ro...
