Pages that link to "Item:Q975538"

The following pages link to Anonymous graph exploration without collision by mobile robots (Q975538):

Displaying 8 items.

• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
• Uniform multi-agent deployment on a ring (Q627178) (← links)
• Optimal torus exploration by oblivious robots (Q2218466) (← links)
• Collision-free network exploration (Q2396820) (← links)
• Grid exploration by a swarm of autonomous robots with minimum repetitions (Q2676467) (← links)
• Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality (Q6052703) (← links)
• Efficient live exploration of a dynamic ring with mobile robots (Q6069843) (← links)