{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007286,0.001132367,0.001165896,0.0006149318,0.00104866,0.001076287,0.002093982,0.001249508,0.004735784],"category_scores_gemma":[0.002829103,0.0007342058,0.0005818373,0.0009020211,0.001510816,0.001689975,0.001372439,0.001129111,0.0003873979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001870292,"about_ca_system_score_gemma":0.002019522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01097651,"about_ca_topic_score_gemma":0.008353799,"domain_scores_codex":[0.9994485,0.0001361732,0.00001726583,0.0001515057,0.00009038153,0.0001560733],"domain_scores_gemma":[0.9986497,0.0008671491,0.0001581859,0.00007633463,0.0001069401,0.0001417192],"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.0001193138,0.00008171069,0.0003897638,0.00006410482,0.00002535981,0.00005788301,0.00009124297,0.9728423,0.001157899,0.009268456,0.0007717595,0.0151302],"study_design_scores_gemma":[0.00001694013,0.00004562256,0.0001232131,0.00000353017,0.000006666779,0.0000159799,0.00003996057,0.9935848,0.000460123,0.005258507,0.0004382338,0.000006475025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09044819,0.0002499445,0.9042985,0.0002472795,0.00003717003,0.000114203,0.0001193351,0.000548656,0.003936803],"genre_scores_gemma":[0.7838157,0.0002003413,0.2100268,0.0001081015,0.00002884767,0.000200499,0.0002882837,0.0002034102,0.005128001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01097651,"threshold_uncertainty_score":0.02182525,"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."}}