Matches in SemOpenAlex for { <https://semopenalex.org/work/W830551962> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W830551962 endingPage "250" @default.
- W830551962 startingPage "242" @default.
- W830551962 abstract "The coverage algorithm based on Boustrophedon path has been known to be the most efficient in places without or less obstacles If the map of an environmental area thru SLAM algorithm can be obtainable. However, the efficiency of the coverage algorithm based on Boustrophedon path drops drastically when obstacles are complex. In this paper, we propose and implement a new algorithm, which we call Group-k, that efficiently handles the complex area. The Group-k algorithm groups the obstacles and prioritizes the covering sequences with complex rank of the groups. Implementation-based experiments show about 20% improved performance when applying the nor- algorithm, compared to the Boustrophedon path algorithm." @default.
- W830551962 created "2016-06-24" @default.
- W830551962 creator A5005353883 @default.
- W830551962 creator A5057886975 @default.
- W830551962 date "2008-03-01" @default.
- W830551962 modified "2023-09-24" @default.
- W830551962 title "Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots" @default.
- W830551962 hasPublicationYear "2008" @default.
- W830551962 type Work @default.
- W830551962 sameAs 830551962 @default.
- W830551962 citedByCount "1" @default.
- W830551962 crossrefType "journal-article" @default.
- W830551962 hasAuthorship W830551962A5005353883 @default.
- W830551962 hasAuthorship W830551962A5057886975 @default.
- W830551962 hasConcept C11413529 @default.
- W830551962 hasConcept C154945302 @default.
- W830551962 hasConcept C178790620 @default.
- W830551962 hasConcept C185592680 @default.
- W830551962 hasConcept C2777735758 @default.
- W830551962 hasConcept C2781311116 @default.
- W830551962 hasConcept C31258907 @default.
- W830551962 hasConcept C41008148 @default.
- W830551962 hasConcept C90509273 @default.
- W830551962 hasConceptScore W830551962C11413529 @default.
- W830551962 hasConceptScore W830551962C154945302 @default.
- W830551962 hasConceptScore W830551962C178790620 @default.
- W830551962 hasConceptScore W830551962C185592680 @default.
- W830551962 hasConceptScore W830551962C2777735758 @default.
- W830551962 hasConceptScore W830551962C2781311116 @default.
- W830551962 hasConceptScore W830551962C31258907 @default.
- W830551962 hasConceptScore W830551962C41008148 @default.
- W830551962 hasConceptScore W830551962C90509273 @default.
- W830551962 hasIssue "2" @default.
- W830551962 hasLocation W8305519621 @default.
- W830551962 hasOpenAccess W830551962 @default.
- W830551962 hasPrimaryLocation W8305519621 @default.
- W830551962 hasRelatedWork W1544032329 @default.
- W830551962 hasRelatedWork W2034688899 @default.
- W830551962 hasRelatedWork W2041547034 @default.
- W830551962 hasRelatedWork W2084604427 @default.
- W830551962 hasRelatedWork W2103296723 @default.
- W830551962 hasRelatedWork W2105848344 @default.
- W830551962 hasRelatedWork W2116131295 @default.
- W830551962 hasRelatedWork W2122859855 @default.
- W830551962 hasRelatedWork W2130222542 @default.
- W830551962 hasRelatedWork W2142270784 @default.
- W830551962 hasRelatedWork W2170924750 @default.
- W830551962 hasRelatedWork W2201537380 @default.
- W830551962 hasRelatedWork W2391994909 @default.
- W830551962 hasRelatedWork W2539096940 @default.
- W830551962 hasRelatedWork W2562209965 @default.
- W830551962 hasRelatedWork W2582115406 @default.
- W830551962 hasRelatedWork W2911309285 @default.
- W830551962 hasRelatedWork W2949613486 @default.
- W830551962 hasRelatedWork W2119655362 @default.
- W830551962 hasRelatedWork W2369154545 @default.
- W830551962 hasVolume "13" @default.
- W830551962 isParatext "false" @default.
- W830551962 isRetracted "false" @default.
- W830551962 magId "830551962" @default.
- W830551962 workType "article" @default.