{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002935668,0.0002670604,0.0002712389,0.0007885752,0.000243198,0.000292686,0.0009501909,0.00006206283,0.000001145581],"category_scores_gemma":[0.000009356835,0.0002351149,0.00008583157,0.001799853,0.00006704793,0.0004872007,0.0005008637,0.0004030647,0.0000895691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005078856,"about_ca_system_score_gemma":0.00005711716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005571985,"about_ca_topic_score_gemma":0.00003048884,"domain_scores_codex":[0.9978838,0.00008967236,0.0003111566,0.000632154,0.0003539774,0.0007292717],"domain_scores_gemma":[0.9988155,0.0001703584,0.0001209525,0.000670156,0.00006741082,0.0001555672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005583837,0.001031984,0.56069,0.0001758033,0.0004298953,0.008824484,0.02505046,0.3189203,0.0004136459,0.02799045,0.02643527,0.0299819],"study_design_scores_gemma":[0.0005477089,0.0001604448,0.04406632,0.0002244183,0.000004725973,0.0001426036,0.00008622278,0.9511596,0.00005641093,0.0003952651,0.002832457,0.0003238163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06233647,0.0001058065,0.9341562,0.001014436,0.001337256,0.0002421511,0.000005135482,0.0007458507,0.00005673134],"genre_scores_gemma":[0.5734302,0.00002143494,0.4254341,0.0007318059,0.0001266161,0.00006218265,0.00003087487,0.00004319139,0.0001195157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6322393,"threshold_uncertainty_score":0.9587709,"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."}}