{"id":"W2119064581","doi":"","title":"The optimal searcher path problem with a visibility criterion in discrete time and space","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Mathematical optimization; Path (computing); Visibility; Discretization; Motion planning; Any-angle path planning; Computer science; Grid; Object (grammar); Integer programming; Mathematics; Algorithm; Topology (electrical circuits); 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.001517436,0.000637102,0.001337567,0.00047953,0.000369401,0.001257748,0.001292553,0.001404301,0.002042512],"category_scores_gemma":[0.003237692,0.0005773462,0.0005811573,0.000942809,0.001263587,0.002666237,0.001258802,0.001149723,0.0001571924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001285686,"about_ca_system_score_gemma":0.001170279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005139391,"about_ca_topic_score_gemma":0.002710002,"domain_scores_codex":[0.9989687,0.0004913917,0.00003546543,0.0002118114,0.0001712186,0.000121389],"domain_scores_gemma":[0.9982737,0.001200617,0.0001992827,0.0001022493,0.0001184045,0.0001056535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001422582,0.00007378779,0.000415701,0.0000614642,0.0000266666,0.0001014108,0.00005783754,0.9463037,0.0009927055,0.03777613,0.000542187,0.01350616],"study_design_scores_gemma":[0.00001310562,0.00002762313,0.00006459568,0.00000249108,0.000003234774,0.00001276543,0.000009934345,0.9916462,0.0001929061,0.00777963,0.00024405,0.000003444522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0550581,0.0002942689,0.9418299,0.0002562237,0.00002556156,0.00003862104,0.00005988792,0.00009743397,0.002340006],"genre_scores_gemma":[0.7078067,0.0002171857,0.2878796,0.00004643954,0.0000281474,0.0001156963,0.0001345961,0.00007706357,0.0036945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005139391,"threshold_uncertainty_score":0.01021892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009406986349011976,"score_gpt":0.2568604366521286,"score_spread":0.2474534503031166,"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."}}