{"id":"W4413925460","doi":"10.1109/lra.2025.3604732","title":"Minimum-Length Coverage Path Planning for Grid Environments With Approximation Guarantees","year":2025,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Grid; Path length; Path (computing); Computer science; Motion planning; Mathematical optimization; Mathematics; Computer network; Artificial intelligence; Geometry","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.0009904564,0.001196695,0.001242677,0.0008005312,0.0006695575,0.001160231,0.001616174,0.001040095,0.003231251],"category_scores_gemma":[0.0066447,0.0007165915,0.000859452,0.001232253,0.0009404128,0.002099474,0.002038502,0.001525754,0.0005716226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173658,"about_ca_system_score_gemma":0.001518948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008126553,"about_ca_topic_score_gemma":0.007621296,"domain_scores_codex":[0.9988133,0.0002857067,0.00005275053,0.0002461657,0.0003656717,0.0002364128],"domain_scores_gemma":[0.9964858,0.002488075,0.0003191093,0.0003590565,0.0002051799,0.0001428064],"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.0001386471,0.00003220959,0.0004918162,0.0001088255,0.00002700962,0.00005612992,0.00007638396,0.9642955,0.001319424,0.01222968,0.001914897,0.01930951],"study_design_scores_gemma":[0.00001725825,0.00002874126,0.00008888132,0.000008192908,0.000005473978,0.00002150797,0.00001548,0.9854043,0.0005658565,0.01314553,0.0006944854,0.000004315408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02805075,0.0003904323,0.9656435,0.0003409392,0.00002276341,0.00005726592,0.0002861579,0.001559197,0.003648918],"genre_scores_gemma":[0.519688,0.0005496214,0.4743895,0.0001686061,0.00004469513,0.0002870896,0.001137959,0.0006256255,0.00310896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008126553,"threshold_uncertainty_score":0.01615852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01080437782711494,"score_gpt":0.2343824173981314,"score_spread":0.2235780395710165,"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."}}