{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006130356,0.001189796,0.0009825765,0.0006953951,0.0006669349,0.001100772,0.001156859,0.0009982004,0.003765757],"category_scores_gemma":[0.002182063,0.000604846,0.0008252678,0.001326536,0.0007694351,0.001275577,0.0008389126,0.0008504843,0.0002609586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371492,"about_ca_system_score_gemma":0.001236127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00808838,"about_ca_topic_score_gemma":0.0071102,"domain_scores_codex":[0.9994536,0.0001811216,0.00001572773,0.0001143137,0.0001018902,0.0001333967],"domain_scores_gemma":[0.9989304,0.0006642567,0.0001791136,0.00006748208,0.00006134553,0.00009743933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003182841,0.00002568386,0.000226609,0.00004114176,0.00001176207,0.00005426425,0.00002323202,0.9891313,0.0004677686,0.004267727,0.0004550541,0.005263617],"study_design_scores_gemma":[0.00001066949,0.00003840751,0.0001346905,0.000006921979,0.000005613287,0.00002503019,0.00002548527,0.9913535,0.0003879849,0.007340413,0.0006668589,0.000004468726],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1767373,0.0007185339,0.809006,0.0005938048,0.00006685017,0.0002491469,0.0006466908,0.0005198817,0.01146173],"genre_scores_gemma":[0.8509648,0.0004221316,0.1441898,0.0001238245,0.00003544522,0.000315794,0.0005654892,0.0001553979,0.003227167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00808838,"threshold_uncertainty_score":0.01608258,"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."}}