{"id":"W4399261794","doi":"10.1609/socs.v17i1.31585","title":"Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Integer programming; Mathematical optimization; Path (computing); Computer science; Motion planning; Integer (computer science); Robot; Mathematics; Artificial intelligence; Programming language","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.0009940915,0.0002764962,0.0002612245,0.0001730261,0.0002093148,0.0007545582,0.001972976,0.0001108942,0.000004063919],"category_scores_gemma":[0.0002334923,0.0001989012,0.0001544113,0.0004105578,0.0001111275,0.0002739465,0.0004906585,0.0005483614,0.00001981007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003036312,"about_ca_system_score_gemma":0.0001814364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002498632,"about_ca_topic_score_gemma":6.665765e-8,"domain_scores_codex":[0.9971012,0.0000137701,0.0004233478,0.0006446964,0.00135602,0.000460889],"domain_scores_gemma":[0.9982824,0.000456261,0.0001827978,0.0001978208,0.000763457,0.000117236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002035014,0.003911331,0.00200641,0.001364241,0.001431006,0.0001519301,0.009068777,0.2771002,0.1005345,0.5707645,0.008278945,0.02335319],"study_design_scores_gemma":[0.001587658,0.0007386988,0.0007745749,0.001076409,0.00003078638,0.00004932424,0.0000635547,0.9642878,0.02812117,0.0008410758,0.002077848,0.0003510915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3425655,0.0001710954,0.6158391,0.00728519,0.02395051,0.003750394,0.0001213205,0.001126463,0.005190401],"genre_scores_gemma":[0.9434271,0.000002339031,0.05554388,0.00003724538,0.0004301206,0.00009641227,0.000009214162,0.00004400466,0.0004096489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6871876,"threshold_uncertainty_score":0.8110954,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02431336114452302,"score_gpt":0.2809545925918165,"score_spread":0.2566412314472934,"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."}}