{"id":"W3200142631","doi":"10.1109/lra.2022.3191939","title":"Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning","year":2022,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Path (computing); Set (abstract data type); Mathematical optimization; Regular polygon; Line (geometry); Time complexity; Line segment; Algorithm; Mathematics; Artificial intelligence","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.0002637327,0.0001108319,0.0001669922,0.0001011187,0.0002764505,0.000067202,0.0002523987,0.00002511579,0.000003287316],"category_scores_gemma":[0.00001202318,0.0001264748,0.00004559482,0.0001133788,0.0000343566,0.0002357748,0.0000980823,0.0001015043,0.000001922144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004510902,"about_ca_system_score_gemma":0.00001906974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002675046,"about_ca_topic_score_gemma":1.4848e-8,"domain_scores_codex":[0.9989574,0.00004292816,0.0002699135,0.000249977,0.0002679714,0.000211825],"domain_scores_gemma":[0.999403,0.0001292301,0.0002153416,0.0001923024,0.00001008531,0.00005002818],"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.000002946156,0.00002464995,0.0005170528,0.00001869425,0.00001847715,0.000009111374,0.0009430122,0.9826441,0.01406426,0.0001430408,0.0009074388,0.0007071881],"study_design_scores_gemma":[0.0004869295,0.00009475092,0.004667921,0.00002348704,0.00001122597,0.00001682958,0.00003816292,0.9925877,0.001660555,0.00005673732,0.0002131409,0.0001425926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1438995,0.00002162602,0.8544161,0.0009488894,0.0004754918,0.0001693224,0.00001277411,0.00004162496,0.00001458036],"genre_scores_gemma":[0.7037604,0.000001518777,0.2953753,0.0007154731,0.00004512839,0.00004181381,0.00001957252,0.00001035829,0.00003045862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5598609,"threshold_uncertainty_score":0.5157495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01531204760654175,"score_gpt":0.2419409113981323,"score_spread":0.2266288637915906,"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."}}