{"id":"W4318192229","doi":"10.3389/frobt.2022.1076897","title":"Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function","year":2023,"lang":"en","type":"article","venue":"Frontiers in Robotics and AI","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Grid; Mathematical optimization; Path (computing); Heuristic; Planner; Context (archaeology); Occupancy grid mapping; Branch and bound; Best-first search; Upper and lower bounds; Motion planning; Search algorithm; Algorithm; Beam search; Mathematics; Artificial intelligence; Mobile robot","routes":{"ca_aff":true,"ca_fund":true,"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.0004836517,0.0007570613,0.0007960178,0.00073605,0.000486554,0.0006493485,0.0008946548,0.0008441479,0.003004409],"category_scores_gemma":[0.002232324,0.0003690101,0.0004694934,0.0008469106,0.000771588,0.0008020225,0.0008721823,0.0008994546,0.0003475157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037126,"about_ca_system_score_gemma":0.002261687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007633973,"about_ca_topic_score_gemma":0.008242172,"domain_scores_codex":[0.9996281,0.00009564367,0.00001628105,0.00008090726,0.000110873,0.00006816987],"domain_scores_gemma":[0.9993974,0.000420412,0.00004754424,0.00004428856,0.00005740927,0.0000329053],"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.00007457619,0.0000441445,0.0003434996,0.0001019121,0.00001568575,0.00005919175,0.00006576871,0.9057761,0.001312078,0.01760654,0.002076981,0.07252364],"study_design_scores_gemma":[0.00001541996,0.00002191865,0.00005006011,0.000007650662,0.000004469262,0.00002005863,0.0000156874,0.9931113,0.0004956556,0.005433881,0.0008201168,0.000003893804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01062552,0.0001704327,0.9858128,0.0000944303,0.00001569128,0.00007517182,0.00007549828,0.0005277996,0.002602552],"genre_scores_gemma":[0.2915563,0.0002639488,0.7058051,0.00006876394,0.00001317299,0.0003125331,0.0003385995,0.0001396307,0.001502026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007633973,"threshold_uncertainty_score":0.0151791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01750486442563275,"score_gpt":0.2559005558220749,"score_spread":0.2383956913964421,"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."}}