{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003946414,0.0007817549,0.001441263,0.0005940109,0.0008364063,0.0007394563,0.001272455,0.001207937,0.009311575],"category_scores_gemma":[0.001788452,0.0005899764,0.0006271782,0.0006746064,0.0005092951,0.001602158,0.0009976884,0.001146941,0.001031708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007128229,"about_ca_system_score_gemma":0.001750743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003614506,"about_ca_topic_score_gemma":0.003489828,"domain_scores_codex":[0.9997563,0.00004789888,0.00001100716,0.00005678929,0.00005456484,0.00007344372],"domain_scores_gemma":[0.9995146,0.0002641549,0.00003238913,0.00004043452,0.00007288744,0.00007547594],"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.001800343,0.0004950276,0.001093138,0.0007516272,0.0001118017,0.0004169761,0.0004049299,0.6301953,0.04384737,0.04082037,0.01722014,0.262843],"study_design_scores_gemma":[0.0002074672,0.0004382469,0.0003339162,0.00002713072,0.000023871,0.0001075325,0.0001249904,0.9687537,0.004927681,0.02231603,0.00271521,0.00002423906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1582049,0.0003920652,0.823413,0.0004956489,0.0001532805,0.0003302987,0.0003337406,0.001326592,0.01535056],"genre_scores_gemma":[0.4916974,0.0002520537,0.4948956,0.00009777657,0.00004745151,0.0002786894,0.0004652712,0.0002716292,0.01199417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009311575,"threshold_uncertainty_score":0.03115034,"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."}}