Abstract
For the traveling salesman problem (TSP) which is also an important aspect for mobile robots, a continuous Hopfield neural network based on dynamic step is applied to solve TSP. For combinatorial optimization problems such as TSP can be mapped to a Continuous Hopfield neural network (CHNN). The dynamic step size is used to replace the fixed step size, which can solve the problem of the mutual restriction between the convergence precision and the convergence speed. The energy function is designed to represent the path length. The energy of network is constantly updated and converged to a minimum value eventually. Meanwhile, the optimal solution is obtained for TSP. Simulation results show that the proposed algorithm can accelerate the convergence rate and obtain high precision optimization results for TSP.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
