{"id":"W2626096427","doi":"10.1142/s2301385017500066","title":"Heterogeneous Task Allocation and Sequencing via Decentralized Large Neighborhood Search","year":2017,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Robot; Computer science; Travelling salesman problem; Task (project management); Mathematical optimization; Path (computing); Motion planning; Distributed computing; Common value auction; Artificial intelligence; Algorithm; Mathematics; Computer network; Engineering","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007597592,0.0001442743,0.0001994402,0.00009963091,0.0007873879,0.001260062,0.0008579289,0.0000861956,0.000009074434],"category_scores_gemma":[0.00006318978,0.000132915,0.00003951807,0.0001064602,0.0000471688,0.0007074914,0.0003161987,0.000119704,0.00006531733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009000595,"about_ca_system_score_gemma":0.00008653894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001926082,"about_ca_topic_score_gemma":0.00003162535,"domain_scores_codex":[0.998262,0.0001952326,0.0002746688,0.0004229748,0.0003700874,0.0004750497],"domain_scores_gemma":[0.9984801,0.00004061898,0.0001454648,0.0009386658,0.0001797875,0.0002153143],"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.0001196223,0.0005816694,0.03149295,0.001400895,0.0006027493,0.0005116223,0.02546457,0.09801426,0.04948613,0.7342858,0.002592945,0.0554468],"study_design_scores_gemma":[0.0007902304,0.00006583634,0.0003433932,0.00006079168,0.000003975127,0.00006900875,0.00007346703,0.995537,0.0007203512,0.0003129011,0.001835906,0.0001871439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01708329,0.0005596009,0.9782897,0.00105845,0.0006001361,0.0006373856,0.000006837598,0.0001961413,0.001568421],"genre_scores_gemma":[0.9970696,0.0001149813,0.002189324,0.0001071441,0.00006197042,0.00002611644,0.000009139381,0.00001427564,0.0004074676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9799863,"threshold_uncertainty_score":0.9997767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03021271255279754,"score_gpt":0.2798406045165266,"score_spread":0.2496278919637291,"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."}}