{"id":"W2997531191","doi":"10.1609/aaai.v34i06.6547","title":"Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers","year":2020,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"University of Southern California; National Science Foundation","keywords":"Computer science; Queue; Sorting; Idle; Path (computing); Set (abstract data type); Task (project management); Real-time computing; Queueing theory; Bin; Throughput; Mathematical optimization; Operations research; Distributed computing; Simulation; Algorithm; Computer network; Engineering; Mathematics; Operating system","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.000126154,0.0000601369,0.0000777507,0.00003765772,0.00003650733,0.00006448982,0.0001231268,0.00002422309,0.000009174369],"category_scores_gemma":[0.00004334927,0.00005809654,0.00001193584,0.0001248748,0.000005718483,0.0002515106,0.00004065163,0.00003186167,0.000006538842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002568126,"about_ca_system_score_gemma":0.00001620044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003946229,"about_ca_topic_score_gemma":8.113363e-8,"domain_scores_codex":[0.9994143,0.00002057756,0.0001244306,0.0002144153,0.00009836907,0.0001278848],"domain_scores_gemma":[0.9997711,0.000050468,0.00004230293,0.00006612853,0.00001413665,0.00005593325],"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.000005477598,0.00002187521,0.002767446,0.0000168482,0.000005445214,0.000005478918,0.001870416,0.9896981,0.0005192721,0.0008631319,0.001119859,0.003106706],"study_design_scores_gemma":[0.0003249927,0.00006901506,0.0008828016,0.00001139795,0.000001180894,6.799758e-7,0.0000289147,0.9981626,0.0003080942,0.0001028503,0.00003736125,0.0000700719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001325497,0.00001094201,0.9966272,0.001508962,0.00006691973,0.0001925345,0.000002034811,0.0000657358,0.0002001851],"genre_scores_gemma":[0.06873195,0.000001653782,0.930706,0.0004488889,0.00002027187,0.00001372914,0.00001637767,0.000004643648,0.00005649451],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06740645,"threshold_uncertainty_score":0.2369108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02312194576415661,"score_gpt":0.2393715342383867,"score_spread":0.2162495884742301,"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."}}