{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804117,0.00009757754,0.0001754691,0.00002794698,0.0009171127,0.0006154011,0.001168399,0.0000634419,0.000005404976],"category_scores_gemma":[0.001340122,0.00006472599,0.0002067431,0.0003592434,0.0001695972,0.0005825552,0.0005671136,0.0008547414,0.000003528155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001020335,"about_ca_system_score_gemma":0.001021589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009691578,"about_ca_topic_score_gemma":6.359024e-8,"domain_scores_codex":[0.9974261,0.0002846948,0.0003145056,0.0002139625,0.001381741,0.0003790008],"domain_scores_gemma":[0.9980896,0.0006298763,0.00005922216,0.0001723434,0.0007977927,0.0002512382],"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.00005072506,0.00004939371,0.00120847,0.00005274708,0.0001274786,0.00002459225,0.01756643,0.9303145,0.006314363,0.003827834,0.03937101,0.001092396],"study_design_scores_gemma":[0.0004598164,0.0002421704,0.002088351,0.00006634546,0.00000340485,0.00005412335,0.000455385,0.9936247,0.000636889,0.000277843,0.002016192,0.00007478273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08429995,0.0004467094,0.867348,0.04734256,0.0001892064,0.0003046441,0.00001193614,0.00001680142,0.00004024551],"genre_scores_gemma":[0.2461912,0.0000170002,0.7518229,0.001258598,0.0005542265,0.000007844683,0.00000124552,0.00001135623,0.0001356112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1618912,"threshold_uncertainty_score":0.7053782,"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."}}