{"id":"W2766504869","doi":"10.1007/s10846-017-0729-9","title":"A Global Path Planning Algorithm for Fixed-wing UAVs","year":2017,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Dijkstra's algorithm; Delaunay triangulation; Motion planning; Genetic algorithm; Any-angle path planning; Mathematical optimization; Path (computing); Algorithm; Shortest path problem; Yen's algorithm; Computer science; Voronoi diagram; Partition (number theory); Mathematics; Artificial intelligence; Theoretical computer science; Robot; Graph","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002061883,0.000342313,0.000821098,0.0001915137,0.0006202258,0.001372255,0.003135846,0.0001656864,0.000002063744],"category_scores_gemma":[0.0006178469,0.0002824253,0.0003911144,0.000166492,0.00007486678,0.0009824224,0.0003008318,0.0002826105,0.00002529259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000369434,"about_ca_system_score_gemma":0.000287354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007673749,"about_ca_topic_score_gemma":4.068315e-7,"domain_scores_codex":[0.9965894,0.0001352475,0.001323234,0.0004161035,0.0008753442,0.0006607224],"domain_scores_gemma":[0.9953973,0.0003553969,0.002171915,0.001065998,0.0006543403,0.0003550177],"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.00003965714,0.0002905237,0.01179798,0.000248016,0.000704545,0.001653408,0.002069442,0.7861764,0.00008768542,0.006276973,0.01265789,0.1779974],"study_design_scores_gemma":[0.0006425139,0.0005117246,0.002826571,0.00157074,0.00006548478,0.002322792,0.0004084593,0.9888261,0.00009859265,0.0006306269,0.001735121,0.0003612951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006656559,0.00202273,0.9847888,0.0003096146,0.01130042,0.000383449,0.00000767204,0.00006374345,0.0004579546],"genre_scores_gemma":[0.219304,0.00003924066,0.7776998,0.0001026647,0.002356821,0.00002091221,0.000002353349,0.00003797995,0.0004362168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2186384,"threshold_uncertainty_score":0.9999628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05097427091060251,"score_gpt":0.325032863588882,"score_spread":0.2740585926782795,"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."}}