The Hopfield-Tank neural network applied to the mobile agent planning problem

Mobile agent planning (MAP) is increasingly viewed as an important technique of information retrieval systems to provide location aware services of minimum cost in mobile computing environment. Although Hopfield-Tank neural network has been proposed for solving the traveling salesperson problem, little attention has been paid to the time constraints on resource validity for optimizing the cost of the mobile agent. Consequently, we modify Hopfield-Tank neural network and design a new energy function to not only cope with the dynamic temporal features of the computing environment, in particular the server performance and network latency when scheduling mobile agents, but also satisfy the location-based constraints such as the starting and end node of the routing sequence must be the home site of the traveling mobile agent. In addition, the energy function is reformulated into a Lyapunov function to guarantee the convergent stable state and existence of the valid solution. Moreover, the objective function is derived to estimate the completion time of the valid solutions and predict the optimal routing path. Simulations study was conducted to evaluate the proposed model and algorithm for different time variables and various coefficient values of the energy function. The experimental results quantitatively demonstrate the computational power and speed of the proposed model by producing solutions that are very close to the minimum costs of the location-based and time-constrained distributed MAP problem rapidly. The spatio-temporal technique proposed in this work is an innovative approach in providing knowledge applicable to improving the effectiveness of solving optimization problems.