{"id":"W4382050786","doi":"10.1109/icuas57906.2023.10155790","title":"Hierarchical Cooperative Assignment Algorithm (CAA) for mission and path planning of multiple fixed-wing UAVs based on maximum independent sets","year":2023,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Motion planning; Computer science; Task (project management); Probabilistic logic; Graph; Assignment problem; Path (computing); Trajectory; Mathematical optimization; Any-angle path planning; Optimization problem; Algorithm; Artificial intelligence; Robot; Theoretical computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.0007457024,0.0002328077,0.0003120269,0.000245611,0.0002316849,0.00009766405,0.0004159001,0.0001202916,0.000006015086],"category_scores_gemma":[0.0002192651,0.000189937,0.00006586754,0.0003609531,0.00005119644,0.0001743488,0.0002480472,0.0002233566,0.000009274117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006249342,"about_ca_system_score_gemma":0.000116158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001604376,"about_ca_topic_score_gemma":2.460167e-7,"domain_scores_codex":[0.9978431,0.0001326045,0.0003525946,0.0006292926,0.0005962071,0.0004462267],"domain_scores_gemma":[0.9980732,0.001141685,0.0001145618,0.0003795117,0.00008566848,0.0002054374],"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.0001864462,0.0006299035,0.00870468,0.0002408079,0.0001344098,0.0005158259,0.006289909,0.6102827,0.01081322,0.001784085,0.007611357,0.3528067],"study_design_scores_gemma":[0.001427434,0.0005656347,0.006068184,0.0002100499,0.00000555824,0.00000729698,0.0001524441,0.9855143,0.00521606,0.0003633148,0.0002379941,0.0002317304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01165686,0.00002064938,0.9862829,0.000670487,0.0003299671,0.0005246485,0.00004341606,0.000246719,0.0002242994],"genre_scores_gemma":[0.2898329,0.000002640447,0.7093307,0.0003168496,0.00005146877,0.00005314311,0.00005089279,0.00002493064,0.0003365012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3752316,"threshold_uncertainty_score":0.7745407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03998960154851777,"score_gpt":0.2984802032903826,"score_spread":0.2584906017418648,"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."}}