Back to Search
Start Over
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
- Source :
- Lecture Notes in Computer Science ISBN: 9783540877783, DISC
- Publication Year :
- 2008
- Publisher :
- Spirnger - LNCS, 2008.
-
Abstract
- Graph exploration by robots. The graph exploration problem consists in making one or several mobile entities visit each vertex of a connected graph. The mobile entities are sometimes called agents or robots (in the following we use the word "robot"). The exploration is perpetual if the robots have to revisit forever each vertex of the graph. Perpetual exploration is required when robots have to move to gather continuously evolving information or to look for dynamic resources (resources whose location changes with time). If nodes and edges have unique labels, the exploration is relatively easy to achieve.
Details
- Language :
- English
- ISBN :
- 978-3-540-87778-3
- ISBNs :
- 9783540877783
- Database :
- OpenAIRE
- Journal :
- Lecture Notes in Computer Science ISBN: 9783540877783, DISC
- Accession number :
- edsair.doi.dedup.....3075c3e320a4f5e75770c12577421070