{"id":"W2105848344","doi":"10.1007/s10472-009-9120-2","title":"Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach","year":2008,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Robot; Computer science; Mobile robot; Set (abstract data type); Task (project management); Distributed computing; Cover (algebra); Greedy algorithm; Algorithm; Real-time computing; Artificial intelligence; Engineering","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.0005834601,0.0002162431,0.0003486715,0.0001306129,0.0002255686,0.00008465778,0.0006850011,0.00008691321,0.000004876048],"category_scores_gemma":[0.0001253999,0.0001946401,0.00007732079,0.0003193998,0.0002317283,0.0001543379,0.0001794743,0.0001642984,0.00002498219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000704037,"about_ca_system_score_gemma":0.00005600406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004061158,"about_ca_topic_score_gemma":5.212825e-7,"domain_scores_codex":[0.9981334,0.00005208508,0.0006009444,0.0004387715,0.0004011738,0.0003736209],"domain_scores_gemma":[0.9986404,0.0001290436,0.0002479009,0.0005968599,0.0002051246,0.000180735],"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.00001981157,0.006588036,0.0001066934,0.000378678,0.0001042426,0.0001952218,0.02697745,0.5434901,0.007243304,0.1987854,0.0001453632,0.2159657],"study_design_scores_gemma":[0.0000293112,0.0001751718,0.0001189773,0.00004546029,0.000004769035,0.0001004869,0.0002716117,0.9767042,0.01603521,0.006290235,0.00000876352,0.0002157754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08697973,0.0001658304,0.9121322,0.0001305029,0.0001251523,0.0001980478,0.000005793604,0.0000803721,0.0001823835],"genre_scores_gemma":[0.4227352,0.00007108655,0.5770406,0.0000624997,0.00004078527,0.00000755535,0.000001938452,0.00001084656,0.00002956157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4332141,"threshold_uncertainty_score":0.7937194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1974527357382306,"score_gpt":0.3430350180906082,"score_spread":0.1455822823523776,"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."}}