{"id":"W1997980548","doi":"10.5539/mas.v4n5p196","title":"Study for solving the path on the three-dimensional surface based on Cellular Automata method","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Cellular automaton; Shortest path problem; Asynchronous cellular automaton; Path (computing); Computer science; Dimension (graph theory); Surface (topology); Interval (graph theory); Mobile automaton; Discretization; Simple (philosophy); Ant colony optimization algorithms; Algorithm; Mathematics; Mathematical optimization; Automaton; Theoretical computer science; Combinatorics; Automata theory","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.007181419,0.0002566918,0.000197434,0.00008565213,0.001716198,0.0004970172,0.004164414,0.00005728031,0.000004097718],"category_scores_gemma":[0.0002350554,0.000140171,0.00006321957,0.0007201086,0.0003400793,0.0001639499,0.000488837,0.0005294405,0.0000488763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004940069,"about_ca_system_score_gemma":0.0003508267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001919902,"about_ca_topic_score_gemma":0.000006058202,"domain_scores_codex":[0.9964393,0.00007477904,0.0002472929,0.001052058,0.001544486,0.0006420328],"domain_scores_gemma":[0.9954497,0.001986776,0.0001528802,0.002172678,0.0001115927,0.000126327],"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.00004028145,0.0007431943,0.0001934132,0.0000083552,0.00001558852,0.0000221887,0.003028814,0.4753096,0.4467436,0.05363965,0.000585789,0.01966952],"study_design_scores_gemma":[0.0003516705,0.0001526233,0.001138722,0.00001052679,0.000006269045,0.000002796047,0.00003940263,0.9808279,0.01165633,0.00558657,0.00003150642,0.0001956908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06126952,0.000003153062,0.9339656,0.001933905,0.000628726,0.001245078,0.000004569031,0.0002061148,0.0007433713],"genre_scores_gemma":[0.681483,1.999318e-8,0.31751,0.0008442302,0.0000414169,0.00008083835,5.647107e-7,0.00001192241,0.00002800054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6202135,"threshold_uncertainty_score":0.9995834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03490982040020035,"score_gpt":0.2854686713750954,"score_spread":0.250558850974895,"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."}}