Abstract
In the context of group interaction among mobile robots, there arises the challenge of task distribution within the group, considering the robots' characteristics and the working environment. This study aims to modify the Hopfield neural network and develop methodologies for its application in solving the task allocation problem for an arbitrary number of tasks within a group of mobile robots. To achieve this, the Hopfield neural network is represented as a graph. An algorithm is presented, demonstrating the transition from the initial problem to the Traveling Salesman Problem (TSP). The application of the Hopfield model to the task distribution problem in a group of robots is described, along with the development of an optimization function calculation algorithm. An assessment is conducted to evaluate the impact of neural network parameters on the quality and speed of solving the optimization problem. By comparing it with other heuristic methods (genetic and ant colony algorithms), the domains of application for the modified algorithm are determined.
Published Version
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.
