FRINK Linked Data Fragments server

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

• W3156705536 endingPage "1427" @default.
• W3156705536 startingPage "1415" @default.
• W3156705536 abstract "Most of the previous studies on mobile robot path planning consider the obstacles as polygons. However, the complex shaped obstacles should be considered as curves rather than polygons, since the latter may result in non-optimal paths. Three new algorithms are proposed for finding the shortest path of a mobile robot among curved obstacles: TAD which uses a ta ngent d rawing method, TRAD which uses tra pezoidal d ecomposition, and TAD-TRAD which uses a combination of the TAD and the TRAD algorithms. The time complexities of the TAD algorithm, the TRAD algorithm, and the TAD-TRAD algorithm are O ( n 3 log n ) , O ( n log n ) , and O ( n ( log n ) 2 ) respectively, where n is the total number of arcs in all the obstacles. The TAD and the TAD-TRAD algorithms compute an optimal shortest path, whereas the TRAD algorithm computes an approximate shortest path, among curved obstacles. The TAD algorithm has a lower time complexity than existing algorithms which are implemented for the computation of the optimal shortest path. The TRAD algorithm has a lower time complexity than existing algorithms which compute an approximate shortest path and the TAD-TRAD algorithm has a lower time complexity than existing algorithms which compute an optimal shortest path. The experimental comparison of the TAD, TRAD, and TAD-TRAD algorithms on 200 randomly generated problems shows that the TAD-TRAD algorithm has the least running time. Moreover, the TAD-TRAD algorithm computes an optimal path using a lesser number of tangents and with lesser time complexity when experimental comparisons are performed with existing algorithms in the literature." @default.
• W3156705536 created "2021-04-26" @default.
• W3156705536 creator A5055954355 @default.
• W3156705536 date "2021-12-01" @default.
• W3156705536 modified "2023-09-27" @default.
• W3156705536 title "Path planning of a mobile robot among curved obstacles through tangent drawing and trapezoidal decomposition" @default.
• W3156705536 cites W1482503584 @default.
• W3156705536 cites W1514632510 @default.
• W3156705536 cites W1970675441 @default.
• W3156705536 cites W1971771315 @default.
• W3156705536 cites W1985010089 @default.
• W3156705536 cites W2029668981 @default.
• W3156705536 cites W2029867396 @default.
• W3156705536 cites W2040904149 @default.
• W3156705536 cites W2051831392 @default.
• W3156705536 cites W2058510050 @default.
• W3156705536 cites W2063244634 @default.
• W3156705536 cites W2095340803 @default.
• W3156705536 cites W2130647774 @default.
• W3156705536 cites W2147097381 @default.
• W3156705536 cites W2165414070 @default.
• W3156705536 cites W2167427782 @default.
• W3156705536 cites W2565603695 @default.
• W3156705536 cites W2998786991 @default.
• W3156705536 cites W3016164434 @default.
• W3156705536 cites W3092929793 @default.
• W3156705536 cites W4236246360 @default.
• W3156705536 doi "https://doi.org/10.1016/j.jestch.2021.03.002" @default.
• W3156705536 hasPublicationYear "2021" @default.
• W3156705536 type Work @default.
• W3156705536 sameAs 3156705536 @default.
• W3156705536 citedByCount "2" @default.
• W3156705536 countsByYear W31567055362022 @default.
• W3156705536 crossrefType "journal-article" @default.
• W3156705536 hasAuthorship W3156705536A5055954355 @default.
• W3156705536 hasBestOaLocation W31567055361 @default.
• W3156705536 hasConcept C124681953 @default.
• W3156705536 hasConcept C138187205 @default.
• W3156705536 hasConcept C154945302 @default.
• W3156705536 hasConcept C18903297 @default.
• W3156705536 hasConcept C19966478 @default.
• W3156705536 hasConcept C2524010 @default.
• W3156705536 hasConcept C2777735758 @default.
• W3156705536 hasConcept C31258907 @default.
• W3156705536 hasConcept C33923547 @default.
• W3156705536 hasConcept C41008148 @default.
• W3156705536 hasConcept C81074085 @default.
• W3156705536 hasConcept C86803240 @default.
• W3156705536 hasConcept C90509273 @default.
• W3156705536 hasConceptScore W3156705536C124681953 @default.
• W3156705536 hasConceptScore W3156705536C138187205 @default.
• W3156705536 hasConceptScore W3156705536C154945302 @default.
• W3156705536 hasConceptScore W3156705536C18903297 @default.
• W3156705536 hasConceptScore W3156705536C19966478 @default.
• W3156705536 hasConceptScore W3156705536C2524010 @default.
• W3156705536 hasConceptScore W3156705536C2777735758 @default.
• W3156705536 hasConceptScore W3156705536C31258907 @default.
• W3156705536 hasConceptScore W3156705536C33923547 @default.
• W3156705536 hasConceptScore W3156705536C41008148 @default.
• W3156705536 hasConceptScore W3156705536C81074085 @default.
• W3156705536 hasConceptScore W3156705536C86803240 @default.
• W3156705536 hasConceptScore W3156705536C90509273 @default.
• W3156705536 hasIssue "6" @default.
• W3156705536 hasLocation W31567055361 @default.
• W3156705536 hasOpenAccess W3156705536 @default.
• W3156705536 hasPrimaryLocation W31567055361 @default.
• W3156705536 hasRelatedWork W1499301849 @default.
• W3156705536 hasRelatedWork W1539483014 @default.
• W3156705536 hasRelatedWork W1962141875 @default.
• W3156705536 hasRelatedWork W1975263927 @default.
• W3156705536 hasRelatedWork W2092035070 @default.
• W3156705536 hasRelatedWork W2137520303 @default.
• W3156705536 hasRelatedWork W2279406337 @default.
• W3156705536 hasRelatedWork W2348519242 @default.
• W3156705536 hasRelatedWork W2361912042 @default.
• W3156705536 hasRelatedWork W3204725017 @default.
• W3156705536 hasVolume "24" @default.
• W3156705536 isParatext "false" @default.
• W3156705536 isRetracted "false" @default.
• W3156705536 magId "3156705536" @default.
• W3156705536 workType "article" @default.