Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

Models and metaphors: complexity theory and through-life management in the built environment

Complexity thinking may have both modelling and metaphorical applications in the through-life management of the built environment. These two distinct approaches are examined and compared. In the first instance, some of the sources of complexity in the design, construction and maintenance of the built environment are identified. The metaphorical use of complexity in management thinking and its application in the built environment are briefly examined. This is followed by an exploration of modelling techniques relevant to built environment concerns. Non-linear and complex mathematical techniques such as fuzzy logic, cellular automata and attractors, may be applicable to their analysis. Existing software tools are identified and examples of successful built environment applications of complexity modelling are given. Some issues that arise include the definition of phenomena in a mathematically usable way, the functionality of available software and the possibility of going beyond representational modelling. Further questions arising from the application of complexity thinking are discussed, including the possibilities for confusion that arise from the use of metaphor. The metaphor of a 'commentary machine' is suggested as a possible way forward and it is suggested that an appropriate linguistic analysis can in certain situations reduce perceived complexity

Linking Climate Change and Socio-economic Impact for Long-term Urban Growth in Three Mega-cities

Urbanization has become a global trend under the impact of population growth, socio-economic development, and globalization. However, the interactions between climate change and urban growth in the context of economic geography are unclear due to missing links in between the recent planning megacities. This study aims to conduct a multi-temporal change analysis of land use and land cover in New York City, City of London, and Beijing using a cellular automata-based Markov chain model collaborating with fuzzy set theory and multi-criteria evaluation to predict the city\u27s future land use changes for 2030 and 2050 under the background of climate change. To determine future natural forcing impacts on land use in these megacities, the study highlighted the need for integrating spatiotemporal modeling analyses, such as Statistical Downscale Modeling (SDSM) driven by climate change, and geospatial intelligence techniques, such as remote sensing and geographical information system, in support of urban growth assessment. These SDSM findings along with current land use policies and socio-economic impact were included as either factors or constraints in a cellular automata-based Markov Chain model to simulate and predict land use changes in megacities for 2030 and 2050. Urban expansion is expected in these megacities given the assumption of stationarity in urban growth process, although climate change impacts the land use changes and management. More land use protection should be addressed in order to alleviate the impact of climate change

Exploring the potential climate change impact on urban growth in London by a cellular automata-based Markov chain model

This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this record.Urbanization has become a global trend under the combined influence of population growth, socioeconomic development, and globalization. Even though recent urban planning in London has been more deliberate, the relationships between climate change and urban growth in the context of economic geography are still somewhat unclear. This study relies on rainfall prediction with the aid of the Statistical DownScaling Model (SDSM), which provides the statistical foundation for future flooding potential within the urban space of London while considering major socioeconomic policies related to land use management. These SDSM findings, along with current land use policies, were included as other factors or constraints in a cellular automata-based Markov Chain model to simulate and predict land use changes in London for 2030 and 2050. Two scenarios with the inclusion and exclusion of flood impact factor, respectively, were applied to evaluate the impact of climate change on urban growth. Findings indicated: (1) mean monthly projected precipitation derived by SDSM is expected to increase for the year 2030 in London, which will affect the flooding potential and hence the area of open space; (2) urban and open space are expected to increase > 16 and 20km 2 (in percentage of 1.51 and 1.92 compared to 2012) in 2030 and 2050, respectively, while agriculture is expected to decrease significantly due to urbanization and climate change; (3) the inclusion of potential flood impact induced from the future precipitation variability drives the development toward more open space and less urban area.The research is supported by the Global Innovation Initiative (British Council Grant No. Gll206), funded by the British Council and the Department for Business, Innovation and Skills

Use of cellular automata in the study of variables involved in land use changes

The study of changes in land use has been included lately in territorial processes in order to opti- mize future management decisions. The different functions that the territory plays (production, aesthetic, and natural functions, etc.) make planning choices more difficult. This work focuses on the selection and combination of a set of indicators to analyze the variables through which the changes occur in the land used in viticulture for wine production. The proposed approach makes use of the Geographic Information System (GIS) in the development of a map of land use scenario. It is applied to a case study through a model involving cellular automata (CA) implemented with maps of suitability for viticulture and Markov chains. The use in this case of the CA is aimed at validating the scenario map in order to deduce the variables and the orientations of the farmers in the field of wine production

Sublinearly space bounded iterative arrays

Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata. In this note, realtime-lAs with sublinear space bounds are used to accept formal languages. The existence of a proper hierarchy of space complexity classes between logarithmic anel linear space bounds is proved. Furthermore, an optimal spacc lower bound for non-regular language recognition is shown. Key words: Iterative arrays, cellular automata, space bounded computations, decidability questions, formal languages, theory of computatio