{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001103504,0.0006132257,0.0005736633,0.0003391914,0.0006230273,0.001198662,0.002644328,0.0002910836,0.00000461887],"category_scores_gemma":[0.0001187937,0.0004485956,0.0001428078,0.0004011902,0.0006347825,0.0004267706,0.001095601,0.0008552305,0.000004651197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001466056,"about_ca_system_score_gemma":0.0006628964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001528253,"about_ca_topic_score_gemma":0.000003573512,"domain_scores_codex":[0.9960068,0.0000471858,0.0004960967,0.001721294,0.0008983756,0.0008302881],"domain_scores_gemma":[0.9960789,0.001952503,0.0003147093,0.001247639,0.0002206694,0.0001855758],"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.000008643316,0.00001118075,0.00006934268,0.00006574974,0.00001870716,0.0001956374,0.0007417103,0.8350994,0.00002926175,0.002368048,0.00009848109,0.1612938],"study_design_scores_gemma":[0.0004368188,0.0002044058,0.0001299618,0.0007925741,0.00001851297,0.0001333222,6.188586e-7,0.9900419,0.0001989433,0.005625482,0.001807654,0.0006097949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001912118,0.001447733,0.9939037,0.001496045,0.001820509,0.000721834,0.00004348531,0.0001394105,0.0004081509],"genre_scores_gemma":[0.006346567,0.0000219492,0.9906985,0.001731241,0.0007190214,0.00004955884,0.00003167834,0.00004864655,0.0003528226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.160684,"threshold_uncertainty_score":0.9998382,"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."}}