{"id":"W2125804107","doi":"10.1109/robot.2002.1014423","title":"Resistors, Markov chains and dynamic path planning","year":2003,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Computer science; Convergence (economics); Sampling (signal processing); Motion planning; Mathematical optimization; Exponential function; Total harmonic distortion; Resistor; Tree (set theory); Harmonic; Markov process; Heuristic; Grid; Algorithm; Mathematics; Artificial intelligence; Engineering; Telecommunications; Machine learning; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.0003529387,0.0001183713,0.000124068,0.00008601133,0.0001279651,0.00009029238,0.0002943438,0.00005087626,0.000007166871],"category_scores_gemma":[0.00008301457,0.0001058704,0.00002091535,0.0001906598,0.00003080126,0.0001916757,0.00008110263,0.0001081483,0.00001799734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003780181,"about_ca_system_score_gemma":0.00004319843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001045988,"about_ca_topic_score_gemma":5.764095e-7,"domain_scores_codex":[0.9989882,0.00007543487,0.0001379878,0.0003457861,0.0001746738,0.0002779931],"domain_scores_gemma":[0.9993582,0.00009246032,0.0000440011,0.0003744799,0.00002038846,0.0001104616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002719397,0.0004288115,0.09360353,0.0002110391,0.0002154189,0.002598868,0.01512457,0.007546406,0.003493391,0.6717402,0.05923914,0.1457714],"study_design_scores_gemma":[0.0006874579,0.0001441936,0.0517587,0.00009571158,0.000008878242,0.000316451,0.0001775598,0.9337476,0.0001953335,0.002786595,0.009439865,0.0006416764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007901567,0.0004663372,0.9691843,0.0002648486,0.0003500739,0.00007669975,7.821282e-7,0.0002545447,0.02150081],"genre_scores_gemma":[0.2789161,0.000009315423,0.7162218,0.0002901522,0.00001394581,0.000005195366,0.000001296871,0.000009612926,0.004532609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9262012,"threshold_uncertainty_score":0.4317271,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01178518023857749,"score_gpt":0.2429800398016448,"score_spread":0.2311948595630673,"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."}}