Matches in SemOpenAlex for { <https://semopenalex.org/work/W2951869939> ?p ?o ?g. }
Showing items 1 to 85 of
85
with 100 items per page.
- W2951869939 abstract "We consider a team of {em autonomous weak robots} that are endowed with visibility sensors and motion actuators. Autonomous means that the team cannot rely on any kind of central coordination mechanism or scheduler. By weak we mean that the robots are devoid of (1) any (observable) IDs allowing to differentiate them (anonymous), (2) means of communication allowing them to communicate directly, and (3) any way to remember any previous observation nor computation performed in any previous step (oblivious). Robots asynchronously operate in cycles of three phases: Look, Compute, and Move. Furthermore, the network is an anonymous unoriented grid. In such settings, the robots must collaborate to solve a collective task, here the terminating grid exploration (exploration for short), despite being limited with respect to input from the environment, asymmetry, memory, etc. Exploration requires that robots explore the grid and stop when the task is complete. We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration of a grid shaped network by a team of $k$ asynchronous oblivious robots in the fully asynchronous and non-atomic model, so called CORDA. In more details, we first assume the ATOM model in which each Look-Compute-Move cycle execution is executed atomically, ie every robot that is activated at instant t instantaneously executes a full cycle between t and t+1. ATOM being strictly stronger than CORDA, all impossibility results in ATOM also hold in CORDA. We show that it is impossible to explore a grid of at least three nodes with less than three robots in ATOM. (This first result holds for both deterministic and probabilistic settings.) Next, we show that it is impossible to deterministically explore a (2,2)-Grid with less than 4 robots, and a (3,3)-Grid with less than 5 robots, respectively. Then, we propose deterministic algorithms in CORDA to exhibit the optimal number of robots allowing to explore of a given grid. Our results show that except in two particular cases, 3 robots are necessary and sufficient to deterministically explore a grid of at least three nodes. The optimal number of robots for the two remaining cases is: 4 for the (2,2)-Grid and 5 for the (3,3)-Grid." @default.
- W2951869939 created "2019-06-27" @default.
- W2951869939 creator A5002817720 @default.
- W2951869939 creator A5004285781 @default.
- W2951869939 creator A5043476646 @default.
- W2951869939 creator A5072850029 @default.
- W2951869939 creator A5073883755 @default.
- W2951869939 date "2011-05-12" @default.
- W2951869939 modified "2023-09-30" @default.
- W2951869939 title "Optimal grid exploration by asynchronous oblivious robots" @default.
- W2951869939 cites W1554917931 @default.
- W2951869939 cites W1560980585 @default.
- W2951869939 cites W1561673518 @default.
- W2951869939 cites W1975531816 @default.
- W2951869939 cites W1983586118 @default.
- W2951869939 cites W2003806956 @default.
- W2951869939 cites W2086960916 @default.
- W2951869939 cites W2108943074 @default.
- W2951869939 cites W2144182788 @default.
- W2951869939 cites W2950900164 @default.
- W2951869939 cites W2088139309 @default.
- W2951869939 hasPublicationYear "2011" @default.
- W2951869939 type Work @default.
- W2951869939 sameAs 2951869939 @default.
- W2951869939 citedByCount "1" @default.
- W2951869939 countsByYear W29518699392016 @default.
- W2951869939 crossrefType "posted-content" @default.
- W2951869939 hasAuthorship W2951869939A5002817720 @default.
- W2951869939 hasAuthorship W2951869939A5004285781 @default.
- W2951869939 hasAuthorship W2951869939A5043476646 @default.
- W2951869939 hasAuthorship W2951869939A5072850029 @default.
- W2951869939 hasAuthorship W2951869939A5073883755 @default.
- W2951869939 hasConcept C120314980 @default.
- W2951869939 hasConcept C127413603 @default.
- W2951869939 hasConcept C151319957 @default.
- W2951869939 hasConcept C154945302 @default.
- W2951869939 hasConcept C187691185 @default.
- W2951869939 hasConcept C201995342 @default.
- W2951869939 hasConcept C2524010 @default.
- W2951869939 hasConcept C2780451532 @default.
- W2951869939 hasConcept C31258907 @default.
- W2951869939 hasConcept C33923547 @default.
- W2951869939 hasConcept C41008148 @default.
- W2951869939 hasConcept C80444323 @default.
- W2951869939 hasConcept C90509273 @default.
- W2951869939 hasConceptScore W2951869939C120314980 @default.
- W2951869939 hasConceptScore W2951869939C127413603 @default.
- W2951869939 hasConceptScore W2951869939C151319957 @default.
- W2951869939 hasConceptScore W2951869939C154945302 @default.
- W2951869939 hasConceptScore W2951869939C187691185 @default.
- W2951869939 hasConceptScore W2951869939C201995342 @default.
- W2951869939 hasConceptScore W2951869939C2524010 @default.
- W2951869939 hasConceptScore W2951869939C2780451532 @default.
- W2951869939 hasConceptScore W2951869939C31258907 @default.
- W2951869939 hasConceptScore W2951869939C33923547 @default.
- W2951869939 hasConceptScore W2951869939C41008148 @default.
- W2951869939 hasConceptScore W2951869939C80444323 @default.
- W2951869939 hasConceptScore W2951869939C90509273 @default.
- W2951869939 hasLocation W29518699391 @default.
- W2951869939 hasOpenAccess W2951869939 @default.
- W2951869939 hasPrimaryLocation W29518699391 @default.
- W2951869939 hasRelatedWork W1494314796 @default.
- W2951869939 hasRelatedWork W1554917931 @default.
- W2951869939 hasRelatedWork W1620697861 @default.
- W2951869939 hasRelatedWork W1696966082 @default.
- W2951869939 hasRelatedWork W1849948963 @default.
- W2951869939 hasRelatedWork W2086960916 @default.
- W2951869939 hasRelatedWork W2091969952 @default.
- W2951869939 hasRelatedWork W2093596574 @default.
- W2951869939 hasRelatedWork W2105366160 @default.
- W2951869939 hasRelatedWork W2296734119 @default.
- W2951869939 hasRelatedWork W2341715933 @default.
- W2951869939 hasRelatedWork W2552134270 @default.
- W2951869939 hasRelatedWork W2757417530 @default.
- W2951869939 hasRelatedWork W2904103455 @default.
- W2951869939 hasRelatedWork W2912263388 @default.
- W2951869939 hasRelatedWork W2912649667 @default.
- W2951869939 hasRelatedWork W3000038828 @default.
- W2951869939 hasRelatedWork W3003575917 @default.
- W2951869939 hasRelatedWork W3210999774 @default.
- W2951869939 hasRelatedWork W627224437 @default.
- W2951869939 isParatext "false" @default.
- W2951869939 isRetracted "false" @default.
- W2951869939 magId "2951869939" @default.
- W2951869939 workType "article" @default.