{"id":"W2160697303","doi":"10.1109/acc.2003.1243399","title":"Planning for dynamic multi-agent planar manipulation with uncertainty: a game theoretic approach","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Minimax; Computer science; Mathematical optimization; Trajectory; Controller (irrigation); Object (grammar); Multi-agent system; Linearization; Potential game; Game theory; Control theory (sociology); Nash equilibrium; Control (management); Mathematics; Artificial intelligence; Nonlinear system","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":[],"consensus_categories":[],"category_scores_codex":[0.0002101173,0.0002062627,0.0001943053,0.0001251424,0.0001276822,0.0001296006,0.0005523364,0.00007145076,0.000001300113],"category_scores_gemma":[0.00002473071,0.0001544471,0.00004897579,0.000246608,0.0000529703,0.0002401918,0.00004977501,0.000117545,0.00001503701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632119,"about_ca_system_score_gemma":0.00008867674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004566651,"about_ca_topic_score_gemma":0.000002959168,"domain_scores_codex":[0.9985511,0.0000306052,0.0002138411,0.0005227452,0.0002760868,0.0004056568],"domain_scores_gemma":[0.9991991,0.0000816098,0.0001012141,0.0004557769,0.000059286,0.0001030308],"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.00001965787,0.00008528691,0.0002575407,0.00002995295,0.00002692329,0.00002553811,0.001971728,0.9440911,0.00005932294,0.0520902,0.00001626984,0.001326435],"study_design_scores_gemma":[0.001507865,0.0002036045,0.002656446,0.0000650229,0.00001340058,0.00009339373,0.000190045,0.9904206,0.00004671936,0.004514907,0.00002981392,0.0002581975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005061542,0.00004832655,0.9929841,0.0002724004,0.0001277642,0.0005621974,0.00000322614,0.0003633658,0.0005770745],"genre_scores_gemma":[0.4095052,7.168172e-7,0.5901296,0.000124143,0.00001690324,0.00005481704,0.00002581856,0.00001319047,0.0001296923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4044436,"threshold_uncertainty_score":0.629817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03753521313552038,"score_gpt":0.2791054047012774,"score_spread":0.241570191565757,"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."}}