{"id":"W4386038368","doi":"10.1109/lra.2023.3306996","title":"Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning With Efficient Heuristics","year":2023,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Integer programming; Computer science; Path (computing); Reduction (mathematics); Planner; Mathematics; Artificial intelligence","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.0004143393,0.0002427615,0.0002534947,0.0002133147,0.000287024,0.0003670192,0.0003109719,0.00007139544,4.532857e-7],"category_scores_gemma":[0.00006340838,0.0002142681,0.00005276354,0.0004578313,0.00006654707,0.0001818832,0.00007967236,0.0001533,0.0000337811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000518823,"about_ca_system_score_gemma":0.00004189992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003737845,"about_ca_topic_score_gemma":1.070785e-7,"domain_scores_codex":[0.9983314,0.00005182128,0.0003161663,0.0004713176,0.0003346312,0.0004946259],"domain_scores_gemma":[0.9990143,0.0002903411,0.0001894118,0.0002974451,0.00008692332,0.0001215504],"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.000005817686,0.00003819695,0.0001977662,0.00005223662,0.00002965664,0.00006629449,0.0008366759,0.9916356,0.001243181,0.0001981539,0.001368117,0.00432837],"study_design_scores_gemma":[0.0007663175,0.0001159869,0.002003833,0.0001561403,0.0000212706,0.00003135816,0.00003088786,0.99619,0.0002151788,0.00000929168,0.000161556,0.0002981522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03163762,0.00001541478,0.9651714,0.001425183,0.0005530281,0.0004573864,0.000009419079,0.0007256528,0.000004877927],"genre_scores_gemma":[0.1276989,0.000001639074,0.871592,0.000398772,0.0000932283,0.00005372431,0.00004520825,0.00003370161,0.00008278875],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09606128,"threshold_uncertainty_score":0.8737599,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02665238469893423,"score_gpt":0.2562367640614579,"score_spread":0.2295843793625237,"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."}}