FRINK Linked Data Fragments server

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

• W3113075130 endingPage "5938" @default.
• W3113075130 startingPage "5926" @default.
• W3113075130 abstract "Task scheduling of multiple UAVs has become a highly active area of research in recent years. Previous research has generally solved the problem in a whole manner, which makes it hard to efficiently generate high-quality task scheduling schemes due to prohibitive computational complexity. By contrast, the paper constructs a novel divide and conquer framework for multi-UAV task scheduling (DCF), which partitions the original multi-UAV scheduling problem into multiple scheduling sub-problems for all the UAVs. To be specific, DCF includes two phases: one is the task allocation phase which produces multiple scheduling sub-problems and the other is the single UAV scheduling phase which generates the scheduling scheme with sequential tasks for each single UAV considering constraints involving UAV capabilities and task demands. Two phases are iteratively performed until the predefined stopping criteria are met. In the task allocation phase, we propose a tabu-list-based simulated annealing (SATL) algorithm to realize task allocation among multiple UAVs. After obtaining the task allocation scheme, a satisfactory scheduling scheme of each single UAV is generated by variable neighborhood descent (VND) algorithm. Extensive experiments and comparative studies are conducted, demonstrating the efficiency of DCF and the proposed SATL-VND algorithm." @default.
• W3113075130 created "2020-12-21" @default.
• W3113075130 creator A5001266925 @default.
• W3113075130 creator A5003799782 @default.
• W3113075130 creator A5009105404 @default.
• W3113075130 creator A5017886286 @default.
• W3113075130 creator A5030897972 @default.
• W3113075130 creator A5047617538 @default.
• W3113075130 creator A5052534111 @default.
• W3113075130 date "2021-09-01" @default.
• W3113075130 modified "2023-10-10" @default.
• W3113075130 title "An Iterative Two-Phase Optimization Method Based on Divide and Conquer Framework for Integrated Scheduling of Multiple UAVs" @default.
• W3113075130 cites W1944845718 @default.
• W3113075130 cites W1968408857 @default.
• W3113075130 cites W1969888410 @default.
• W3113075130 cites W1980088782 @default.
• W3113075130 cites W1982828967 @default.
• W3113075130 cites W1984463987 @default.
• W3113075130 cites W1992868085 @default.
• W3113075130 cites W1995450389 @default.
• W3113075130 cites W2007423183 @default.
• W3113075130 cites W2010334716 @default.
• W3113075130 cites W2020053523 @default.
• W3113075130 cites W2024060531 @default.
• W3113075130 cites W2026122809 @default.
• W3113075130 cites W2029309869 @default.
• W3113075130 cites W2040678783 @default.
• W3113075130 cites W2050637876 @default.
• W3113075130 cites W2076422387 @default.
• W3113075130 cites W2086163307 @default.
• W3113075130 cites W2095574706 @default.
• W3113075130 cites W2100931887 @default.
• W3113075130 cites W2101363262 @default.
• W3113075130 cites W2116048200 @default.
• W3113075130 cites W2137064582 @default.
• W3113075130 cites W2140405352 @default.
• W3113075130 cites W2162757410 @default.
• W3113075130 cites W2167428023 @default.
• W3113075130 cites W2175885421 @default.
• W3113075130 cites W2204362653 @default.
• W3113075130 cites W2269151999 @default.
• W3113075130 cites W2468293808 @default.
• W3113075130 cites W2530887753 @default.
• W3113075130 cites W2545630289 @default.
• W3113075130 cites W2770316064 @default.
• W3113075130 cites W2790522942 @default.
• W3113075130 cites W2790930275 @default.
• W3113075130 cites W2793872863 @default.
• W3113075130 cites W2797487617 @default.
• W3113075130 cites W2798633067 @default.
• W3113075130 cites W2802483125 @default.
• W3113075130 cites W2803012509 @default.
• W3113075130 cites W2808396632 @default.
• W3113075130 cites W2886699371 @default.
• W3113075130 cites W2889171665 @default.
• W3113075130 cites W2898556730 @default.
• W3113075130 cites W2907117055 @default.
• W3113075130 cites W2911442729 @default.
• W3113075130 cites W2921047495 @default.
• W3113075130 cites W2927378423 @default.
• W3113075130 cites W2934819496 @default.
• W3113075130 cites W2944499591 @default.
• W3113075130 cites W2948752861 @default.
• W3113075130 cites W2963624642 @default.
• W3113075130 cites W2963813097 @default.
• W3113075130 cites W2964015168 @default.
• W3113075130 cites W2968796284 @default.
• W3113075130 cites W2981601465 @default.
• W3113075130 cites W2999967064 @default.
• W3113075130 cites W3095686063 @default.
• W3113075130 doi "https://doi.org/10.1109/tits.2020.3042670" @default.
• W3113075130 hasPublicationYear "2021" @default.
• W3113075130 type Work @default.
• W3113075130 sameAs 3113075130 @default.
• W3113075130 citedByCount "26" @default.
• W3113075130 countsByYear W31130751302021 @default.
• W3113075130 countsByYear W31130751302022 @default.
• W3113075130 countsByYear W31130751302023 @default.
• W3113075130 crossrefType "journal-article" @default.
• W3113075130 hasAuthorship W3113075130A5001266925 @default.
• W3113075130 hasAuthorship W3113075130A5003799782 @default.
• W3113075130 hasAuthorship W3113075130A5009105404 @default.
• W3113075130 hasAuthorship W3113075130A5017886286 @default.
• W3113075130 hasAuthorship W3113075130A5030897972 @default.
• W3113075130 hasAuthorship W3113075130A5047617538 @default.
• W3113075130 hasAuthorship W3113075130A5052534111 @default.
• W3113075130 hasConcept C107568181 @default.
• W3113075130 hasConcept C11413529 @default.
• W3113075130 hasConcept C119948110 @default.
• W3113075130 hasConcept C120314980 @default.
• W3113075130 hasConcept C122141398 @default.
• W3113075130 hasConcept C126255220 @default.
• W3113075130 hasConcept C126980161 @default.
• W3113075130 hasConcept C127413603 @default.
• W3113075130 hasConcept C127456818 @default.
• W3113075130 hasConcept C175154964 @default.
• W3113075130 hasConcept C175893541 @default.
• W3113075130 hasConcept C201995342 @default.

• next