{"id":"W2921191538","doi":"10.23919/acc.2019.8814485","title":"Multi-Robot Routing for Persistent Monitoring with Latency Constraints","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Latency (audio); Solver; Computer science; Robot; Patrolling; Heuristic; Approximation algorithm; Mathematical optimization; Graph; Algorithm; Mathematics; Theoretical computer science; 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.000493833,0.0008632755,0.0005728749,0.000348802,0.0006402447,0.0008964647,0.001266505,0.0007795696,0.003034807],"category_scores_gemma":[0.001664008,0.0003696111,0.0004799254,0.0008687658,0.0005096527,0.001729014,0.0008783069,0.0008577753,0.0002520113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009119505,"about_ca_system_score_gemma":0.0009747062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004539418,"about_ca_topic_score_gemma":0.005992999,"domain_scores_codex":[0.9995983,0.00008565375,0.00001741599,0.0001446695,0.00007261905,0.00008143712],"domain_scores_gemma":[0.9992056,0.0004415107,0.0001512769,0.00008429543,0.00005541985,0.00006188819],"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.0001128396,0.00006298456,0.0006665613,0.0001726161,0.00002675389,0.0001641845,0.00008187143,0.9423867,0.004704149,0.01313036,0.0016997,0.03679139],"study_design_scores_gemma":[0.00002858159,0.00008996365,0.0003565938,0.000009875359,0.00001580465,0.00009594077,0.0001038771,0.9769618,0.002874103,0.01675106,0.002703441,0.000008960074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1072615,0.0006485249,0.8863285,0.0005292263,0.0000633788,0.000132454,0.0003575442,0.0007017622,0.00397709],"genre_scores_gemma":[0.7148992,0.00049245,0.2779911,0.0001033884,0.00004124997,0.0002035651,0.000576749,0.0001985781,0.005493716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004539418,"threshold_uncertainty_score":0.0101524,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0716275427209212,"score_gpt":0.2947560714199437,"score_spread":0.2231285286990225,"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."}}