{"id":"W2989943660","doi":"10.1609/aaai.v34i06.6547","title":"Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":10,"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; Bin; Queueing theory; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005765531,0.0002883569,0.000383426,0.0001696889,0.0001131393,0.0003459908,0.001333954,0.0001751468,0.00001084888],"category_scores_gemma":[0.0005102236,0.0002548697,0.00008994565,0.00030577,0.00009971589,0.0002591868,0.0007224333,0.0004172249,0.000009138364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080299,"about_ca_system_score_gemma":0.0001429893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002231739,"about_ca_topic_score_gemma":5.29366e-7,"domain_scores_codex":[0.9978335,0.00002496594,0.0006422551,0.0007705243,0.0004189335,0.0003098045],"domain_scores_gemma":[0.9986025,0.0001215997,0.0006681137,0.0002160759,0.0003052902,0.00008642852],"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.0002392547,0.0004432271,0.001439699,0.00101448,0.00009770555,0.000004088326,0.01517185,0.6205302,0.0229878,0.2860368,0.0005905544,0.05144435],"study_design_scores_gemma":[0.00003803364,0.0001253252,0.0001258438,0.0006735678,0.00001122455,9.013789e-7,0.0001573434,0.9013585,0.02932373,0.0679585,0.000004205733,0.0002228063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008763066,0.00002362137,0.9846414,0.004031447,0.0006177685,0.001238286,0.00002735828,0.00008598296,0.0005710805],"genre_scores_gemma":[0.734161,0.00002979847,0.265427,0.0001307468,0.00006533396,0.0001120901,0.00001086354,0.00001921894,0.00004397482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7253979,"threshold_uncertainty_score":0.9999903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09084846226161183,"score_gpt":0.3010939958970604,"score_spread":0.2102455336354485,"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."}}