{"id":"W4286580165","doi":"10.1109/lra.2022.3193242","title":"Min-Max Vertex Cycle Covers With Connectivity Constraints for Multi-Robot Patrolling","year":2022,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Patrolling; Robot; Vertex (graph theory); Vertex cover; Computer science; Greedy algorithm; Mathematical optimization; Disjoint sets; Time complexity; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Artificial intelligence; Graph","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.0002943861,0.0001135814,0.0001408227,0.0000965295,0.0004675011,0.0001777357,0.0002045786,0.00002209864,0.00001207526],"category_scores_gemma":[0.0000214534,0.0001109354,0.00003865915,0.0001930033,0.00007859404,0.0003059236,0.00005910278,0.0001124702,0.000002442978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000614592,"about_ca_system_score_gemma":0.00005640096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009387894,"about_ca_topic_score_gemma":0.000003943491,"domain_scores_codex":[0.9989809,0.0000834506,0.0001678939,0.0002910754,0.0002439398,0.0002326788],"domain_scores_gemma":[0.999429,0.0001574879,0.0001073541,0.0001708226,0.00005640562,0.0000789062],"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.000008183504,0.00005815437,0.0001839987,0.00001666848,0.00002294542,0.000004908626,0.0004537947,0.9879649,0.002410274,0.004554943,0.0003681761,0.003953108],"study_design_scores_gemma":[0.001365743,0.0001212035,0.0003092863,0.00001026812,0.00000774608,0.0000121273,0.00005437,0.9973963,0.0002524804,0.0001268423,0.0001814714,0.0001621135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02071722,0.000008336201,0.972748,0.005644651,0.000291459,0.0004098965,0.00001540272,0.0001353951,0.00002967878],"genre_scores_gemma":[0.76851,0.000003183731,0.2294181,0.001959119,0.00001326266,0.00005164769,0.00001065339,0.00001024526,0.000023796],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7477928,"threshold_uncertainty_score":0.4523814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02478920928127611,"score_gpt":0.2537180979459416,"score_spread":0.2289288886646655,"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."}}