{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001983235,0.0001691222,0.0001790868,0.0001437847,0.0002042189,0.0002030783,0.00024086,0.00005410677,3.292421e-7],"category_scores_gemma":[0.00001795379,0.0001513396,0.00003157939,0.000166257,0.00004230634,0.0003996547,0.00003565241,0.00008632593,0.000003234354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005315482,"about_ca_system_score_gemma":0.00002535885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002764028,"about_ca_topic_score_gemma":7.805342e-8,"domain_scores_codex":[0.9989157,0.00003752011,0.0002452279,0.0003479412,0.0002146786,0.0002388874],"domain_scores_gemma":[0.9993763,0.0001589238,0.000146592,0.000257773,0.000017998,0.00004241474],"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.00001469887,0.00005920991,0.001246614,0.0001199474,0.00007458909,0.00001651492,0.001110018,0.9769862,0.005501531,0.003201656,0.00330465,0.008364407],"study_design_scores_gemma":[0.000817321,0.00006521297,0.005234784,0.0001740376,0.00002217664,0.000009183806,0.0000213638,0.9919782,0.0008383244,0.0002950925,0.0003535964,0.0001907613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02511338,0.0000445155,0.971099,0.002664728,0.0005199494,0.0003560363,0.000006993664,0.0001347819,0.00006063456],"genre_scores_gemma":[0.3401993,0.00001112747,0.6571668,0.002281286,0.0001011235,0.00006368575,0.00003917437,0.00001664644,0.0001208853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3150859,"threshold_uncertainty_score":0.6171449,"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."}}