{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002566311,0.00009496287,0.0002014303,0.0002444385,0.00008105976,0.0001440856,0.0005305733,0.0000432223,0.00001961333],"category_scores_gemma":[0.0002554053,0.00007550433,0.00007759492,0.0006254719,0.00004552111,0.0001689319,0.0002693019,0.0001505665,6.131691e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000228389,"about_ca_system_score_gemma":0.00008027847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009105514,"about_ca_topic_score_gemma":0.000002219604,"domain_scores_codex":[0.9989779,0.00001422734,0.0002824555,0.0002415167,0.0003667231,0.0001171616],"domain_scores_gemma":[0.9987339,0.00007160089,0.0002654642,0.00008092608,0.0008033896,0.00004471336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002716409,0.0003193065,0.03540531,0.00007452363,0.001019621,0.000006452829,0.004549291,0.05518596,0.06804567,0.83436,0.00004375473,0.0009629322],"study_design_scores_gemma":[0.0002347104,0.00002335888,0.01510295,0.0003776548,0.00003741808,0.000004171379,0.0009349838,0.9743316,0.008678954,0.0001722665,0.00002525413,0.00007671682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726479,0.00008221694,0.01825986,0.002282536,0.0002298295,0.0001151121,0.00005172368,0.0001964468,0.006134363],"genre_scores_gemma":[0.9367898,0.00003054716,0.06293061,0.0001148378,0.000007353411,0.000002437987,0.00001414909,0.000003643161,0.0001066777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9191456,"threshold_uncertainty_score":0.3078977,"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."}}