{"id":"W2566278123","doi":"10.1109/iros.2016.7759499","title":"The constriction decomposition method for coverage path planning","year":2016,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decomposition; Heuristic; Computer science; Motion planning; Path (computing); Constriction; Decomposition method (queueing theory); Mathematical optimization; Task (project management); Algorithm; Artificial intelligence; Mathematics; Engineering; Computer network; Systems engineering","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.0006110367,0.00008048072,0.00007888627,0.00003700459,0.0003264004,0.0001288797,0.0003624647,0.00003909808,0.000001830675],"category_scores_gemma":[0.0000961258,0.00004054591,0.00004417676,0.000110877,0.000019322,0.0002746129,0.00006121825,0.00003880552,0.000021452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004654372,"about_ca_system_score_gemma":0.00003626041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006875282,"about_ca_topic_score_gemma":1.415867e-7,"domain_scores_codex":[0.9991722,0.00007891948,0.0001549699,0.0002271007,0.0001423121,0.0002245399],"domain_scores_gemma":[0.9979319,0.001601769,0.00007710957,0.0002771104,0.00006385191,0.000048281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001855856,0.00002506799,0.0008409063,0.000004782858,0.00003290702,0.00001007844,0.0002099678,0.001647446,0.007040416,0.1349296,0.01394029,0.8413],"study_design_scores_gemma":[0.0009769453,0.0001977974,0.002153191,0.00006819913,0.000009227738,0.00009539755,0.00002394641,0.9502595,0.007749396,0.0212218,0.01701033,0.0002342774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001684525,0.00004048747,0.9951881,0.001752559,0.0006246226,0.0001778441,0.000003218613,0.0001985619,0.001846216],"genre_scores_gemma":[0.03078674,0.000008273634,0.9682106,0.0002399271,0.00008756023,0.00004023164,0.000001444898,0.000005809497,0.0006194643],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.948612,"threshold_uncertainty_score":0.2510441,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02154157062578772,"score_gpt":0.3246225056569995,"score_spread":0.3030809350312118,"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."}}