{"id":"W3113075130","doi":"10.1109/tits.2020.3042670","title":"An Iterative Two-Phase Optimization Method Based on Divide and Conquer Framework for Integrated Scheduling of Multiple UAVs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Hunan Province; Natural Science Foundation for Distinguished Young Scholars of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Divide and conquer algorithms; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; Simulated annealing; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Round-robin scheduling; Two-level scheduling; Distributed computing; Task analysis; Mathematical optimization; Algorithm; Task (project management); Quality of service; Computer network; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009412196,0.001124319,0.001252246,0.0007772653,0.0007936077,0.0006861165,0.001613029,0.0009062712,0.002476364],"category_scores_gemma":[0.001309422,0.0005787853,0.0008634626,0.0009420333,0.0005347385,0.0007061869,0.0009892758,0.001125764,0.0003239157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008794437,"about_ca_system_score_gemma":0.002232451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01121266,"about_ca_topic_score_gemma":0.01134165,"domain_scores_codex":[0.9995096,0.0001401404,0.00002127017,0.00009480608,0.0001553754,0.00007875193],"domain_scores_gemma":[0.9996021,0.0001991016,0.00004403766,0.00002285472,0.0001040775,0.00002780478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008524428,0.00007137957,0.0003997867,0.00009958047,0.00004669665,0.00006490252,0.00008588935,0.9214293,0.002884383,0.008691761,0.001537614,0.06460341],"study_design_scores_gemma":[0.0000144722,0.00002464708,0.0000244865,0.000002134216,0.00000456837,0.000006359069,0.000006386248,0.9983936,0.0002230767,0.0008664618,0.0004313818,0.0000023635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00472814,0.00015797,0.9929695,0.00008197393,0.0000285968,0.00007421961,0.00001571183,0.0002513774,0.00169248],"genre_scores_gemma":[0.217278,0.0002606375,0.7784135,0.0001281129,0.00005272869,0.0005900148,0.0001451885,0.0001518317,0.002979905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01121266,"threshold_uncertainty_score":0.02229476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05373984037427283,"score_gpt":0.3436975526496964,"score_spread":0.2899577122754236,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}