{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007221999,0.0006713271,0.0006194598,0.001002673,0.0006807827,0.001293386,0.0007444031,0.001290496,0.004931017],"category_scores_gemma":[0.004230941,0.000493441,0.0005748665,0.001225419,0.002584052,0.002969577,0.0009611722,0.001312073,0.0004975046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352062,"about_ca_system_score_gemma":0.0009167687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005799936,"about_ca_topic_score_gemma":0.004726841,"domain_scores_codex":[0.9996038,0.0001374712,0.00002034195,0.00009754686,0.00008210236,0.00005874842],"domain_scores_gemma":[0.9978048,0.001555845,0.0002531323,0.0001399845,0.0001294355,0.000116854],"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.00003496892,0.00001692729,0.0003022177,0.00006826541,0.00001811313,0.00006503088,0.00006869775,0.5063128,0.000709192,0.4743524,0.0008060114,0.01724545],"study_design_scores_gemma":[0.00001067203,0.00001724287,0.0001383727,0.00001531911,0.0000076827,0.00003358784,0.00002035147,0.4443757,0.0003071576,0.5522448,0.002813837,0.00001525674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02787971,0.002121805,0.952989,0.00111117,0.0001103358,0.000041217,0.0001551351,0.0004298086,0.0151617],"genre_scores_gemma":[0.8071786,0.00409818,0.1661735,0.0003038087,0.000204277,0.0002947017,0.0003502053,0.0002003114,0.02119643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005799936,"threshold_uncertainty_score":0.01649582,"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."}}