Abstract
Multisource location is a significant application in the field of robot swarm and is required to find all sources whose number and distribution are unknown in advance. With few parameters and fast search, particle swarm optimizer (PSO) variants that have certain grouping capability have been applied to address multisource location problems (MSLPs) by dividing a swarm such that every source has robots to locate. However, they are difficult to predetermine the exact number of groups, require a big number of robots, and are easily trapped in the no-signal areas when the proportion of no-signal areas is high. This work proposes a virtual-source and virtual-swarm-based PSO (VVPSO) to divide a search area into multiple cells equally, each of which has a virtual source in its center. Then, instead of robots grouping, only one group of robots is employed to traverse all virtual sources, and search their corresponding cells to locate real sources by a new PSO called real-virtual mapping PSO (RMPSO). RMPSO asymmetrically maps a robot into a particle swarm with multiple virtual particles to perform PSO, which greatly reduces the requirements for the number of robots. Experimental results show that VVPSO has great search scalability and can solve large-scale MSLPs than two state-of-the-art grouping methods and three representative multimodal PSO variants, even with only one robot. Hence, this work greatly advances the field of multisource location by using mobile robot swarm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 963-976 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Evolutionary Computation |
| Volume | 29 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2025 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Computational Theory and Mathematics
Keywords
- Multisource location
- no-signal areas
- particle swarm optimizer (PSO)
- robot swarm
- swarm robotics
- virtual source
- virtual swarm