{"id":"W2553326346","doi":"10.1109/coase.2016.7743548","title":"On minimizing turns in robot coverage path planning","year":2016,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workspace; Polygon (computer graphics); Computer science; Convex polygon; Motion planning; Path (computing); Robot; Regular polygon; Cover (algebra); Mathematical optimization; Artificial intelligence; Mathematics; 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.0002975207,0.0001439117,0.0001638781,0.0001648951,0.00003834399,0.00004911634,0.0006169648,0.00006174073,0.00001809688],"category_scores_gemma":[0.000135374,0.00009321945,0.00003558704,0.0002406839,0.00001744381,0.0002402429,0.0001485745,0.0001150972,0.0001943283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000794748,"about_ca_system_score_gemma":0.00004247936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000221271,"about_ca_topic_score_gemma":8.728665e-7,"domain_scores_codex":[0.9986553,0.00006256805,0.0002173593,0.0004131109,0.0002645513,0.0003871242],"domain_scores_gemma":[0.9988828,0.0004921179,0.00006033408,0.0004566431,0.00001793071,0.00009014045],"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.0001163736,0.0008752796,0.1084102,0.00008420992,0.00009718302,0.006404905,0.01458256,0.2660543,0.01916186,0.1726894,0.03424824,0.3772755],"study_design_scores_gemma":[0.006123688,0.0009310542,0.1756878,0.002427842,0.000007870065,0.0001924405,0.0001165036,0.7721905,0.006041097,0.03171862,0.002616454,0.001946105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02087738,0.00004741264,0.9662052,0.001022308,0.0004265072,0.00008622223,0.000001180674,0.000225204,0.01110854],"genre_scores_gemma":[0.8299726,0.000004068878,0.1683445,0.0006910766,0.00004695142,0.000007670516,4.568625e-7,0.000009984677,0.0009226982],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8090952,"threshold_uncertainty_score":0.3801379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0229131457904946,"score_gpt":0.2596733748816744,"score_spread":0.2367602290911798,"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."}}