Cellular ANTomata: Food-finding and maze-threading

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2008, Pages 528-535

  Rosenberg, Arnold L ^a  

^a Veterinary Dentistry and Oral Surgery   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARKS; ROBOTICS;

CONSTRAINED ENVIRONMENTS;

ROBOTS;

EID: 55849102513     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2008.13     Document Type: Conference Paper

References (19)

1. A.W. Burks (Ed.) (1970): Essays on Cellular Automata. Univ. Illinois Press, Urbana-Champaign, IL.
2. L. Chen, X. Xu, Y. Chen, P. He (2004): A novel ant clustering algorithm based on cellular automata. IEEE/WIC/ACM Intl. Conf. Intelligent Agent Technology.
3. D. Chowdhury, V. Guttal, K. Nishinari, A. Schadschneider (2002): A cellular-automata model of flow in ant trails: non-monotonic variation of speed with density. J. Phys. A: Math. Gen. 35, L573-L577.
4. S.N. Cole (1966): Real-time computation by n-dimensional iterative arrays of finite-state machines. 7th IEEE Symp. on Foundations of Computer Science, 53-77.
5. G. Folino, G. Mendicino, A. Senatore, G. Spezzano, S. Straface (2006): A model based on cellular automata for the parallel simulation of 3D unsaturated flow. Parallel Computing 32, 357-376.
6. D. Geer (2005): Small robots team up to tackle large tasks. IEEE Distributed Systems Online, vol. 6, no. 12.
7. E. Goles and S. Martinez (Eds.) (1999): Cellular Automata and Complex Systems. Kluwer, Amsterdam.
8. J. Gruska, S. La Torre, M. Parente (2004): Optimal time and communication solutions of firing squad synchronization problems on square arrays, toruses and rings. In Developments in Language Theory (C.S Calude, E. Calude, M.J. Dinneen, Eds.) Lecture Notes in Computer Science 3340, Springer-Verlag, Berlin, 200-211.
9. E.D. Innis (2006): Tessellated Finite Automata for the Control of Autonomous Agents. Senior Honors Thesis, Univ. Massachusetts.
10. http://www.kivasystems.com/
11. F. Marchese (1996): Cellular automata in robot path planning. EUROBOT'96, 116-125.
12. E.F. Moore (1962): The firing squad synchronization prolem. In Sequential Machines, Selected Papers (E.F. Moore, Ed.), Addison-Wesley, Reading, MA, pp. 213-214.
13. M.O. Rabin and D. Scott (1959): Finite automata and their decision problems. IBM J. Res. Develop. 3, 114-125.
14. A.L. Rosenberg (2007): Cellular ANTomata. 5th Intl. Symp. on Parallel and Distributed Processing and Applications. In Lecture Notes in Computer Science 4742, Springer-Verlag, New York (2007) 78-90.
15. J.C. Shepherdson (1959): The reduction of two-way automata to one-way automata. IBM J. Res. Develop. 3, 198-200.
16. G. Spezzano and D. Talia (1998): The CARPET programming environment for solving scientific problems on parallel computers. Parallel and Distributed Computing Practices 1, 49-61.
17. J. von Neumann (1966): The Theory of Self-reproducing Automata. (Edited and completed by A.W. Burks) Univ. of Illinois Press, Urbana-Champaign, IL.
18. S. Wolfram (Ed.) (1986): Theory and Application of Cellular Automata. Addison-Wesley, Reading, MA.
19. S. Wolfram (1994): Cellular Automata and Complexity: Collected Papers. Addison-Wesley, Reading, MA.