SemOpenAlex |

SemOpenAlex

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2111972027> ?p ?o ?g. }

Showing items 1 to 96 of 96 with 100 items per page.

W2111972027 endingPage "717" @default.
W2111972027 startingPage "707" @default.
W2111972027 abstract "In this paper, we present an algorithm for the exploration of an unknown graph by multiple robots, which is never worse than depth-first search with a single robot. On trees, we prove that the algorithm is optimal for two robots. For k robots, the algorithm has an optimal dependence on the size of the tree but not on its radius. We believe that the algorithm performs well on any tree, and this is substantiated by simulations. For trees with e edges and radius r, the exploration time is less than 2e/k + (1 + (k/r)) k-1 (2/k!)r k-1 = (2e/k) + O((k + r) k-1 ) (for r >; k, <; (2e/k) + 2r k-1 ), thereby improving a recent method with time O((e/logk) + r) [2], and almost reaching the lower bound max((2e/k), 2r). The model underlying undirected-graph exploration is a set of rooms connected by opaque passages; thus, the algorithm is appropriate for scenarios like indoor navigation or cave exploration. In this framework, communication can be realized by bookkeeping devices being dropped by the robots at explored vertices, the states of which are read and changed by further visiting robots. Simulations have been performed in both tree and graph explorations to corroborate the mathematical results." @default.
W2111972027 created "2016-06-24" @default.
W2111972027 creator A5016217504 @default.
W2111972027 creator A5021293894 @default.
W2111972027 creator A5032830800 @default.
W2111972027 creator A5046644183 @default.
W2111972027 date "2011-08-01" @default.
W2111972027 modified "2023-10-06" @default.
W2111972027 title "Multirobot Tree and Graph Exploration" @default.
W2111972027 cites W1598083251 @default.
W2111972027 cites W1873892361 @default.
W2111972027 cites W1965155276 @default.
W2111972027 cites W1966213627 @default.
W2111972027 cites W1979924144 @default.
W2111972027 cites W1992876208 @default.
W2111972027 cites W2000600164 @default.
W2111972027 cites W2008110774 @default.
W2111972027 cites W2023182928 @default.
W2111972027 cites W2050185335 @default.
W2111972027 cites W2060743393 @default.
W2111972027 cites W2071941627 @default.
W2111972027 cites W2075002099 @default.
W2111972027 cites W2080745503 @default.
W2111972027 cites W2089269509 @default.
W2111972027 cites W2096782697 @default.
W2111972027 cites W2107667896 @default.
W2111972027 cites W2126572568 @default.
W2111972027 cites W2128740072 @default.
W2111972027 cites W2149619235 @default.
W2111972027 cites W2149735608 @default.
W2111972027 cites W2149888497 @default.
W2111972027 cites W2789274216 @default.
W2111972027 cites W3136290985 @default.
W2111972027 doi "https://doi.org/10.1109/tro.2011.2121170" @default.
W2111972027 hasPublicationYear "2011" @default.
W2111972027 type Work @default.
W2111972027 sameAs 2111972027 @default.
W2111972027 citedByCount "83" @default.
W2111972027 countsByYear W21119720272012 @default.
W2111972027 countsByYear W21119720272013 @default.
W2111972027 countsByYear W21119720272014 @default.
W2111972027 countsByYear W21119720272015 @default.
W2111972027 countsByYear W21119720272016 @default.
W2111972027 countsByYear W21119720272017 @default.
W2111972027 countsByYear W21119720272018 @default.
W2111972027 countsByYear W21119720272019 @default.
W2111972027 countsByYear W21119720272020 @default.
W2111972027 countsByYear W21119720272021 @default.
W2111972027 countsByYear W21119720272022 @default.
W2111972027 countsByYear W21119720272023 @default.
W2111972027 crossrefType "journal-article" @default.
W2111972027 hasAuthorship W2111972027A5016217504 @default.
W2111972027 hasAuthorship W2111972027A5021293894 @default.
W2111972027 hasAuthorship W2111972027A5032830800 @default.
W2111972027 hasAuthorship W2111972027A5046644183 @default.
W2111972027 hasConcept C113174947 @default.
W2111972027 hasConcept C11413529 @default.
W2111972027 hasConcept C114614502 @default.
W2111972027 hasConcept C118615104 @default.
W2111972027 hasConcept C132525143 @default.
W2111972027 hasConcept C154945302 @default.
W2111972027 hasConcept C33923547 @default.
W2111972027 hasConcept C41008148 @default.
W2111972027 hasConcept C80444323 @default.
W2111972027 hasConcept C90509273 @default.
W2111972027 hasConceptScore W2111972027C113174947 @default.
W2111972027 hasConceptScore W2111972027C11413529 @default.
W2111972027 hasConceptScore W2111972027C114614502 @default.
W2111972027 hasConceptScore W2111972027C118615104 @default.
W2111972027 hasConceptScore W2111972027C132525143 @default.
W2111972027 hasConceptScore W2111972027C154945302 @default.
W2111972027 hasConceptScore W2111972027C33923547 @default.
W2111972027 hasConceptScore W2111972027C41008148 @default.
W2111972027 hasConceptScore W2111972027C80444323 @default.
W2111972027 hasConceptScore W2111972027C90509273 @default.
W2111972027 hasIssue "4" @default.
W2111972027 hasLocation W21119720271 @default.
W2111972027 hasOpenAccess W2111972027 @default.
W2111972027 hasPrimaryLocation W21119720271 @default.
W2111972027 hasRelatedWork W1527576459 @default.
W2111972027 hasRelatedWork W1596060973 @default.
W2111972027 hasRelatedWork W1978042415 @default.
W2111972027 hasRelatedWork W2365333639 @default.
W2111972027 hasRelatedWork W2365371251 @default.
W2111972027 hasRelatedWork W2386767533 @default.
W2111972027 hasRelatedWork W2582950667 @default.
W2111972027 hasRelatedWork W2622512907 @default.
W2111972027 hasRelatedWork W3003396734 @default.
W2111972027 hasRelatedWork W4214740985 @default.
W2111972027 hasVolume "27" @default.
W2111972027 isParatext "false" @default.
W2111972027 isRetracted "false" @default.
W2111972027 magId "2111972027" @default.
W2111972027 workType "article" @default.