{"id":"W4322588019","doi":"10.1111/cgf.14737","title":"Multi‐agent Path Planning with Heterogenous Interactions in Tight Spaces","year":2023,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Connaught Fund; National Science Foundation","keywords":"Initialization; Solver; Computer science; Motion planning; Path (computing); Set (abstract data type); Mathematical optimization; Collision detection; Shortest path problem; Space (punctuation); Dijkstra's algorithm; Crowd simulation; Algorithm; Collision; Theoretical computer science; Artificial intelligence; Mathematics; Crowds; Robot","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.0009104408,0.0005423917,0.0007737144,0.0004813082,0.0009462031,0.0009336526,0.001084363,0.0008139663,0.001500743],"category_scores_gemma":[0.001711359,0.0007367107,0.0006531212,0.0005214133,0.001680451,0.00131478,0.00243035,0.001224625,0.000175005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001171438,"about_ca_system_score_gemma":0.0009337226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007409432,"about_ca_topic_score_gemma":0.006211521,"domain_scores_codex":[0.9995029,0.000194288,0.0000170096,0.0001042867,0.0001081351,0.00007326548],"domain_scores_gemma":[0.9992114,0.0004529999,0.0001224988,0.0000749348,0.00006343456,0.00007471337],"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.00002457974,0.00001308732,0.0001507335,0.00001093899,0.00001296414,0.00005202038,0.0000804742,0.9784101,0.001129548,0.01594168,0.0001405212,0.004033448],"study_design_scores_gemma":[0.000004918516,0.00001115161,0.00004055381,0.000001981454,0.000002222143,0.000005908408,0.00001555286,0.99264,0.0002126431,0.006765853,0.0002962641,0.000003014558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04705586,0.00006034573,0.9509204,0.00009219395,0.00001103119,0.00002278268,0.00001427489,0.0001568082,0.001666238],"genre_scores_gemma":[0.7624429,0.0000877881,0.2345913,0.00004934281,0.00001245634,0.0001110099,0.00004809216,0.0000853415,0.002571744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007409432,"threshold_uncertainty_score":0.0147326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04312262368034916,"score_gpt":0.2876624075442743,"score_spread":0.2445397838639251,"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."}}