{"id":"W2491829515","doi":"10.1016/j.tcs.2015.09.011","title":"The Beachcombers' Problem: Walking and searching with mobile robots","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Schedule; Mobile robot; Set (abstract data type); Computer science; Algorithm; Line segment; Real-time computing; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003435091,0.0001348403,0.0001212421,0.00009523318,0.0009111874,0.001555257,0.00175639,0.00002541801,0.000002959129],"category_scores_gemma":[0.00006165352,0.00007597502,0.00001762183,0.0008946931,0.002890456,0.0008456242,0.00131968,0.0002481622,0.00001606358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524811,"about_ca_system_score_gemma":0.0002336496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005010999,"about_ca_topic_score_gemma":0.000001773061,"domain_scores_codex":[0.9976159,0.0001910732,0.0001752049,0.000516027,0.0009016862,0.0006001367],"domain_scores_gemma":[0.9982991,0.0003231713,0.00004566699,0.0005688617,0.0002850059,0.0004781607],"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.00000662908,0.00001895941,0.00007768146,0.000003318968,0.000002642622,0.000005110553,0.002053923,0.007699527,0.0000193013,0.9253128,0.00004681582,0.06475327],"study_design_scores_gemma":[0.0002969686,0.0004225135,0.0001089723,0.00002655124,0.000001657685,0.00007030575,0.00005449115,0.9081373,0.0001627875,0.0900616,0.0005001109,0.000156749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005610916,0.00007250896,0.9860474,0.002069094,0.0001274744,0.0003210483,1.747239e-7,0.0001584771,0.005592926],"genre_scores_gemma":[0.6343747,0.00000953459,0.3652965,0.0002334879,0.00003262914,0.00001703596,2.09796e-7,0.000005766297,0.00003012518],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9004378,"threshold_uncertainty_score":0.9998231,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01299640243925404,"score_gpt":0.2603003672563949,"score_spread":0.2473039648171409,"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."}}