{"id":"W3175635045","doi":"10.1609/icaps.v31i1.15967","title":"A Competitive Analysis of Online Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Computer science; Controllability; Path (computing); Set (abstract data type); Bounded function; Plan (archaeology); Asymptotically optimal algorithm; Mathematical optimization; Bounded rationality; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Applied mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.003458442,0.001688105,0.001836283,0.001361788,0.001620413,0.003168428,0.004348559,0.001997944,0.0072544],"category_scores_gemma":[0.02736465,0.0007489135,0.001212094,0.001937478,0.002371239,0.006189651,0.002268574,0.002743292,0.0009222259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003370658,"about_ca_system_score_gemma":0.002855525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005592062,"about_ca_topic_score_gemma":0.00311143,"domain_scores_codex":[0.9958527,0.001291067,0.0001334796,0.0008221744,0.001161163,0.0007395182],"domain_scores_gemma":[0.9714656,0.02194344,0.001951128,0.001844431,0.001641859,0.00115356],"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.0006125075,0.0004867234,0.002872144,0.0004836268,0.0001589737,0.0002531704,0.0003451309,0.7357164,0.005897796,0.183067,0.005492297,0.06461427],"study_design_scores_gemma":[0.00003399568,0.00009810154,0.0002231088,0.00001036435,0.00002057277,0.00008633125,0.00004134121,0.9593786,0.0007702968,0.03800301,0.001320515,0.00001376462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09475861,0.001232879,0.8722067,0.001681909,0.000133306,0.0002801135,0.000414485,0.0005060163,0.02878599],"genre_scores_gemma":[0.8381854,0.0008327143,0.1538033,0.0003713898,0.000254801,0.0003563573,0.000378296,0.0002621834,0.005555512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0072544,"threshold_uncertainty_score":0.02445596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07027185868418233,"score_gpt":0.3332760815046675,"score_spread":0.2630042228204852,"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."}}