{"id":"W2911442729","doi":"10.1016/j.ast.2019.01.061","title":"An iterative strategy for task assignment and path planning of distributed multiple unmanned aerial vehicles","year":2019,"lang":"en","type":"article","venue":"Aerospace Science and Technology","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"China Scholarship Council","keywords":"Motion planning; Computer science; Computation; Task (project management); Distributed computing; Path (computing); Iterative and incremental development; Process (computing); Drone; Computational complexity theory; Stability (learning theory); Range (aeronautics); Real-time computing; Artificial intelligence; Engineering; Systems engineering; Algorithm; Machine learning; Robot; Computer network","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.0005908779,0.0008267928,0.0006957186,0.0006594153,0.0007003022,0.0005932078,0.001371242,0.0007219322,0.002007427],"category_scores_gemma":[0.001865453,0.0004557658,0.0005688277,0.0006893622,0.0005860913,0.0007452501,0.001430862,0.0006582757,0.000370687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000753816,"about_ca_system_score_gemma":0.00171249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01262617,"about_ca_topic_score_gemma":0.01263663,"domain_scores_codex":[0.999536,0.0001072682,0.00002129515,0.00007854468,0.0001848156,0.00007198357],"domain_scores_gemma":[0.9994403,0.0002331693,0.00004914293,0.0000480921,0.000181258,0.00004816807],"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.0001432143,0.0001024454,0.0004387879,0.0001024198,0.00005307164,0.0001474193,0.0002675879,0.7934228,0.01032133,0.01618508,0.002124164,0.1766917],"study_design_scores_gemma":[0.00001587112,0.00005445024,0.00007911213,0.000004220519,0.000007275883,0.00001897164,0.0000167589,0.9954298,0.0008449672,0.002921924,0.000600326,0.00000635066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009350142,0.00004233061,0.9881439,0.00003154625,0.00001771558,0.00006314007,0.00001963303,0.0001985706,0.002132989],"genre_scores_gemma":[0.3969212,0.00009797089,0.5991367,0.0000688917,0.00002238325,0.0003694281,0.0001441473,0.0001000676,0.00313932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01262617,"threshold_uncertainty_score":0.02510536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01517029528720818,"score_gpt":0.2711193924361123,"score_spread":0.2559490971489041,"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."}}