{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003299406,0.0003715703,0.0005860128,0.0004849274,0.0005741921,0.0008331251,0.000777459,0.0007459057,0.002675995],"category_scores_gemma":[0.001008888,0.0002494479,0.0009470144,0.0005116623,0.0005904518,0.0008558639,0.0005649067,0.0007777984,0.0002604197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006492213,"about_ca_system_score_gemma":0.001013655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009849912,"about_ca_topic_score_gemma":0.003824606,"domain_scores_codex":[0.9998098,0.00004302191,0.000009564367,0.00003827105,0.00007362943,0.00002574886],"domain_scores_gemma":[0.9997396,0.0001307774,0.00001570649,0.00001558788,0.00008595605,0.00001242881],"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.00002970506,0.00002205006,0.001446063,0.0002200503,0.00003935664,0.0001659073,0.0001988427,0.832629,0.003493734,0.1289718,0.001817631,0.03096588],"study_design_scores_gemma":[0.000004496468,0.000007531639,0.00007957596,0.000007147446,0.000004396876,0.00002252206,0.00001590483,0.9892525,0.0002369809,0.009174549,0.001190686,0.000003739432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0182685,0.0008054365,0.9729509,0.0003598039,0.00008244311,0.00003351824,0.00004174954,0.00008982667,0.007367764],"genre_scores_gemma":[0.6209199,0.001927141,0.3659521,0.0001568672,0.0001133192,0.0003332487,0.0002090146,0.0001062755,0.01028206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009849912,"threshold_uncertainty_score":0.01958513,"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."}}