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

被引:30
作者
Adamatzky, A [1 ]
Costello, BD
机构
[1] Univ W England, Fac Comp Engn & Math Sci, Bristol BS16 1QY, Avon, England
[2] Univ W England, Fac Sci Appl, Dept Chem & Phys Sci, Bristol BS16 1QY, Avon, England
基金
英国工程与自然科学研究理事会;
关键词
D O I
10.1016/S0960-0779(02)00409-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
To find the shortest collision-free path in a room containing obstacles we designed a chemical processor and coupled it with a cellular-automaton processor. In the chemical processor obstacles are represented by sites of high concentration of potassium iodide and a planar substrate is saturated with palladium chloride. Potassium iodide diffuses into the substrate and reacts with palladium chloride. A dark coloured precipitate of palladium iodide is formed almost every-where except sites where two or more diffusion wavefronts collide. The less coloured sites are situated at the furthest distance from obstacles. Thus, the chemical processor develops a repulsive field. generated by obstacles. A snapshot of the chemical processor is inputted to a cellular automaton. The automaton behaves like a discrete excitable media; also, every cell of the automaton is supplied with a pointer that shows an origin of the cell's excitation. The excitation spreads along the cells corresponding to precipitate depleted sites of the chemical processor. When the destination-site is excited, waves travel on the lattice and update the orientations of the pointers. Thus, the automaton constructs a spanning tree, made of pointers, that guides a traveler towards the destination point. Thus, the automaton medium generates an attractive field and combination of this attractive field with the repulsive field, generated by the chemical processor, provides us with a solution of the collision-free path problem, (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:727 / 736
页数:10
相关论文
共 31 条
[1]  
Adamatzky A, 1997, ADV MATER OPT ELECTR, V7, P135, DOI 10.1002/(SICI)1099-0712(199705)7:3<135::AID-AMO302>3.0.CO
[2]  
2-V
[3]  
Adamatzky A., 2017, Advances in Unconventional Computing: Volume 1: Theory (Emergence, Complexity and Computation)
[4]  
Adamatzky A., 1994, NEURAL NETWORKS WORL, V3, P241
[5]   Voronoi-like partition of lattice in cellular automata [J].
Adamatzky, AI .
MATHEMATICAL AND COMPUTER MODELLING, 1996, 23 (04) :51-66
[6]   Computation of shortest path in cellular automata [J].
Adamatzky, AI .
MATHEMATICAL AND COMPUTER MODELLING, 1996, 23 (04) :105-113
[7]   Finding the optimal path with the aid of chemical wave [J].
Agladze, K ;
Magome, N ;
Aliev, R ;
Yamaguchi, T ;
Yoshikawa, K .
PHYSICA D-NONLINEAR PHENOMENA, 1997, 106 (3-4) :247-254
[8]  
BABLOYANTZ A, 1991, NATO ADV SCI I B-PHY, V244, P343
[9]   BIOLOGICAL SHAPE AND VISUAL SCIENCE .1. [J].
BLUM, H .
JOURNAL OF THEORETICAL BIOLOGY, 1973, 38 (02) :205-287
[10]  
Blum Harry, 1967, TRANSFORMATION EXTRA, V43, P2