{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009644129,0.00105642,0.0008352101,0.0005570878,0.0005707586,0.0009991884,0.001186058,0.001079026,0.001842997],"category_scores_gemma":[0.001682201,0.0004689611,0.000767235,0.0005182854,0.001727389,0.001310559,0.001143059,0.001308576,0.0002070671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001541889,"about_ca_system_score_gemma":0.001815527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003721511,"about_ca_topic_score_gemma":0.002902614,"domain_scores_codex":[0.9994969,0.000196438,0.0000214309,0.00008322645,0.000153161,0.00004886521],"domain_scores_gemma":[0.9993165,0.0004639376,0.00008687826,0.00002568337,0.00006694099,0.00004014294],"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.0000216373,0.00002763144,0.0001000465,0.0001046927,0.00002051693,0.00005726029,0.0001043804,0.903661,0.001011841,0.08300881,0.0003409499,0.01154126],"study_design_scores_gemma":[0.0000120909,0.00004214103,0.00003802498,0.00001088837,0.000007461097,0.00001798796,0.00002527636,0.9605421,0.0003004103,0.03784171,0.001154196,0.000007769604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003242599,0.0001535895,0.9933788,0.000166546,0.0000133617,0.00004569295,0.00001329918,0.00003029836,0.002955898],"genre_scores_gemma":[0.6012057,0.001272452,0.3903677,0.0002188549,0.0001057153,0.0007428059,0.00007601589,0.00006447024,0.005946305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003721511,"threshold_uncertainty_score":0.0111872,"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."}}