{"id":"W2782799514","doi":"10.1109/iris.2017.8250106","title":"A cooperative exploration strategy with efficient backtracking for mobile robots","year":2017,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Backtracking; Mobile robot; Computer science; Robot; Node (physics); Tree (set theory); Random tree; Distributed computing; Artificial intelligence; Engineering; Motion planning; Algorithm; Mathematics","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.000334571,0.0005276253,0.0005226894,0.000517428,0.0005097572,0.0004071374,0.0009429969,0.0005826015,0.0006058689],"category_scores_gemma":[0.0008105201,0.0002588718,0.0004916225,0.0004824605,0.0004747828,0.0009325863,0.0008134461,0.0003110105,0.0002259185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002837694,"about_ca_system_score_gemma":0.0006296491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002097981,"about_ca_topic_score_gemma":0.001707293,"domain_scores_codex":[0.9997399,0.00005662547,0.00001248615,0.00006571239,0.0000929976,0.00003226674],"domain_scores_gemma":[0.9997736,0.0000834794,0.00003423753,0.00003270712,0.00005429037,0.00002168997],"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.0001294137,0.0001269717,0.0011113,0.0002095966,0.00008414674,0.0004785928,0.0004961106,0.6550844,0.04039974,0.04454004,0.002565601,0.254774],"study_design_scores_gemma":[0.0000201419,0.0001190677,0.0001537873,0.000006817807,0.0000144916,0.0001355125,0.00002865079,0.9891395,0.002441608,0.005875914,0.00205011,0.00001436361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01886426,0.0002240025,0.9790325,0.00005598738,0.0000174817,0.00003645323,0.00001317729,0.0002170906,0.001539057],"genre_scores_gemma":[0.6039262,0.0003284926,0.3923499,0.00007758944,0.00002327745,0.0002511241,0.00008946455,0.00005715518,0.002896774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002097981,"threshold_uncertainty_score":0.004171491,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06025845480772201,"score_gpt":0.3171704046866592,"score_spread":0.2569119498789372,"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."}}