Abstract

The objective is to find Cellular Automata (CA) which are able to cover the 2D space by a minimum number of so-called “Sensor Tiles”. A sensor tile consists of a central sensor pixel and 12 surrounding sensing pixels. Two probabilistic CA rules were designed that can perform this task. The first rule evolves very fast stable sub–optimal coverings, starting from a random configuration. The second rule finds several optimal or near-optimal coverings but needs much more time for their evolution.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.