{"id":"W2119473414","doi":"10.1109/robot.2003.1242149","title":"Multi-agent cooperative manipulation with uncertainty: a neural net-based game theoretic approach","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Minimax; Computer science; Object (grammar); Trajectory; Mathematical optimization; Nash equilibrium; Potential game; Net (polyhedron); Artificial neural network; Game theory; Fictitious play; Multi-agent system; Artificial intelligence; Mathematics; Mathematical economics","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.0001879281,0.0002125373,0.0001801019,0.00009014954,0.0001234774,0.0001751285,0.0005048998,0.0000546566,0.000007225443],"category_scores_gemma":[0.00002462103,0.0001465869,0.00003831571,0.0004285374,0.0001128174,0.0002606452,0.00006676865,0.0001564527,0.00003861859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001211917,"about_ca_system_score_gemma":0.0001526099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001242771,"about_ca_topic_score_gemma":0.000006478177,"domain_scores_codex":[0.9985344,0.00009491968,0.0001917806,0.0005044287,0.0003376517,0.0003367558],"domain_scores_gemma":[0.9991494,0.00005434992,0.00007593417,0.0004917291,0.000110056,0.0001185147],"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.00001097071,0.0001177246,0.0002222886,0.000006932598,0.00001066825,0.00003582921,0.0008387071,0.979268,0.00007862208,0.01866069,0.000009671471,0.0007399588],"study_design_scores_gemma":[0.001535976,0.0002469442,0.003523764,0.00002304819,0.000008158256,0.00004115822,0.0000807092,0.9937823,0.0002975613,0.0002200258,0.000007700433,0.0002326414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0125374,0.0000191876,0.985304,0.000547356,0.0001084919,0.0003782684,0.000001110642,0.0003248942,0.0007793089],"genre_scores_gemma":[0.5467134,2.05135e-7,0.4527554,0.0003898939,0.00001673728,0.00002315766,0.00001066075,0.000008409611,0.00008214804],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.534176,"threshold_uncertainty_score":0.5977641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03375486743344562,"score_gpt":0.2556076886451256,"score_spread":0.22185282121168,"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."}}