FRINK Linked Data Fragments server

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

• W2340707983 abstract "Environments for algorithms can be categorized as static or dynamic.A static environment remains stationary throughout the execution of the algorithm, while in a dynamic environment the environment changes during the execution of the algorithm.The algorithms for planning in static and dynamic environments can be divided into offline and online algorithms.This research implements an online algorithm for an unknown environment and combined exploration and planning in a hybrid architecture. A simulated system of agents based on swarm intelligence is presented for route optimization and exploration.Two versions of the system are implemented and compared for performance- i.e., a simulated ant agent system and a simulated niche based particle swarm optimization. A simulated ant agent system is presented to address the issues involved during route planning in dynamic and unknown environments cluttered with obstacles and objects. A simulated ant agent system (SAAS) is proposed using a modified ant colony optimization algorithm for dealing with online route planning. The SAAS generates and optimizes routes in complex and large environments with constraints.The traditional route optimization techniques focus on good solutions only and do not exploit the solution space completely. The SAAS is shown to be an efficient technique for providing safe, short, and feasible routes under dynamic constraints, and its efficiency has been tested in a mine field simulation with different environment configurations.It is capable of tracking a stationary as well as a non-stationary goal and performs equally well as compared to moving target search algorithm.Route planning for dynamic environment is further extended by using another optimization technique for generation of multiple routes.Simulated niche based particle swarm has been used for dynamic online route planning, optimization of the routes, and it has proved to be an effective technique. It efficiently deals with route planning in dynamic and unknown environments cluttered with obstacles and objects.A simulated niche based particle swarm optimization (SN-PSO) is proposed using a modified particle swarm optimization algorithm for dealing with online route planning. The SN-PSO generates and optimizes multiple routes in complex and large environments with constraints. The SN-PSO is shown to be an efficient technique for providing safe, short,and feasible routes under dynamic constraints. The efficiency of the SN-PSO is tested in a mine field simulation with different environment configuration, and it successfully generates multiple feasible routes. Finally, the swarm based techniques are further compared with an evolutionary algorithm (genetic algorithm) for performance and scalability. Statistical results showed that evolutionary techniques perform well in less cluttered environments and their performance degrades with the increase in environment complexity. For small size maps, the evolutionary technique performs well but its efficiency decreases with an increase in map size." @default.
• W2340707983 created "2016-06-24" @default.
• W2340707983 creator A5040956147 @default.
• W2340707983 date "2010-01-01" @default.
• W2340707983 modified "2023-09-24" @default.
• W2340707983 title "Optimization of Route Planning for Dynamic Environments using Swarm Intelligence" @default.
• W2340707983 cites W1484032198 @default.
• W2340707983 cites W1493007304 @default.
• W2340707983 cites W1526455201 @default.
• W2340707983 cites W1558110925 @default.
• W2340707983 cites W1575742541 @default.
• W2340707983 cites W1834054188 @default.
• W2340707983 cites W1839803698 @default.
• W2340707983 cites W1918036644 @default.
• W2340707983 cites W1982738050 @default.
• W2340707983 cites W2015057142 @default.
• W2340707983 cites W2021061679 @default.
• W2340707983 cites W2075269412 @default.
• W2340707983 cites W2095896604 @default.
• W2340707983 cites W2096360021 @default.
• W2340707983 cites W2098883008 @default.
• W2340707983 cites W2099087485 @default.
• W2340707983 cites W2099241421 @default.
• W2340707983 cites W2101938656 @default.
• W2340707983 cites W2106389684 @default.
• W2340707983 cites W2107667896 @default.
• W2340707983 cites W2122410182 @default.
• W2340707983 cites W2133164528 @default.
• W2340707983 cites W2133847135 @default.
• W2340707983 cites W2141428000 @default.
• W2340707983 cites W2141736308 @default.
• W2340707983 cites W2142053997 @default.
• W2340707983 cites W2144341408 @default.
• W2340707983 cites W2149869860 @default.
• W2340707983 cites W2153491565 @default.
• W2340707983 cites W2164894164 @default.
• W2340707983 cites W2388776976 @default.
• W2340707983 cites W256487942 @default.
• W2340707983 cites W3145128584 @default.
• W2340707983 cites W3205840287 @default.
• W2340707983 cites W70974423 @default.
• W2340707983 cites W797950765 @default.
• W2340707983 cites W155679744 @default.
• W2340707983 hasPublicationYear "2010" @default.
• W2340707983 type Work @default.
• W2340707983 sameAs 2340707983 @default.
• W2340707983 citedByCount "0" @default.
• W2340707983 crossrefType "dissertation" @default.
• W2340707983 hasAuthorship W2340707983A5040956147 @default.
• W2340707983 hasConcept C11413529 @default.
• W2340707983 hasConcept C119487961 @default.
• W2340707983 hasConcept C120314980 @default.
• W2340707983 hasConcept C126255220 @default.
• W2340707983 hasConcept C154945302 @default.
• W2340707983 hasConcept C165696696 @default.
• W2340707983 hasConcept C181335050 @default.
• W2340707983 hasConcept C33923547 @default.
• W2340707983 hasConcept C38652104 @default.
• W2340707983 hasConcept C40128228 @default.
• W2340707983 hasConcept C41008148 @default.
• W2340707983 hasConcept C85617194 @default.
• W2340707983 hasConceptScore W2340707983C11413529 @default.
• W2340707983 hasConceptScore W2340707983C119487961 @default.
• W2340707983 hasConceptScore W2340707983C120314980 @default.
• W2340707983 hasConceptScore W2340707983C126255220 @default.
• W2340707983 hasConceptScore W2340707983C154945302 @default.
• W2340707983 hasConceptScore W2340707983C165696696 @default.
• W2340707983 hasConceptScore W2340707983C181335050 @default.
• W2340707983 hasConceptScore W2340707983C33923547 @default.
• W2340707983 hasConceptScore W2340707983C38652104 @default.
• W2340707983 hasConceptScore W2340707983C40128228 @default.
• W2340707983 hasConceptScore W2340707983C41008148 @default.
• W2340707983 hasConceptScore W2340707983C85617194 @default.
• W2340707983 hasLocation W23407079831 @default.
• W2340707983 hasOpenAccess W2340707983 @default.
• W2340707983 hasPrimaryLocation W23407079831 @default.
• W2340707983 hasRelatedWork W1887263241 @default.
• W2340707983 hasRelatedWork W1964347690 @default.
• W2340707983 hasRelatedWork W1974580787 @default.
• W2340707983 hasRelatedWork W1987701655 @default.
• W2340707983 hasRelatedWork W2025683290 @default.
• W2340707983 hasRelatedWork W2066999838 @default.
• W2340707983 hasRelatedWork W2146220723 @default.
• W2340707983 hasRelatedWork W2166879968 @default.
• W2340707983 hasRelatedWork W2170590337 @default.
• W2340707983 hasRelatedWork W2175021764 @default.
• W2340707983 hasRelatedWork W2348406386 @default.
• W2340707983 hasRelatedWork W2349261395 @default.
• W2340707983 hasRelatedWork W2349378223 @default.
• W2340707983 hasRelatedWork W2359453592 @default.
• W2340707983 hasRelatedWork W2376991057 @default.
• W2340707983 hasRelatedWork W2594834420 @default.
• W2340707983 hasRelatedWork W2772851359 @default.
• W2340707983 hasRelatedWork W2884533410 @default.
• W2340707983 hasRelatedWork W2945589255 @default.
• W2340707983 hasRelatedWork W2994067546 @default.
• W2340707983 isParatext "false" @default.
• W2340707983 isRetracted "false" @default.
• W2340707983 magId "2340707983" @default.
• W2340707983 workType "dissertation" @default.