{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004059137,0.0002750366,0.0004018822,0.0002449952,0.0001679536,0.0001278761,0.0002905405,0.0001463523,0.000009979914],"category_scores_gemma":[0.00003849572,0.0002643291,0.0001144982,0.0005483094,0.00004470807,0.000405598,2.951684e-7,0.0002733454,0.000003287222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004600261,"about_ca_system_score_gemma":0.00008334877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006566361,"about_ca_topic_score_gemma":0.000005060986,"domain_scores_codex":[0.9978189,0.0002480467,0.0007415338,0.0006196707,0.0003552398,0.0002166438],"domain_scores_gemma":[0.9978163,0.001007892,0.0002743796,0.0003239993,0.0003611047,0.0002163503],"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.0002360225,0.0002600295,0.00004296875,0.0001046008,0.00005660991,0.000004176383,0.004406356,0.9858553,0.0009690158,0.001702186,0.000002244836,0.006360429],"study_design_scores_gemma":[0.001245799,0.001020439,0.00001097225,0.000322801,0.00005138266,0.000001366958,0.0005511905,0.9529729,0.04351332,0.00004942838,0.00002579067,0.0002345799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002381273,0.00002464329,0.9950935,0.0002333642,0.0006565705,0.00104064,0.0003443587,0.0002205771,0.000005033877],"genre_scores_gemma":[0.5369636,0.000003524743,0.4626877,0.0001255278,0.00002541104,0.0001157492,0.00005774396,0.00001769598,0.000002990078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5345824,"threshold_uncertainty_score":0.9999809,"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."}}