{"id":"W2005068613","doi":"10.22215/etd/2013-09919","title":"Multi-Robot Exploration Using Potential Games","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Action (physics); Set (abstract data type); Potential game; Obstacle; Function (biology); Space (punctuation); Sequential game; Robot; Artificial intelligence; Bounded function; Mathematical optimization; Game theory; Theoretical computer science; Nash equilibrium; Mathematics; Mathematical economics; Geography","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.0001358685,0.0003059815,0.0002863257,0.0002499133,0.0001499226,0.0004636876,0.0008329197,0.0002940732,0.00004633573],"category_scores_gemma":[0.00004015049,0.0002888603,0.0001018116,0.0002546026,0.0000132794,0.001284707,0.00007374487,0.0002597153,0.000417536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006958182,"about_ca_system_score_gemma":0.0001661652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000267618,"about_ca_topic_score_gemma":0.000008805529,"domain_scores_codex":[0.9981818,0.00006890547,0.0003691162,0.0006094362,0.0004397656,0.0003309282],"domain_scores_gemma":[0.9987863,0.00002463487,0.0002758781,0.0005831409,0.0002284983,0.000101491],"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.00003522154,0.0008559654,0.0001730344,0.0005337109,0.0005080343,0.0004679541,0.01977674,0.4786952,0.1838288,0.004836529,0.01466792,0.2956209],"study_design_scores_gemma":[0.0002068454,0.0000247247,0.001387934,0.0001003322,0.000020408,0.00001365917,0.0002584771,0.9946653,0.002709111,0.0001974632,0.00003524195,0.0003805667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003790872,0.0001312829,0.9906543,0.00005148646,0.003918083,0.0002968876,0.000001248557,0.0003707285,0.0007850848],"genre_scores_gemma":[0.007945954,0.00001450913,0.9702141,0.00006146543,0.0002099995,0.00003409462,0.0002544209,0.00003388923,0.02123157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5159701,"threshold_uncertainty_score":0.9999564,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05638980100693653,"score_gpt":0.3065753727813139,"score_spread":0.2501855717743773,"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."}}