{"id":"W2161327891","doi":"10.1109/mass.2011.90","title":"On the Complexity of the Multi-Robot, Multi-Depot Map Visitation Problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Robot; Computer science; Focus (optics); Variety (cybernetics); Graph; Boundary (topology); Mobile robot; Artificial intelligence; Computational complexity theory; Theoretical computer science; Algorithm; Mathematics","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.00194528,0.001027529,0.001622093,0.0009402171,0.001783824,0.004308919,0.001882883,0.002160619,0.006486625],"category_scores_gemma":[0.01486775,0.0007311371,0.001398943,0.001877774,0.001937693,0.008282855,0.002712752,0.003544736,0.0007142894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00292562,"about_ca_system_score_gemma":0.002272346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005045852,"about_ca_topic_score_gemma":0.004762537,"domain_scores_codex":[0.9977235,0.0008116552,0.00009428776,0.000465344,0.000525074,0.0003800717],"domain_scores_gemma":[0.9806603,0.01669397,0.0007733008,0.0008085903,0.0005402957,0.0005235494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006164996,0.0003578817,0.003469458,0.0006737439,0.0001524402,0.0004756032,0.0007488682,0.6406766,0.002461941,0.2747506,0.02042084,0.05519553],"study_design_scores_gemma":[0.0001014097,0.00004502279,0.0009151769,0.00004248236,0.00004435912,0.0001770399,0.0002734661,0.6508347,0.000629613,0.3425547,0.004353462,0.00002848481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2551503,0.003024401,0.6768614,0.01517012,0.0002772298,0.0003892925,0.002132755,0.0008279861,0.04616653],"genre_scores_gemma":[0.768204,0.002853043,0.2137802,0.0009640169,0.0004649753,0.0005934768,0.002223861,0.0004565171,0.01045992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006486625,"threshold_uncertainty_score":0.02169991,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2035416822331825,"score_gpt":0.2978061462751105,"score_spread":0.09426446404192795,"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."}}