Abstract
We address the terminating exploration problem where a team of k autonomous robots explores a grid such that each node of the grid is visited at least once and all robots stop moving when the task is completed. Robots considered for the task are anonymous, asynchronous, oblivious and non-communicating that have unlimited visibility and a pebble each. Visiting a node more than once by the robots during exploration is a waste of energy due to energy constraints. In this work we aim at minimizing the total number of wasteful repeated visits of the nodes that occur during exploration. Our proposed algorithm explores a grid with minimum repeated visits of nodes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
