Target search using swarm robots with kinematic constraints

Author(s):  
Xue Songdong ◽  
Zeng Jianchao ◽  
Du Jing
2014 ◽  
Vol 7 (3) ◽  
pp. 297 ◽  
Author(s):  
Guo You Zhang ◽  
Jian Chao Zeng ◽  
Song Dong Xue

2021 ◽  
Vol 15 ◽  
Author(s):  
You Zhou ◽  
Anhua Chen ◽  
Xinjie He ◽  
Xiaohui Bian

In order to deal with the multi-target search problems for swarm robots in unknown complex environments, a multi-target coordinated search algorithm for swarm robots considering practical constraints is proposed in this paper. Firstly, according to the target detection situation of swarm robots, an ideal search algorithm framework combining the strategy of roaming search and coordinated search is established. Secondly, based on the framework of the multi-target search algorithm, a simplified virtual force model is combined, which effectively overcomes the real-time obstacle avoidance problem in the target search of swarm robots. Finally, in order to solve the distributed communication problem in the multi-target search of swarm robots, a distributed neighborhood communication mechanism based on a time-varying characteristic swarm with a restricted random line of sight is proposed, and which is combined with the multi-target search framework. For the swarm robot kinematics, obstacle avoidance, and communication constraints of swarm robots, the proposed multi-target search strategy is more stable, efficient, and practical than the previous methods. The effectiveness of this proposed method is verified by numerical simulations.


Author(s):  
Qirong Tang ◽  
Fangchao Yu ◽  
Yuan Zhang ◽  
Jingtao Zhang
Keyword(s):  

2021 ◽  
Vol 11 (5) ◽  
pp. 2383
Author(s):  
Zool Hilmi Ismail ◽  
Mohd Ghazali Mohd Hamami

Target searching is a well-known but difficult problem in many research domains, including computational intelligence, swarm intelligence, and robotics. The main goal is to search for the targets within the specific boundary with the minimum time that is required and the obstacle avoidance that has been equipped in place. Swarm robotics (SR) is an extension of the multi-robot system that particularly discovers a concept of coordination, collaboration, and communication among a large number of robots. Because the robots are collaborating and working together, the task that is given will be completed faster compared to using a single robot. Thus, searching for single or multiple targets with swarm robots is a significant and realistic approach. Robustness, flexibility, and scalability, which are supported by distributed sensing, also make the swarm robots strategy suitable for target searching problems in real-world applications. The purpose of this article is to deliver a systematic literature review of SR strategies that are applied to target search problems, so as to show which are being explored in the fields as well as the performance of current state-of-the-art SR approaches. This review extracts data from four scientific databases and filters with two established high-indexed databases (Scopus and Web of Science). Notably, 25 selected articles fell under two main categories in environment complexity, namely empty space and cluttered. There are four strategies which have been compiled for both empty space and cluttered categories, namely, bio-inspired mechanism, behavior-based mechanism, random strategy mechanism, and hybrid mechanism.


Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1606
Author(s):  
Haiyun Shi ◽  
Jie Li ◽  
Zhi Li

Searching multiple targets with swarm robots is a realistic and significant problem. The goal is to search the targets in the minimum time while avoiding collisions with other robots. In this paper, inspired by pedestrian behavior, swarm robotic pedestrian behavior (SRPB) was proposed. It considered many realistic constraints in the multi-target search problem, including limited communication range, limited working time, unknown sources, unknown extrema, the arbitrary initial location of robots, non-oriented search, and no central coordination. The performance of different cooperative strategies was evaluated in terms of average time to find the first, the half, and the last source, the number of located sources and the collision rate. Several experiments with different target signals, fixed initial location, arbitrary initial location, different population sizes, and the different number of targets were implemented. It was demonstrated by numerous experiments that SRPB had excellent stability, quick source seeking, a high number of located sources, and a low collision rate in various search strategies.


Sign in / Sign up

Export Citation Format

Share Document