{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067273,0.00008231937,0.00008061808,0.00003776794,0.0001215197,0.0003778482,0.0002830037,0.00002618505,0.00002304137],"category_scores_gemma":[0.00001771507,0.00004438815,0.00001241976,0.0002915391,0.00006792577,0.0004408918,0.0001133408,0.0001272132,0.00001250309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002388571,"about_ca_system_score_gemma":0.00005581823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003333997,"about_ca_topic_score_gemma":0.00002813913,"domain_scores_codex":[0.9990007,0.000122975,0.0001179204,0.0002815439,0.0002174329,0.0002593888],"domain_scores_gemma":[0.9994743,0.00005867086,0.00002169335,0.0003000661,0.00005772029,0.00008751657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006322305,0.0009515794,0.01267371,0.00009584039,0.00005458736,0.0001321093,0.01970859,0.03355645,0.005966786,0.5480745,0.0048827,0.3732709],"study_design_scores_gemma":[0.0005123847,0.0005079926,0.01238716,0.00002647608,8.098535e-7,0.00001005988,0.00004429791,0.9823658,0.0001261935,0.002838997,0.001035928,0.0001438831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07919849,0.0001336752,0.8381141,0.05412898,0.00002057325,0.001321431,0.000001733303,0.000276182,0.02680488],"genre_scores_gemma":[0.6479871,0.00005986434,0.3448104,0.0005052598,0.00001225517,0.00001533821,0.000001808687,0.000007145819,0.006600846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9488094,"threshold_uncertainty_score":0.3643599,"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."}}