Matches in SemOpenAlex for { <https://semopenalex.org/work/W4385681461> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W4385681461 abstract "The Dijkstra algorithm is a classic path planning method, which in a discrete graph space, can start from a specified source node and find the shortest path between the source node and all other nodes in the graph. However, to the best of our knowledge, there is no effective method that achieves a function similar to that of the Dijkstra's algorithm in a continuous space. In this study, an optimal path planning algorithm called convex dissection topology (CDT)-Dijkstra is developed, which can quickly compute the global optimal path from one point to all other points in a 2D continuous space. CDT-Dijkstra is mainly divided into two stages: SetInit and GetGoal. In SetInit, the algorithm can quickly obtain the optimal CDT encoding set of all the cut lines based on the initial point x_{init}. In GetGoal, the algorithm can return the global optimal path of any goal point at an extremely high speed. In this study, we propose and prove the planning principle of considering only the points on the cutlines, thus reducing the state space of the distance optimal path planning task from 2D to 1D. In addition, we propose a fast method to find the optimal path in a homogeneous class and theoretically prove the correctness of the method. Finally, by testing in a series of environments, the experimental results demonstrate that CDT-Dijkstra not only plans the optimal path from all points at once, but also has a significant advantage over advanced algorithms considering certain complex tasks." @default.
- W4385681461 created "2023-08-09" @default.
- W4385681461 creator A5011367029 @default.
- W4385681461 creator A5019060617 @default.
- W4385681461 creator A5032575179 @default.
- W4385681461 creator A5033487036 @default.
- W4385681461 creator A5037286379 @default.
- W4385681461 creator A5067483347 @default.
- W4385681461 date "2023-08-06" @default.
- W4385681461 modified "2023-10-16" @default.
- W4385681461 title "CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in 2D Continuous Space" @default.
- W4385681461 doi "https://doi.org/10.48550/arxiv.2308.03026" @default.
- W4385681461 hasPublicationYear "2023" @default.
- W4385681461 type Work @default.
- W4385681461 citedByCount "0" @default.
- W4385681461 crossrefType "posted-content" @default.
- W4385681461 hasAuthorship W4385681461A5011367029 @default.
- W4385681461 hasAuthorship W4385681461A5019060617 @default.
- W4385681461 hasAuthorship W4385681461A5032575179 @default.
- W4385681461 hasAuthorship W4385681461A5033487036 @default.
- W4385681461 hasAuthorship W4385681461A5037286379 @default.
- W4385681461 hasAuthorship W4385681461A5067483347 @default.
- W4385681461 hasBestOaLocation W43856814611 @default.
- W4385681461 hasConcept C103578098 @default.
- W4385681461 hasConcept C11413529 @default.
- W4385681461 hasConcept C114614502 @default.
- W4385681461 hasConcept C119971455 @default.
- W4385681461 hasConcept C126255220 @default.
- W4385681461 hasConcept C132525143 @default.
- W4385681461 hasConcept C154945302 @default.
- W4385681461 hasConcept C158485040 @default.
- W4385681461 hasConcept C173870130 @default.
- W4385681461 hasConcept C184720557 @default.
- W4385681461 hasConcept C199360897 @default.
- W4385681461 hasConcept C22590252 @default.
- W4385681461 hasConcept C25321074 @default.
- W4385681461 hasConcept C2777735758 @default.
- W4385681461 hasConcept C33923547 @default.
- W4385681461 hasConcept C41008148 @default.
- W4385681461 hasConcept C55439883 @default.
- W4385681461 hasConcept C70266271 @default.
- W4385681461 hasConcept C80444323 @default.
- W4385681461 hasConcept C81074085 @default.
- W4385681461 hasConcept C90509273 @default.
- W4385681461 hasConcept C98779529 @default.
- W4385681461 hasConceptScore W4385681461C103578098 @default.
- W4385681461 hasConceptScore W4385681461C11413529 @default.
- W4385681461 hasConceptScore W4385681461C114614502 @default.
- W4385681461 hasConceptScore W4385681461C119971455 @default.
- W4385681461 hasConceptScore W4385681461C126255220 @default.
- W4385681461 hasConceptScore W4385681461C132525143 @default.
- W4385681461 hasConceptScore W4385681461C154945302 @default.
- W4385681461 hasConceptScore W4385681461C158485040 @default.
- W4385681461 hasConceptScore W4385681461C173870130 @default.
- W4385681461 hasConceptScore W4385681461C184720557 @default.
- W4385681461 hasConceptScore W4385681461C199360897 @default.
- W4385681461 hasConceptScore W4385681461C22590252 @default.
- W4385681461 hasConceptScore W4385681461C25321074 @default.
- W4385681461 hasConceptScore W4385681461C2777735758 @default.
- W4385681461 hasConceptScore W4385681461C33923547 @default.
- W4385681461 hasConceptScore W4385681461C41008148 @default.
- W4385681461 hasConceptScore W4385681461C55439883 @default.
- W4385681461 hasConceptScore W4385681461C70266271 @default.
- W4385681461 hasConceptScore W4385681461C80444323 @default.
- W4385681461 hasConceptScore W4385681461C81074085 @default.
- W4385681461 hasConceptScore W4385681461C90509273 @default.
- W4385681461 hasConceptScore W4385681461C98779529 @default.
- W4385681461 hasLocation W43856814611 @default.
- W4385681461 hasOpenAccess W4385681461 @default.
- W4385681461 hasPrimaryLocation W43856814611 @default.
- W4385681461 hasRelatedWork W2008125884 @default.
- W4385681461 hasRelatedWork W2352589493 @default.
- W4385681461 hasRelatedWork W2375280931 @default.
- W4385681461 hasRelatedWork W2387829241 @default.
- W4385681461 hasRelatedWork W2734981231 @default.
- W4385681461 hasRelatedWork W2810620529 @default.
- W4385681461 hasRelatedWork W2978166001 @default.
- W4385681461 hasRelatedWork W3183360588 @default.
- W4385681461 hasRelatedWork W4253588386 @default.
- W4385681461 hasRelatedWork W4281943708 @default.
- W4385681461 isParatext "false" @default.
- W4385681461 isRetracted "false" @default.
- W4385681461 workType "article" @default.