{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004507612,0.000487239,0.0006221869,0.0009464236,0.0008155696,0.0007159461,0.0009942898,0.0007197669,0.002122716],"category_scores_gemma":[0.001961271,0.0003918204,0.000347448,0.001081101,0.0004537319,0.0009818869,0.0008124576,0.0004640086,0.0002652763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001178595,"about_ca_system_score_gemma":0.001703713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03281013,"about_ca_topic_score_gemma":0.03879047,"domain_scores_codex":[0.9997794,0.00005520363,0.00001422938,0.00003968697,0.00007501631,0.00003662749],"domain_scores_gemma":[0.999626,0.0002072788,0.00003254024,0.00002469829,0.00007936824,0.00003005391],"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.0001141774,0.00003137715,0.0006705768,0.00005475153,0.00002706376,0.00005179951,0.00006925447,0.9410557,0.000958893,0.005827498,0.001678403,0.04946056],"study_design_scores_gemma":[0.000008009801,0.0000075543,0.00008090514,0.00000214583,0.000002308163,0.000007087991,0.00001661782,0.9971969,0.000217071,0.002145186,0.0003132695,0.000002817486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07662034,0.0005985653,0.9184036,0.0002805706,0.00005498265,0.00007624156,0.0002915522,0.001058578,0.002615697],"genre_scores_gemma":[0.6212854,0.0002677074,0.3751598,0.00003587896,0.00001707927,0.0001520944,0.0005165312,0.0001030865,0.002462436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03281013,"threshold_uncertainty_score":0.0652383,"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."}}