{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002394203,0.0001316565,0.000141916,0.00004106539,0.0004928221,0.0008535236,0.0007241511,0.00004028041,0.000002460614],"category_scores_gemma":[0.00005344407,0.00009638369,0.00002638205,0.00006572869,0.00005342087,0.000873293,0.00009896559,0.00006834754,0.00003027662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003173662,"about_ca_system_score_gemma":0.0001190643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003046129,"about_ca_topic_score_gemma":0.000008350587,"domain_scores_codex":[0.9990056,0.00002527125,0.0001423298,0.0003776921,0.0001968147,0.000252267],"domain_scores_gemma":[0.9987982,0.00007216357,0.0001401728,0.0006924437,0.000202625,0.0000943748],"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.000009992501,0.00005062032,0.00008817406,0.000005239362,0.00001191005,0.00001257317,0.0009587864,0.9779666,0.0001149951,0.01073389,0.0001707228,0.009876478],"study_design_scores_gemma":[0.0006321026,0.0005334056,0.0006137522,0.00003403228,0.000004392766,0.00001124032,0.0002435417,0.9946427,0.002874366,0.0001678341,0.00006800764,0.0001746036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00568549,0.00001608465,0.9905024,0.0002755923,0.0002430456,0.0005535566,0.00000161098,0.0001356803,0.00258652],"genre_scores_gemma":[0.5093666,7.257556e-7,0.4898515,0.00004684067,0.00004280474,0.0001683794,0.000003340632,0.00000829635,0.0005114417],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5036811,"threshold_uncertainty_score":0.8230547,"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."}}