{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108051,0.0001973102,0.0002240515,0.0001937786,0.0003475384,0.0003476132,0.0002233957,0.00008909895,4.853044e-7],"category_scores_gemma":[0.00005454405,0.000155302,0.00002728405,0.0002829745,0.00007736923,0.0002004551,0.00006343467,0.0002148654,8.014754e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002604819,"about_ca_system_score_gemma":0.00008086011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001339987,"about_ca_topic_score_gemma":7.618139e-7,"domain_scores_codex":[0.9986879,0.00006233942,0.0002054216,0.0004719894,0.0002091259,0.0003632885],"domain_scores_gemma":[0.9991907,0.0002901382,0.0000766315,0.000272607,0.00003231634,0.0001376091],"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.00006989484,0.0000333554,0.01165675,0.0000677831,0.00001267717,0.00002383625,0.0002697828,0.9745414,0.000009590266,0.0002642656,0.005247559,0.007803109],"study_design_scores_gemma":[0.001083382,0.0004766617,0.01578583,0.00014439,0.00002076682,0.000004496607,0.00006161148,0.9805179,0.00001000075,0.001252968,0.0004376335,0.0002043324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003500957,0.0003023396,0.9933549,0.001325036,0.0009792951,0.0003683435,0.00002757934,0.0001065474,0.00003505441],"genre_scores_gemma":[0.4042136,0.00004990236,0.5928419,0.002053724,0.0002899661,0.0001038736,0.0001248093,0.0000559588,0.0002663038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4007126,"threshold_uncertainty_score":0.633303,"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."}}