메뉴 건너뛰기




Volumn 16, Issue 5, 2003, Pages 727-736

Reaction-diffusion path planning in a hybrid chemical and cellular-automaton processor

Author keywords

[No Author keywords available]

Indexed keywords

DIFFUSION; MATHEMATICAL MODELS; PALLADIUM COMPOUNDS; POTASSIUM COMPOUNDS; PRECIPITATION (CHEMICAL); WAVEFRONTS;

EID: 0037408916     PISSN: 09600779     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0960-0779(02)00409-5     Document Type: Article
Times cited : (36)

References (29)
  • 1
    • 0000205785 scopus 로고
    • Reaction-diffusion algorithm for constructing discrete generalized Voronoi diagram
    • Adamatzky A. Reaction-diffusion algorithm for constructing discrete generalized Voronoi diagram. Neural Networks World. 3:1994;241-254.
    • (1994) Neural Networks World , vol.3 , pp. 241-254
    • Adamatzky, A.1
  • 2
    • 0002767482 scopus 로고    scopus 로고
    • Voronoi-like lattice partition of lattice in cellular automata
    • Adamatzky A. Voronoi-like lattice partition of lattice in cellular automata. Math. Comput. Model. 23:1996;51-66.
    • (1996) Math. Comput. Model. , vol.23 , pp. 51-66
    • Adamatzky, A.1
  • 3
    • 0000524368 scopus 로고    scopus 로고
    • Computation of shortest path in cellular automata
    • Adamatzky A. Computation of shortest path in cellular automata. Math. Comput. Model. 23:1996;105-113.
    • (1996) Math. Comput. Model. , vol.23 , pp. 105-113
    • Adamatzky, A.1
  • 4
    • 0031140225 scopus 로고    scopus 로고
    • Chemical processor for computation of skeleton of planar
    • Adamatzky A., Tolmachiev D. Chemical processor for computation of skeleton of planar. ph Adv. Mater. Opt. Electr. 7:1997;135-139.
    • (1997) Ph Adv. Mater. Opt. Electr. , vol.7 , pp. 135-139
    • Adamatzky, A.1    Tolmachiev, D.2
  • 7
    • 0002298246 scopus 로고
    • Front propagation into unstable media: A computational tool
    • A.V. Holden, M. Markus, & H.G. Othmer. Plenum Press
    • Babloyantz A., Sepulchre J.A. Front propagation into unstable media: a computational tool. Holden A.V., Markus M., Othmer H.G. Nonlinear wave processes in excitable media. 1991;343-345 Plenum Press.
    • (1991) Nonlinear wave processes in excitable media , pp. 343-345
    • Babloyantz, A.1    Sepulchre, J.A.2
  • 8
    • 0001803094 scopus 로고
    • A transformation for extracting new descriptors of shape
    • W. Wathen-Dunn. MIT Press
    • Blum H. A transformation for extracting new descriptors of shape. Wathen-Dunn W. Models for the perception of speech and visual form. 1967;MIT Press.
    • (1967) Models for the perception of speech and visual form
    • Blum, H.1
  • 9
    • 0015581337 scopus 로고
    • Biological shape and visual science
    • Blum H. Biological shape and visual science. J. Theor. Biol. 38:1973;205-287.
    • (1973) J. Theor. Biol. , vol.38 , pp. 205-287
    • Blum, H.1
  • 11
    • 0000700905 scopus 로고
    • Shape recognition, prairie fires, convex deficiencies and skeletons
    • Calabi L., Hartnett W.E. Shape recognition, prairie fires, convex deficiencies and skeletons. Am. Math. Mon. 75:1968;335-342.
    • (1968) Am. Math. Mon. , vol.75 , pp. 335-342
    • Calabi, L.1    Hartnett, W.E.2
  • 12
    • 0000615640 scopus 로고
    • The upper envelope of piecewise linear functions: Algorithms and applications
    • Edelsbrunner H., Guibas L.J., Sharir M. The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geom. 4:1989;311-336.
    • (1989) Discrete Comput. Geom. , vol.4 , pp. 311-336
    • Edelsbrunner, H.1    Guibas, L.J.2    Sharir, M.3
  • 13
    • 0017725650 scopus 로고
    • A shortest path algorithm for grid graphs
    • Hadlock F.O. A shortest path algorithm for grid graphs. Networks. 7:1977;323-334.
    • (1977) Networks , vol.7 , pp. 323-334
    • Hadlock, F.O.1
  • 14
    • 0026913154 scopus 로고
    • Gross motion planning - A survey
    • Hwang Y.K., Ahuja N. Gross motion planning - a survey. ACM Comput. Surv. 24:1992;219-291.
    • (1992) ACM Comput. Surv. , vol.24 , pp. 219-291
    • Hwang, Y.K.1    Ahuja, N.2
  • 15
  • 16
    • 0032676619 scopus 로고    scopus 로고
    • Path planners based on the wave expansion neural network
    • Kassim A.A., Kumar B.V. Path planners based on the wave expansion neural network. Robotic. Auton. Syst. 26:1999;1-22.
    • (1999) Robotic. Auton. Syst. , vol.26 , pp. 1-22
    • Kassim, A.A.1    Kumar, B.V.2
  • 17
    • 0003351855 scopus 로고
    • Concrete and abstract Voronoi diagrams
    • Springer Verlag
    • Klein R. Concrete and abstract Voronoi diagrams. Lecture notes in computer science. vol. 400:1990;Springer Verlag.
    • (1990) Lecture notes in computer science , vol.400
    • Klein, R.1
  • 19
    • 84882536619 scopus 로고
    • An algorithm for path connections and its application
    • Lee C.Y. An algorithm for path connections and its application. IRE Trans. Elec. Comput. EC-10:1961;346-365.
    • (1961) IRE Trans. Elec. Comput. , vol.EC-10 , pp. 346-365
    • Lee, C.Y.1
  • 20
    • 0011870507 scopus 로고
    • Two-degree-of-freedom robot path planning using cooperative neural fields
    • Lemmon M.D. Two-degree-of-freedom robot path planning using cooperative neural fields. Neural Comput. 3:1991;350-362.
    • (1991) Neural Comput. , vol.3 , pp. 350-362
    • Lemmon, M.D.1
  • 22
    • 0026679512 scopus 로고
    • 1 shortest paths among polygon obstacles in the plane
    • 1 shortest paths among polygon obstacles in the plane Algorithmica. 8:1992;55-88.
    • (1992) Algorithmica , vol.8 , pp. 55-88
    • Mitchell, J.S.B.1
  • 23
    • 0001860685 scopus 로고
    • The shortest path through a maze
    • cited by [21]
    • Moore E.F. The shortest path through a maze. Ann. Hardvard Comput. Lab. 30(Pt. II):1959;185-292. cited by [21].
    • (1959) Ann. Hardvard Comput. Lab , vol.30 , Issue.PART II , pp. 185-292
    • Moore, E.F.1
  • 24
    • 0032791081 scopus 로고    scopus 로고
    • Finding path in a labyrinth based on reaction-diffusion media
    • Rambidi N.G., Yakovenchuck D. Finding path in a labyrinth based on reaction-diffusion media. Adv. Mater. Opt. Electr. 1999;67-72.
    • (1999) Adv. Mater. Opt. Electr. , pp. 67-72
    • Rambidi, N.G.1    Yakovenchuck, D.2
  • 25
    • 0028957172 scopus 로고
    • Navigating complex labyrinths: Optimal paths from chemical waves
    • Steinbock O., Tóth A., Showalter K. Navigating complex labyrinths: optimal paths from chemical waves. Science. 267:1995;868-871.
    • (1995) Science , vol.267 , pp. 868-871
    • Steinbock, O.1    Tóth, A.2    Showalter, K.3
  • 26
    • 0024646384 scopus 로고
    • Motion planning in a plane using generalized Voronoi diagram
    • Takahashi O., Schilling R.J. Motion planning in a plane using generalized Voronoi diagram. IEEE Trans. Robotic. Autom. 5:1989;143-150.
    • (1989) IEEE Trans. Robotic. Autom. , vol.5 , pp. 143-150
    • Takahashi, O.1    Schilling, R.J.2
  • 27
    • 0030735092 scopus 로고    scopus 로고
    • An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture
    • Tzionas O., Thanailakis A., Tsalides Rh. An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture. Image Vision Comput. 15:1997;35-45.
    • (1997) Image Vision Comput. , vol.15 , pp. 35-45
    • Tzionas, O.1    Thanailakis, A.2    Tsalides, Rh.3
  • 28
    • 0030198169 scopus 로고    scopus 로고
    • Chemical processor for computation of Voronoi diagram
    • Tolmachev D., Adamatzky A. Chemical processor for computation of Voronoi diagram. Adv. Mater. Opt. Electr. 6:1996;191-196.
    • (1996) Adv. Mater. Opt. Electr. , vol.6 , pp. 191-196
    • Tolmachev, D.1    Adamatzky, A.2
  • 29
    • 0033997878 scopus 로고    scopus 로고
    • An efficient neural network approach to dynamic robot motion planning
    • Yang S.X., Meng M. An efficient neural network approach to dynamic robot motion planning. Neural Networks. 13:2000;143-148.
    • (2000) Neural Networks , vol.13 , pp. 143-148
    • Yang, S.X.1    Meng, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.