{"id":"W1514055912","doi":"10.1007/978-3-642-12200-2_9","title":"Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Guidance and Control Systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Computer science; Boundary (topology); Robot; Schedule; Metric (unit); Combinatorics; Algorithm; Artificial intelligence; Mathematics; Computer network","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.0005082038,0.0003334043,0.000330804,0.000167839,0.0002684701,0.000333229,0.0009351882,0.0002292042,0.00001339875],"category_scores_gemma":[0.00002700008,0.0002180033,0.00008181522,0.0001886904,0.0005079641,0.0001503455,0.0000847788,0.0007755801,0.0000187082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001350614,"about_ca_system_score_gemma":0.0002307045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004262683,"about_ca_topic_score_gemma":0.0003920408,"domain_scores_codex":[0.9982767,0.000008216554,0.0002462917,0.0005097581,0.000444497,0.0005145522],"domain_scores_gemma":[0.9988157,0.0003060722,0.00007083533,0.0006215374,0.0001108873,0.00007493895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001991397,0.00005546164,0.0005050409,0.001418108,0.000317707,0.0001800446,0.007797137,0.2633348,0.02490536,0.01784359,0.0005996708,0.6828439],"study_design_scores_gemma":[0.001002398,0.0002373417,0.0001096251,0.001300633,0.00003450276,0.00009002473,0.000001677823,0.8386332,0.004749079,0.02314895,0.1295514,0.001141134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007981485,0.0012156,0.9923495,0.0003489752,0.001106512,0.0006635099,0.0000110773,0.000110184,0.003396467],"genre_scores_gemma":[0.9216465,0.00002209285,0.07406998,0.0005602581,0.001716584,0.0001534254,0.000007020876,0.0001328684,0.001691274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9208484,"threshold_uncertainty_score":0.8889918,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01268682507948309,"score_gpt":0.223974631201064,"score_spread":0.2112878061215809,"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."}}