{"id":"W4286973027","doi":"10.48550/arxiv.2109.08185","title":"Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Mitacs","keywords":"Heuristics; Computer science; Path (computing); Motion planning; Mathematical optimization; Regular polygon; Line (geometry); Robot; Set (abstract data type); Line segment; Time complexity; Quality (philosophy); Algorithm; Mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003545961,0.001241377,0.000753266,0.0006413699,0.0005749996,0.0007379524,0.0008455637,0.0008217543,0.004595966],"category_scores_gemma":[0.001629899,0.0005786819,0.0007896676,0.0005936201,0.0007159502,0.0009809616,0.001144375,0.001022012,0.0006573102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007838252,"about_ca_system_score_gemma":0.0007983293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003844603,"about_ca_topic_score_gemma":0.005474867,"domain_scores_codex":[0.9995158,0.0001317995,0.00001378788,0.0001326327,0.00009843086,0.0001076096],"domain_scores_gemma":[0.999366,0.0004232939,0.00006469538,0.00004720472,0.0000543426,0.00004457334],"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.0001207908,0.00007312011,0.0005684629,0.0001162822,0.00001926606,0.000106636,0.0001447082,0.9513252,0.004293294,0.007883698,0.001830608,0.03351789],"study_design_scores_gemma":[0.00001863364,0.00007472368,0.0002037181,0.00001290702,0.000008893128,0.00004657307,0.0000940227,0.9877139,0.00196419,0.00859512,0.001259817,0.000007442267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05371431,0.0002076605,0.9402421,0.0001594964,0.00001708116,0.0001076093,0.0002596301,0.0006748824,0.004617217],"genre_scores_gemma":[0.4684657,0.0002714766,0.5260903,0.0001087527,0.00002191486,0.0003515176,0.001077503,0.0004515963,0.003161271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004595966,"threshold_uncertainty_score":0.01537502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06343477976045878,"score_gpt":0.2063550469856692,"score_spread":0.1429202672252105,"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."}}