{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003960017,0.00008895726,0.00008361128,0.00003837676,0.0001827253,0.00005146862,0.0009754699,0.00003281602,0.0001717147],"category_scores_gemma":[0.00004806158,0.00004365796,0.00006046754,0.0002595141,0.0001955362,0.0001875146,0.0002455584,0.000124363,0.00009267672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001526655,"about_ca_system_score_gemma":0.00003850607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001408999,"about_ca_topic_score_gemma":0.000122044,"domain_scores_codex":[0.9989731,0.0001954372,0.0002059509,0.0001999311,0.0002590479,0.0001665441],"domain_scores_gemma":[0.9990731,0.00008126014,0.0001045407,0.0005524662,0.0001461308,0.00004247284],"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.000005063458,0.0003141821,0.0005208976,0.00001561602,0.00001330043,3.815141e-7,0.00388617,0.002116804,0.0005507589,0.9900281,0.0009019867,0.001646675],"study_design_scores_gemma":[0.0006114499,0.0001019957,0.02081138,0.00003321002,0.000003158154,0.000001492653,0.0001303183,0.94848,0.006670225,0.02274589,0.0002718146,0.0001390951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006123618,0.000006178449,0.9876211,0.003712483,0.000126428,0.0007000103,0.000001480908,0.00008601103,0.007133902],"genre_scores_gemma":[0.5098899,0.000002146092,0.487648,0.0007871071,0.000005050455,0.00002917768,7.86246e-7,0.000005775985,0.001632099],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9672823,"threshold_uncertainty_score":0.1880155,"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."}}