We numerically study the existence of travelling breathers in KleinGordon chains, which consist of one-dimensional networks of nonlinear oscillators in an anharmonic on-site potential, linearly coupled to their nearest neighbors. Travelling breathers are spatially localized solutions having the property of being exactly translated by p sites along the chain after a fixed propagation time T (the...

Abstract. This paper will present a path planning technique for autonomous mobile robot, based on the representation of the environment as a cognitive map through a spiking neural network (SNN) of O’Keefe place cells. The method is based on the concept of the travelling wave. For this purpose, we use a biologically plausible neural model (Izhikevitch model) which is the medium of a travelling w...

With the economic development and the improvement of residents' income level, China’s tourism industry is now entering into a new historical period. In this paper, we construct an empirical analysis model about urban residents’ rural travelling decision-making, and then analyze influential factors mechanism by using logistic regression model. Based on the analysis of rural travelling decision-m...

The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms. Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods. The proposed methods were also compared t...

We study coarse pattern formation in a cellular automaton modelling a spatially-extended stochastic neural network. The model, originally proposed by Gong and Robinson (Phys Rev E 85(5):055,101(R), 2012), is known to support stationary and travelling bumps of localised activity. We pose the model on a ring and study the existence and stability of these patterns in various limits using a combina...

We prove that every simple bridgeless cubic graph with n ≥ 8 vertices has a travelling salesman tour of length at most 1.3 · n − 2, which can be constructed in polynomial time.