FRINK Linked Data Fragments server

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

• W2579187612 endingPage "680" @default.
• W2579187612 startingPage "663" @default.
• W2579187612 abstract "This paper deals with the path planning problem of a team of mobile robots, in order to cover an area of interest, with prior-defined obstacles. For the single robot case, also known as single robot coverage path planning (CPP), an 𝓞(n) optimal methodology has already been proposed and evaluated in the literature, where n is the grid size. The majority of existing algorithms for the multi robot case (mCPP), utilize the aforementioned algorithm. Due to the complexity, however, of the mCPP, the best the existing mCPP algorithms can perform is at most 16 times the optimal solution, in terms of time needed for the robot team to accomplish the coverage task, while the time required for calculating the solution is polynomial. In the present paper, we propose a new algorithm which converges to the optimal solution, at least in cases where one exists. The proposed technique transforms the original integer programming problem (mCPP) into several single-robot problems (CPP), the solutions of which constitute the optimal mCPP solution, alleviating the original mCPP explosive combinatorial complexity. Although it is not possible to analytically derive bounds regarding the complexity of the proposed algorithm, extensive numerical analysis indicates that the complexity is bounded by polynomial curves for practical sized inputs. In the heart of the proposed approach lies the DARP algorithm, which divides the terrain into a number of equal areas each corresponding to a specific robot, so as to guarantee complete coverage, non-backtracking solution, minimum coverage path, while at the same time does not need any preparatory stage (video demonstration and standalone application are available on-line http://tinyurl.com/DARP-app )." @default.
• W2579187612 created "2017-01-26" @default.
• W2579187612 creator A5046634751 @default.
• W2579187612 creator A5071596476 @default.
• W2579187612 creator A5072311081 @default.
• W2579187612 date "2017-01-20" @default.
• W2579187612 modified "2023-10-10" @default.
• W2579187612 title "DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning" @default.
• W2579187612 cites W1513400187 @default.
• W2579187612 cites W1544032329 @default.
• W2579187612 cites W171569338 @default.
• W2579187612 cites W1873425142 @default.
• W2579187612 cites W1959261928 @default.
• W2579187612 cites W1967005434 @default.
• W2579187612 cites W1968154520 @default.
• W2579187612 cites W1969161726 @default.
• W2579187612 cites W2000146415 @default.
• W2579187612 cites W2000296729 @default.
• W2579187612 cites W2000769684 @default.
• W2579187612 cites W2012806873 @default.
• W2579187612 cites W2019738489 @default.
• W2579187612 cites W2032443917 @default.
• W2579187612 cites W2041547034 @default.
• W2579187612 cites W2063472265 @default.
• W2579187612 cites W2065978712 @default.
• W2579187612 cites W2076406387 @default.
• W2579187612 cites W2092266073 @default.
• W2579187612 cites W2097002253 @default.
• W2579187612 cites W2097830422 @default.
• W2579187612 cites W2110362031 @default.
• W2579187612 cites W2112374372 @default.
• W2579187612 cites W2144827113 @default.
• W2579187612 cites W2150593711 @default.
• W2579187612 cites W2156117406 @default.
• W2579187612 cites W2163947939 @default.
• W2579187612 cites W2164948897 @default.
• W2579187612 cites W2168966637 @default.
• W2579187612 cites W2169345583 @default.
• W2579187612 cites W2951276827 @default.
• W2579187612 cites W3100386740 @default.
• W2579187612 cites W3158940377 @default.
• W2579187612 cites W1895618959 @default.
• W2579187612 doi "https://doi.org/10.1007/s10846-016-0461-x" @default.
• W2579187612 hasPublicationYear "2017" @default.
• W2579187612 type Work @default.
• W2579187612 sameAs 2579187612 @default.
• W2579187612 citedByCount "95" @default.
• W2579187612 countsByYear W25791876122017 @default.
• W2579187612 countsByYear W25791876122018 @default.
• W2579187612 countsByYear W25791876122019 @default.
• W2579187612 countsByYear W25791876122020 @default.
• W2579187612 countsByYear W25791876122021 @default.
• W2579187612 countsByYear W25791876122022 @default.
• W2579187612 countsByYear W25791876122023 @default.
• W2579187612 crossrefType "journal-article" @default.
• W2579187612 hasAuthorship W2579187612A5046634751 @default.
• W2579187612 hasAuthorship W2579187612A5071596476 @default.
• W2579187612 hasAuthorship W2579187612A5072311081 @default.
• W2579187612 hasBestOaLocation W25791876122 @default.
• W2579187612 hasConcept C11413529 @default.
• W2579187612 hasConcept C126255220 @default.
• W2579187612 hasConcept C154945302 @default.
• W2579187612 hasConcept C156884757 @default.
• W2579187612 hasConcept C179799912 @default.
• W2579187612 hasConcept C199360897 @default.
• W2579187612 hasConcept C19966478 @default.
• W2579187612 hasConcept C2777735758 @default.
• W2579187612 hasConcept C311688 @default.
• W2579187612 hasConcept C33923547 @default.
• W2579187612 hasConcept C41008148 @default.
• W2579187612 hasConcept C81074085 @default.
• W2579187612 hasConcept C90509273 @default.
• W2579187612 hasConceptScore W2579187612C11413529 @default.
• W2579187612 hasConceptScore W2579187612C126255220 @default.
• W2579187612 hasConceptScore W2579187612C154945302 @default.
• W2579187612 hasConceptScore W2579187612C156884757 @default.
• W2579187612 hasConceptScore W2579187612C179799912 @default.
• W2579187612 hasConceptScore W2579187612C199360897 @default.
• W2579187612 hasConceptScore W2579187612C19966478 @default.
• W2579187612 hasConceptScore W2579187612C2777735758 @default.
• W2579187612 hasConceptScore W2579187612C311688 @default.
• W2579187612 hasConceptScore W2579187612C33923547 @default.
• W2579187612 hasConceptScore W2579187612C41008148 @default.
• W2579187612 hasConceptScore W2579187612C81074085 @default.
• W2579187612 hasConceptScore W2579187612C90509273 @default.
• W2579187612 hasFunder F4320335254 @default.
• W2579187612 hasIssue "3-4" @default.
• W2579187612 hasLocation W25791876121 @default.
• W2579187612 hasLocation W25791876122 @default.
• W2579187612 hasOpenAccess W2579187612 @default.
• W2579187612 hasPrimaryLocation W25791876121 @default.
• W2579187612 hasRelatedWork W1904098742 @default.
• W2579187612 hasRelatedWork W1980828932 @default.
• W2579187612 hasRelatedWork W2001146265 @default.
• W2579187612 hasRelatedWork W2077416514 @default.
• W2579187612 hasRelatedWork W2106517143 @default.
• W2579187612 hasRelatedWork W2161428574 @default.
• W2579187612 hasRelatedWork W2170661558 @default.

• next