FRINK Linked Data Fragments server

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

• W4378575239 endingPage "525" @default.
• W4378575239 startingPage "525" @default.
• W4378575239 abstract "Path planning is an important area of mobile robot research, and the ant colony optimization algorithm is essential for analyzing path planning. However, the current ant colony optimization algorithm applied to the path planning of mobile robots still has some limitations, including early blind search, slow convergence speed, and more turns. To overcome these problems, an improved ant colony optimization algorithm is proposed in this paper. In the improved algorithm, we introduce the idea of triangle inequality and a pseudo-random state transfer strategy to enhance the guidance of target points and improve the search efficiency and quality of the algorithm. In addition, we propose a pheromone update strategy based on the partition method with upper and lower limits on the pheromone concentration. This can not only improve the global search capability and convergence speed of the algorithm but also avoid the premature and stagnation phenomenon of the algorithm during the search. To prevent the ants from getting into a deadlock state, we introduce a backtracking mechanism to enable the ants to explore the solution space better. Finally, to verify the effectiveness of the proposed algorithm, the algorithm is compared with 11 existing methods for solving the robot path planning problem, including several ACO variants and two commonly used algorithms (A* algorithm and Dijkstra algorithm), and the experimental results show that the improved ACO algorithm can plan paths with faster convergence, shorter path lengths, and higher smoothness. Specifically, the algorithm produces the shortest path length with a standard deviation of zero while ensuring the most rapid convergence and the highest smoothness in the case of the shortest path in four different grid environments. These experimental results demonstrate the effectiveness of the proposed algorithm in path planning." @default.
• W4378575239 created "2023-05-28" @default.
• W4378575239 creator A5030154211 @default.
• W4378575239 creator A5062578677 @default.
• W4378575239 creator A5069591874 @default.
• W4378575239 date "2023-05-27" @default.
• W4378575239 modified "2023-09-30" @default.
• W4378575239 title "Application of Ant Colony Optimization Algorithm Based on Triangle Inequality Principle and Partition Method Strategy in Robot Path Planning" @default.
• W4378575239 cites W2037254789 @default.
• W4378575239 cites W2169528473 @default.
• W4378575239 cites W2341882575 @default.
• W4378575239 cites W2417637069 @default.
• W4378575239 cites W2515498963 @default.
• W4378575239 cites W2604760770 @default.
• W4378575239 cites W2799726513 @default.
• W4378575239 cites W2883776918 @default.
• W4378575239 cites W2895647709 @default.
• W4378575239 cites W2914554382 @default.
• W4378575239 cites W2938380935 @default.
• W4378575239 cites W2939018330 @default.
• W4378575239 cites W2963020936 @default.
• W4378575239 cites W2979454253 @default.
• W4378575239 cites W2994888514 @default.
• W4378575239 cites W2997061791 @default.
• W4378575239 cites W3013773102 @default.
• W4378575239 cites W3018311626 @default.
• W4378575239 cites W3020990685 @default.
• W4378575239 cites W3022788820 @default.
• W4378575239 cites W3045728165 @default.
• W4378575239 cites W3082345457 @default.
• W4378575239 cites W3090845105 @default.
• W4378575239 cites W3094467512 @default.
• W4378575239 cites W3126326857 @default.
• W4378575239 cites W3135798356 @default.
• W4378575239 cites W3176039641 @default.
• W4378575239 cites W3198400168 @default.
• W4378575239 cites W3206987089 @default.
• W4378575239 cites W3214031934 @default.
• W4378575239 cites W4200589899 @default.
• W4378575239 cites W4229622957 @default.
• W4378575239 cites W4291898573 @default.
• W4378575239 cites W4292883535 @default.
• W4378575239 doi "https://doi.org/10.3390/axioms12060525" @default.
• W4378575239 hasPublicationYear "2023" @default.
• W4378575239 type Work @default.
• W4378575239 citedByCount "2" @default.
• W4378575239 countsByYear W43785752392023 @default.
• W4378575239 crossrefType "journal-article" @default.
• W4378575239 hasAuthorship W4378575239A5030154211 @default.
• W4378575239 hasAuthorship W4378575239A5062578677 @default.
• W4378575239 hasAuthorship W4378575239A5069591874 @default.
• W4378575239 hasBestOaLocation W43785752391 @default.
• W4378575239 hasConcept C11413529 @default.
• W4378575239 hasConcept C126255220 @default.
• W4378575239 hasConcept C132525143 @default.
• W4378575239 hasConcept C154945302 @default.
• W4378575239 hasConcept C162324750 @default.
• W4378575239 hasConcept C173870130 @default.
• W4378575239 hasConcept C199360897 @default.
• W4378575239 hasConcept C19966478 @default.
• W4378575239 hasConcept C22590252 @default.
• W4378575239 hasConcept C2777303404 @default.
• W4378575239 hasConcept C2777735758 @default.
• W4378575239 hasConcept C33923547 @default.
• W4378575239 hasConcept C40128228 @default.
• W4378575239 hasConcept C41008148 @default.
• W4378575239 hasConcept C50522688 @default.
• W4378575239 hasConcept C80444323 @default.
• W4378575239 hasConcept C81074085 @default.
• W4378575239 hasConcept C90509273 @default.
• W4378575239 hasConceptScore W4378575239C11413529 @default.
• W4378575239 hasConceptScore W4378575239C126255220 @default.
• W4378575239 hasConceptScore W4378575239C132525143 @default.
• W4378575239 hasConceptScore W4378575239C154945302 @default.
• W4378575239 hasConceptScore W4378575239C162324750 @default.
• W4378575239 hasConceptScore W4378575239C173870130 @default.
• W4378575239 hasConceptScore W4378575239C199360897 @default.
• W4378575239 hasConceptScore W4378575239C19966478 @default.
• W4378575239 hasConceptScore W4378575239C22590252 @default.
• W4378575239 hasConceptScore W4378575239C2777303404 @default.
• W4378575239 hasConceptScore W4378575239C2777735758 @default.
• W4378575239 hasConceptScore W4378575239C33923547 @default.
• W4378575239 hasConceptScore W4378575239C40128228 @default.
• W4378575239 hasConceptScore W4378575239C41008148 @default.
• W4378575239 hasConceptScore W4378575239C50522688 @default.
• W4378575239 hasConceptScore W4378575239C80444323 @default.
• W4378575239 hasConceptScore W4378575239C81074085 @default.
• W4378575239 hasConceptScore W4378575239C90509273 @default.
• W4378575239 hasIssue "6" @default.
• W4378575239 hasLocation W43785752391 @default.
• W4378575239 hasLocation W43785752392 @default.
• W4378575239 hasOpenAccess W4378575239 @default.
• W4378575239 hasPrimaryLocation W43785752391 @default.
• W4378575239 hasRelatedWork W1539483014 @default.
• W4378575239 hasRelatedWork W167762660 @default.
• W4378575239 hasRelatedWork W2008125884 @default.
• W4378575239 hasRelatedWork W2092305811 @default.
• W4378575239 hasRelatedWork W2381327266 @default.

• next