{"id":"W3216623747","doi":"10.1007/978-3-030-91608-4_9","title":"Fast and Optimal Planner for the Discrete Grid-Based Coverage Path-Planning Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Grid; Mathematical optimization; Heuristic; Path (computing); Planner; Motion planning; Algorithm; Branch and bound; Mathematics; Artificial intelligence; Robot","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.0003379728,0.000612168,0.0007985287,0.0005721107,0.0003937373,0.0005906769,0.0008703314,0.0006029742,0.003944043],"category_scores_gemma":[0.001216799,0.0004896118,0.0004960759,0.001094785,0.0005881175,0.0008415567,0.001063291,0.001252201,0.000428352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009218868,"about_ca_system_score_gemma":0.001391143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008667369,"about_ca_topic_score_gemma":0.009198981,"domain_scores_codex":[0.9997742,0.00004652578,0.000008456483,0.00004744954,0.00009515005,0.00002825198],"domain_scores_gemma":[0.9996649,0.0002263579,0.00002126011,0.00003181256,0.00003390429,0.00002180055],"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.00007852095,0.00003356549,0.0001452446,0.0001393915,0.00001691798,0.00003979821,0.00004343399,0.8560566,0.001647361,0.03078127,0.005351922,0.1056661],"study_design_scores_gemma":[0.00001682132,0.00001378709,0.0000530431,0.000005361712,0.000003654857,0.00001620115,0.000008462164,0.977526,0.0002948946,0.02043476,0.001623095,0.000003799682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005721408,0.0002353232,0.9895376,0.00009904966,0.00003264169,0.00004392654,0.0001530597,0.0004631654,0.003713815],"genre_scores_gemma":[0.234386,0.0006658126,0.7579306,0.00005622838,0.00003910745,0.0002669972,0.0006368409,0.0002271456,0.005791294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008667369,"threshold_uncertainty_score":0.01723385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01851515627556675,"score_gpt":0.2522502678635218,"score_spread":0.2337351115879551,"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."}}