{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876368,0.0008102757,0.0005694993,0.0006589835,0.0008734018,0.000723739,0.0009970816,0.000801007,0.003907723],"category_scores_gemma":[0.001659568,0.0004893978,0.000756306,0.0007253368,0.0006279902,0.001029924,0.001281454,0.0005839861,0.0004636467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009356978,"about_ca_system_score_gemma":0.0009470446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006788511,"about_ca_topic_score_gemma":0.005955796,"domain_scores_codex":[0.9997247,0.00008929311,0.00001129683,0.00007714111,0.00004528608,0.00005219908],"domain_scores_gemma":[0.9995782,0.0002566393,0.00005522674,0.00003575544,0.00003503038,0.00003924645],"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.00003949392,0.00002190498,0.0002950536,0.0000383289,0.00001342704,0.0000789174,0.00006720654,0.9764574,0.0005604206,0.005677409,0.0004822827,0.01626824],"study_design_scores_gemma":[0.00001235271,0.00003336437,0.0001020021,0.000004800464,0.000006080676,0.00001978688,0.00006702451,0.9901446,0.0005470666,0.007944616,0.001113091,0.000005238942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.051487,0.000124427,0.9454908,0.0001115702,0.00002120612,0.00008517473,0.0001148503,0.0002361166,0.002328916],"genre_scores_gemma":[0.5069221,0.000276711,0.4868301,0.00004577296,0.00001990595,0.000297022,0.0004807909,0.0001629918,0.004964559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006788511,"threshold_uncertainty_score":0.01349801,"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."}}