{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093677,0.001147048,0.001212911,0.0006379703,0.001036078,0.001142044,0.002179926,0.001308664,0.004878838],"category_scores_gemma":[0.003230488,0.0007684357,0.0005960546,0.0009406893,0.001584215,0.001883711,0.001476018,0.001214175,0.0004079868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001909109,"about_ca_system_score_gemma":0.001925894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009457659,"about_ca_topic_score_gemma":0.006803422,"domain_scores_codex":[0.9993871,0.0001574075,0.00001931434,0.0001693248,0.0001007083,0.0001660768],"domain_scores_gemma":[0.9984274,0.001035523,0.0001742419,0.00008979801,0.0001169777,0.0001560784],"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.0001395536,0.00009301899,0.000415021,0.00007432448,0.00002883158,0.00006506536,0.0001073188,0.9679838,0.001281459,0.01214433,0.0009137243,0.01675358],"study_design_scores_gemma":[0.00001852143,0.00004687887,0.0001204644,0.000003761153,0.000007073736,0.00001696238,0.00004062828,0.991652,0.000474944,0.007141027,0.0004709016,0.000006823622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08765049,0.0002694647,0.9069893,0.0002685706,0.00003797639,0.000113396,0.0001230794,0.0005308003,0.004016981],"genre_scores_gemma":[0.7718887,0.0002274174,0.2213844,0.0001205333,0.00003412274,0.0002200869,0.0003220293,0.0002283656,0.005574382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009457659,"threshold_uncertainty_score":0.01880521,"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."}}