{"id":"W1903400936","doi":"10.5555/1999416.1999495","title":"Multi-hop shortest path computation for rotary wing search and rescue","year":2010,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Dijkstra's algorithm; Shortest path problem; Computer science; Measure (data warehouse); Component (thermodynamics); Heuristic; Position (finance); Computation; Asset (computer security); Mathematical optimization; Graph; Computer security; Algorithm; Data mining; Mathematics; Artificial intelligence; Theoretical computer science; Business; Finance","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000535228,0.0002435514,0.0002560299,0.0001809379,0.0002923622,0.0004545293,0.000560953,0.0001344107,0.000004093323],"category_scores_gemma":[0.00006683425,0.0002496106,0.00005708996,0.0002481196,0.0000854085,0.0007312265,0.0002977053,0.0003435726,0.00001536553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000205934,"about_ca_system_score_gemma":0.0001231886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007733667,"about_ca_topic_score_gemma":0.00002337484,"domain_scores_codex":[0.9980602,0.0001007089,0.0003774747,0.0007297139,0.0003298169,0.0004020616],"domain_scores_gemma":[0.9982028,0.0005756331,0.00006721709,0.000461467,0.0005082647,0.000184594],"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.000008825432,0.00006663771,0.005894748,0.00002500784,0.00002108545,0.000009920695,0.001418972,0.8200785,0.001299916,0.002019815,0.00005790681,0.1690987],"study_design_scores_gemma":[0.0007161216,0.00009178952,0.05856374,0.00004425667,0.000007006981,0.00000997275,0.00001352126,0.9397413,0.0001031663,0.0002931439,0.0001321399,0.0002838998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08859901,0.00001921421,0.9092166,0.0003496238,0.00102134,0.0005166212,0.000009379369,0.0002473028,0.00002095714],"genre_scores_gemma":[0.5288367,9.479413e-7,0.4708251,0.0001338935,0.0001410224,0.00001160333,0.00002350045,0.00001058731,0.00001661037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4402377,"threshold_uncertainty_score":0.9999956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08654303871478089,"score_gpt":0.33829699668379,"score_spread":0.2517539579690091,"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."}}