{"id":"W3002166437","doi":"10.1080/01605682.2019.1685362","title":"Near-optimal search-and-rescue path planning for a moving target","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Computer science; Motion planning; Heuristic; Integer programming; Path (computing); Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923969,0.0006431898,0.0007636601,0.0003882082,0.000475289,0.0007092942,0.0007737612,0.001098756,0.002628915],"category_scores_gemma":[0.001815606,0.0003965251,0.000560532,0.0004021257,0.0008608132,0.001061351,0.001177031,0.001260645,0.0002839313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006943955,"about_ca_system_score_gemma":0.001341581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003296805,"about_ca_topic_score_gemma":0.003416209,"domain_scores_codex":[0.9996912,0.0001000597,0.00001361971,0.00009676557,0.00005638196,0.00004193965],"domain_scores_gemma":[0.9992015,0.00058194,0.00008670042,0.00004020574,0.00005512769,0.00003452153],"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.00003537439,0.0000249367,0.0001980944,0.00005228325,0.00001502458,0.00005596083,0.00004997788,0.968456,0.0008213982,0.01453497,0.0004915071,0.01526455],"study_design_scores_gemma":[0.000006185468,0.00003016724,0.00005939429,0.000003452177,0.000004012697,0.00001891681,0.00002290719,0.9912961,0.000285754,0.007923612,0.0003456249,0.000003887055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01896889,0.0001057909,0.9781845,0.0001887536,0.00001264636,0.00003593614,0.00004776505,0.00010598,0.002349665],"genre_scores_gemma":[0.6912951,0.0002581968,0.3028468,0.00007552584,0.00002773072,0.0001906744,0.000176773,0.0000894429,0.005039644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003296805,"threshold_uncertainty_score":0.008794606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1104188103309546,"score_gpt":0.375413378670801,"score_spread":0.2649945683398464,"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."}}