{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612736,0.002165624,0.001352562,0.001050001,0.0005607776,0.001721004,0.001399223,0.001146986,0.003337599],"category_scores_gemma":[0.004154048,0.0009955339,0.001534271,0.001942317,0.0008694482,0.001564491,0.001219861,0.002115977,0.0006234809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001978676,"about_ca_system_score_gemma":0.002318703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00539469,"about_ca_topic_score_gemma":0.006263245,"domain_scores_codex":[0.9985231,0.0006693324,0.00005837043,0.0002265559,0.0003004431,0.0002222892],"domain_scores_gemma":[0.9978788,0.001632243,0.0001939209,0.0001073178,0.0001113278,0.00007645341],"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.00004430366,0.00005669269,0.0001248006,0.0001208568,0.00003190641,0.00004035563,0.00003254091,0.9658684,0.0006574132,0.01353946,0.00114787,0.01833545],"study_design_scores_gemma":[0.00001460351,0.00002541395,0.00002392395,0.000011371,0.000007935076,0.000009305097,0.00001045948,0.9915693,0.000275245,0.007168898,0.0008795047,0.000004019258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007882948,0.0009014908,0.9848427,0.0003361389,0.00006079996,0.0001344298,0.0001608013,0.0004415825,0.005239151],"genre_scores_gemma":[0.2416267,0.001240353,0.7524111,0.0002809311,0.0001057217,0.0007191174,0.0004738419,0.0002960281,0.002846225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00539469,"threshold_uncertainty_score":0.01435637,"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."}}