{"id":"W1650780448","doi":"10.1109/tase.2015.2461213","title":"Planning Paths for Package Delivery in Heterogeneous Multirobot Teams","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":295,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Truck; Scheduling (production processes); Computer science; Job shop scheduling; Motion planning; Mathematical optimization; Heuristic; Vehicle routing problem; Traveling purchaser problem; Task (project management); Graph; Shortest path problem; 2-opt; Distributed computing; Operations research; Routing (electronic design automation); Robot; Engineering; Artificial intelligence; Computer network; Theoretical computer science; Mathematics; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634278,0.0001220112,0.0001180332,0.0004188341,0.00008813857,0.00007927127,0.0001003235,0.00005599553,0.00000183914],"category_scores_gemma":[0.00005077761,0.00013501,0.00002264136,0.00056408,0.00003393228,0.0004150287,0.00000115968,0.000110549,0.00000391003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001989962,"about_ca_system_score_gemma":0.0000423548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004917503,"about_ca_topic_score_gemma":0.000001790924,"domain_scores_codex":[0.9991227,0.00001018312,0.0002064036,0.0001839717,0.0002258963,0.0002508474],"domain_scores_gemma":[0.9995654,0.00008899377,0.00001823849,0.0001227875,0.00008152025,0.0001230348],"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.000003750845,0.000008156988,0.00001648285,0.0000218293,0.000003046506,0.000001203834,0.0007051574,0.9733056,0.01212546,0.000005779063,0.000005335812,0.01379814],"study_design_scores_gemma":[0.0003807792,0.00003524517,0.0002186903,0.00004530355,0.000004198312,0.00001004103,0.0001145836,0.969269,0.02971094,0.000005977557,0.00005912634,0.0001460828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2922614,0.00002963128,0.706841,0.00001195786,0.000341854,0.0001344351,0.000004040775,0.000341482,0.00003418412],"genre_scores_gemma":[0.9302793,0.000008992291,0.06959709,0.00001952244,0.00001613662,0.00004937606,8.545602e-7,0.00002191505,0.000006880426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6380178,"threshold_uncertainty_score":0.5505548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03005034896176269,"score_gpt":0.2773482127765395,"score_spread":0.2472978638147768,"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."}}