{"id":"W7105593118","doi":"10.1109/tii.2025.3627632","title":"Game-Theoretic Safe Multiagent Motion Planning With Reachability Analysis for Dynamic and Uncertain Environments","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China; Chinese Academy of Engineering; National Science Foundation","keywords":"Reachability; Scalability; Convergence (economics); Multi-agent system; Collision avoidance; Nash equilibrium; Motion planning; Iterated function; Set (abstract data type)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001320839,0.0005804062,0.0008051248,0.001084473,0.000687929,0.00040071,0.0005883669,0.0005727739,0.00001555117],"category_scores_gemma":[0.00005892781,0.0005508292,0.000274954,0.00188022,0.0004462491,0.0007779586,0.00001339663,0.0009616084,0.00000966382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006870335,"about_ca_system_score_gemma":0.0002920136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007660667,"about_ca_topic_score_gemma":0.000006448916,"domain_scores_codex":[0.9963477,0.0002520495,0.001504538,0.0005802737,0.0006197989,0.0006956508],"domain_scores_gemma":[0.9971375,0.0008961122,0.0005953314,0.001016577,0.00009330524,0.0002612034],"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.0002899087,0.0002709806,0.0003657698,0.0001355828,0.001153853,0.000003140782,0.004824492,0.8844533,0.000007524701,0.00008075791,0.00001293187,0.1084018],"study_design_scores_gemma":[0.003436661,0.0007445878,0.0005607948,0.0004920693,0.001932386,0.000008450253,0.001134909,0.9902359,0.0006574164,0.0001581205,0.0001539509,0.0004847349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03220745,0.00003498358,0.9640605,0.0002769231,0.001277105,0.001713968,0.0002205412,0.00008132535,0.0001272019],"genre_scores_gemma":[0.925668,0.00004456794,0.07330275,0.0001434362,0.00003380004,0.0001660764,0.00004131661,0.00002014635,0.0005798764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8934606,"threshold_uncertainty_score":0.9996943,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04080694557400321,"score_gpt":0.2872776888509805,"score_spread":0.2464707432769773,"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."}}