Abstract
An attack-defense confrontation problem arises from a robot swarm attacking a territory protected by another one. In denied environments, global positioning and communication are hardly available. It becomes difficult for a swarm to realize collaboration and handle confrontation against another. Commonly-used deep reinforcement learning relies on pre-training, which is time-consuming and has strong environmental dependence, especially in denied environments. To study attack strategies in denied environments, this work proposes a novel Evolutionary Algorithm-based Attack Strategy with Swarm Robots for the first time. Each robot obtains its situation information through perceiving its nearby peers and enemies. Such information is utilized to evaluate the benefits or threats of a robot’s next perceptible attack positions. Then, each robot uses the evolutionary algorithm to optimize its fitness function and searches for its optimal position. A collision avoidance strategy is integrated into the algorithm. Hence, a robot swarm realizes collaboration and handles confrontation as long as each robot can sense its surroundings. They utilize their own sensors to detect others locally without using global positioning and communication devices. The experimental analyses show that the evolutionary algorithm-based attack strategy has better scalability and more potential in solving large-scale confrontational problems than the deep reinforcement learning-based algorithms. Rationales of the proposed method is presented to verify the great capability of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.