{"id":"W1659382545","doi":"10.1609/socs.v2i1.18205","title":"A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Tree (set theory); Computer science; Time complexity; Variety (cybernetics); Constructive; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Shortest path problem; Process (computing); Combinatorics; Graph; Programming language","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.0009261227,0.00111465,0.001006259,0.000851517,0.001331906,0.001158247,0.002265531,0.001556384,0.009073798],"category_scores_gemma":[0.004101477,0.000687192,0.0014855,0.001304924,0.001194825,0.002367725,0.00239911,0.002062217,0.002324971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327062,"about_ca_system_score_gemma":0.003665866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004831668,"about_ca_topic_score_gemma":0.006130144,"domain_scores_codex":[0.9990244,0.0001745702,0.00006385875,0.0002697106,0.0002875825,0.0001798674],"domain_scores_gemma":[0.9982173,0.001003921,0.0001321966,0.0003368877,0.0002025012,0.0001071092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000337715,0.0003767311,0.001085419,0.0007565806,0.000112986,0.0003198544,0.0006430416,0.2714388,0.01314219,0.1012546,0.01982977,0.5907023],"study_design_scores_gemma":[0.0001716099,0.0001736201,0.0002494204,0.00003006311,0.00003805929,0.0002835404,0.0001431458,0.920356,0.004046819,0.06306463,0.01141581,0.00002718196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00632835,0.0001422388,0.9873204,0.0002417979,0.00003848724,0.0001331939,0.00007670251,0.002019127,0.00369956],"genre_scores_gemma":[0.1141394,0.0001675072,0.8820344,0.0001076646,0.00001882129,0.0002413746,0.0003986278,0.0002530168,0.002639222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009073798,"threshold_uncertainty_score":0.03035486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01992492518198036,"score_gpt":0.2729742948879271,"score_spread":0.2530493697059467,"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."}}