{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927001,0.001338686,0.0008940508,0.0009526337,0.0007462231,0.001441328,0.001799321,0.001136923,0.001880778],"category_scores_gemma":[0.006087479,0.000698648,0.001539209,0.0006426818,0.002340353,0.001942458,0.003006835,0.001995782,0.0003187699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002038152,"about_ca_system_score_gemma":0.003320226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009417935,"about_ca_topic_score_gemma":0.006764899,"domain_scores_codex":[0.9987718,0.0004297312,0.00006749242,0.0002207982,0.0003594167,0.0001506931],"domain_scores_gemma":[0.9972862,0.001939154,0.0002789068,0.0001475294,0.0002246887,0.0001235719],"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.00002477301,0.00001506968,0.000147741,0.00004624789,0.00001818662,0.00007422962,0.00006251869,0.9242257,0.0006381908,0.069022,0.0002997662,0.005425563],"study_design_scores_gemma":[0.000006372001,0.0000101929,0.00002690527,0.000006805858,0.000005074159,0.000009555221,0.000009675252,0.9608265,0.0002749553,0.03846642,0.0003532655,0.000004294305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004582756,0.000069379,0.9929464,0.0001267507,0.00001054379,0.00004070192,0.00003292055,0.0001093183,0.002081244],"genre_scores_gemma":[0.642891,0.0004417844,0.3511764,0.0001612622,0.00005177778,0.0005892455,0.0002602544,0.0001643139,0.00426394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009417935,"threshold_uncertainty_score":0.01872623,"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."}}