{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433034,0.001443926,0.0009035312,0.0005984121,0.0005969944,0.0007889667,0.0008907681,0.0009024879,0.003887173],"category_scores_gemma":[0.001423085,0.0006589317,0.0008902798,0.0005839201,0.0007505729,0.0008885704,0.001093974,0.0009603355,0.0005820983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009117403,"about_ca_system_score_gemma":0.0009383082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006162102,"about_ca_topic_score_gemma":0.007377287,"domain_scores_codex":[0.999545,0.000119458,0.00001313865,0.0001232154,0.00008814275,0.0001110241],"domain_scores_gemma":[0.9994884,0.0003235181,0.00005705751,0.00003871342,0.00004973575,0.00004259454],"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.00009097173,0.00004565451,0.0003646823,0.00007655578,0.00001603793,0.00009419099,0.0001010262,0.9672493,0.002759544,0.004820843,0.001301709,0.02307953],"study_design_scores_gemma":[0.00001492306,0.00005492272,0.000111897,0.000009393294,0.00000687544,0.00002953585,0.00005831464,0.9928894,0.001379088,0.004585326,0.0008540601,0.000006220483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05059259,0.0002265396,0.9434125,0.0001820165,0.00001967698,0.0001261697,0.0002366844,0.0007280936,0.004475636],"genre_scores_gemma":[0.4826921,0.0002827053,0.5117072,0.0001312414,0.00002538888,0.0003716023,0.0009249711,0.0004027596,0.003462115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006162102,"threshold_uncertainty_score":0.01300389,"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."}}