{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002130573,0.0005256024,0.0003026004,0.0004977913,0.0005839989,0.0003831555,0.0003918127,0.000469942,0.001063079],"category_scores_gemma":[0.000558604,0.0002583749,0.0004024931,0.0004518302,0.0004563422,0.0006977482,0.0004826385,0.0003291916,0.0001040594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006935314,"about_ca_system_score_gemma":0.001075489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0133036,"about_ca_topic_score_gemma":0.009230919,"domain_scores_codex":[0.999872,0.00003381037,0.000005665583,0.00003278971,0.00003124772,0.00002450709],"domain_scores_gemma":[0.9998766,0.00006068798,0.00001960049,0.000008827114,0.00002274938,0.00001155174],"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.00003314601,0.00001021089,0.0004434105,0.00003031953,0.000007679038,0.00009273821,0.00007269844,0.9648623,0.002586676,0.005316632,0.0004770901,0.0260672],"study_design_scores_gemma":[0.000004942684,0.00001618325,0.0001171921,0.00000252988,0.00000256401,0.00003309605,0.00002746516,0.9953453,0.0006267194,0.003245728,0.0005733775,0.000004778002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04245692,0.0002796552,0.9538857,0.0001471477,0.00002374413,0.00004330663,0.00005444569,0.0002044458,0.0029046],"genre_scores_gemma":[0.7456713,0.0003885056,0.2514079,0.00003916818,0.000009584212,0.00009869027,0.0001419558,0.00003773123,0.002205213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0133036,"threshold_uncertainty_score":0.02645236,"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."}}