{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099939,0.001131275,0.0007954164,0.0005743946,0.0007773848,0.001413362,0.001262341,0.001097309,0.002533135],"category_scores_gemma":[0.002617352,0.000489029,0.001111306,0.0005217253,0.001556766,0.002294816,0.002451432,0.001140227,0.0003140778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009349973,"about_ca_system_score_gemma":0.0009052775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002014417,"about_ca_topic_score_gemma":0.001897029,"domain_scores_codex":[0.9994246,0.0002772601,0.00002447845,0.00007800452,0.0001329849,0.00006280866],"domain_scores_gemma":[0.9990951,0.0006593454,0.00005700918,0.00004350211,0.00005290348,0.00009216231],"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.00004896777,0.00003508056,0.0002228828,0.00008186702,0.00002864912,0.0001098994,0.0001161917,0.8638567,0.001433398,0.1206049,0.0004601142,0.01300132],"study_design_scores_gemma":[0.00001953275,0.00003614521,0.00004221933,0.00001480946,0.000005356407,0.00003628464,0.00003018494,0.9362089,0.0003237827,0.06173689,0.001538193,0.000007715167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02657518,0.0004828805,0.9616805,0.0003290864,0.00004569682,0.000097248,0.00002917326,0.0001077012,0.01065263],"genre_scores_gemma":[0.7209409,0.0007755221,0.2681912,0.0001603401,0.00004247126,0.0005210171,0.00008127878,0.00008218199,0.00920496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002533135,"threshold_uncertainty_score":0.008474171,"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."}}