{"id":"W2092305811","doi":"10.1109/icuas.2014.6842250","title":"Optimal flight path planning for UAVs in 3-D threat environment","year":2014,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Concordia University; Northwestern Polytechnical University; Northwestern University","keywords":"Dijkstra's algorithm; Motion planning; Path (computing); Computer science; Shortest path problem; Battlefield; Node (physics); Real-time computing; A* search algorithm; Field (mathematics); Mathematical optimization; Artificial intelligence; Algorithm; Computer network; Engineering; Graph; Mathematics; Theoretical computer science; Robot","routes":{"ca_aff":true,"ca_fund":true,"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.0003384717,0.0001350329,0.0001685486,0.00008276423,0.00006695874,0.00006671515,0.0005562369,0.00005972061,0.000009208157],"category_scores_gemma":[0.00003033748,0.0001152639,0.00004173855,0.00008440495,0.00002014346,0.0002066504,0.0001549534,0.00008790771,0.00007460796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004911827,"about_ca_system_score_gemma":0.00001585533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001140341,"about_ca_topic_score_gemma":1.543484e-7,"domain_scores_codex":[0.9988039,0.00003764583,0.0002007185,0.0004029429,0.0001923746,0.0003624704],"domain_scores_gemma":[0.9992552,0.0001854363,0.00004801358,0.0004220249,0.000008110378,0.00008123335],"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.00002467716,0.0002609605,0.01759425,0.00004208576,0.00003141698,0.00008846692,0.004170135,0.8452626,0.001027303,0.05403242,0.007213403,0.07025229],"study_design_scores_gemma":[0.0005157055,0.0001510625,0.006743151,0.00002783509,0.000002244037,0.00001070553,0.00002202796,0.9854815,0.0007295412,0.0008596911,0.005264145,0.0001923865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006320194,0.00005510252,0.9894878,0.0004656829,0.0002003748,0.0001838238,9.756858e-7,0.0001152124,0.003170793],"genre_scores_gemma":[0.09602959,0.000002591042,0.9029341,0.0002399078,0.00007953544,0.00004549854,0.000003910691,0.00001009202,0.0006547489],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1402189,"threshold_uncertainty_score":0.4700326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01911637598982072,"score_gpt":0.245084396015424,"score_spread":0.2259680200256033,"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."}}