Reaction–diffusion path planning in a hybrid chemical and cellular-automaton processor
暂无分享,去创建一个
[1] Andrew Adamatzky,et al. Computation of shortest path in cellular automata , 1996 .
[2] H. Blum. Biological shape and visual science (part I) , 1973 .
[3] Andrew Adamatzky,et al. Chemical Processor for Computation of Skeleton of Planar Shape , 1997 .
[4] Osamu Takahashi,et al. Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..
[5] Andrew Adamatzky,et al. Voronoi-like partition of lattice in cellular automata , 1996 .
[6] Michael Lemmon,et al. 2-Degree-of-freedom Robot Path Planning using Cooperative Neural Fields , 1991, Neural Computation.
[7] Max Q.-H. Meng,et al. An efficient neural network approach to dynamic robot motion planning , 2000, Neural Networks.
[8] Marco Dorigo,et al. Swarm intelligence: from natural to artificial systems , 1999 .
[9] B. V. K. Vijaya Kumar,et al. Path planners based on the wave expansion neural network , 1999, Robotics Auton. Syst..
[10] B. K. Szymanski,et al. Fine-grain discrete Voronoi diagram algorithms in L1 and L∞ norms , 1997 .
[11] A. Adamatzky,et al. Chemical processor for computation of voronoi diagram , 1996 .
[12] Frank O. Hadlock,et al. A shortest path algorithm for grid graphs , 1977, Networks.
[13] Andrew Adamatzky,et al. Computing in nonlinear media and automata collectives , 2001 .
[14] K. Showalter,et al. Navigating Complex Labyrinths: Optimal Paths from Chemical Waves , 1995, Science.
[15] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.
[16] Joseph S. B. Mitchell,et al. L1 shortest paths among polygonal obstacles in the plane , 1992, Algorithmica.
[17] C. Y. Lee. An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..
[18] Leonidas J. Guibas,et al. The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..
[19] Panagiotis Tzionas,et al. An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture , 1997, Image Vis. Comput..
[20] R. Brubaker. Models for the perception of speech and visual form: Weiant Wathen-Dunn, ed.: Cambridge, Mass., The M.I.T. Press, I–X, 470 pages , 1968 .
[21] Narendra Ahuja,et al. A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..
[22] Mario Markus,et al. Nonlinear wave processes in excitable media , 1991 .
[23] W. E. Hartnett,et al. Shape Recognition, Prairie Fires, Convex Deficiencies and Skeletons , 1968 .
[24] Rolf Klein,et al. Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.
[25] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[26] Tomohiko Yamaguchi,et al. Finding the optimal path with the aid of chemical wave , 1997 .
[27] A. Babloyantz,et al. Front Propagation Into Unstable Media: a Computational Tool , 1991 .