{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006409746,0.0008528791,0.001294709,0.001139008,0.0009675453,0.001444355,0.002312227,0.00168823,0.005583769],"category_scores_gemma":[0.002890059,0.0008005564,0.001029029,0.001259368,0.001068573,0.001834933,0.00273578,0.001160623,0.000604112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093573,"about_ca_system_score_gemma":0.001137107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004446792,"about_ca_topic_score_gemma":0.00555723,"domain_scores_codex":[0.9995489,0.0001123806,0.00001960463,0.0001145916,0.0001230948,0.00008146013],"domain_scores_gemma":[0.9991105,0.0005753885,0.00007147909,0.00009459007,0.00009897,0.00004903301],"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.000120022,0.00006954018,0.0005564302,0.0001473177,0.00003675486,0.00009944882,0.000116097,0.8659981,0.003096568,0.06760718,0.00212138,0.06003106],"study_design_scores_gemma":[0.0000126879,0.00002243173,0.00009834502,0.000009202855,0.000008444565,0.0000356109,0.0000194638,0.9795369,0.0005172883,0.01897969,0.0007536621,0.000006288852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0103527,0.0001297602,0.9848161,0.0001607495,0.00001391438,0.00005366211,0.00006606951,0.00019485,0.004212273],"genre_scores_gemma":[0.3437843,0.0002849399,0.6483477,0.000112444,0.00004058617,0.0003260376,0.0003253988,0.0001891635,0.006589546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005583769,"threshold_uncertainty_score":0.01867956,"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."}}