Localization Algorithm Based on a Spring Particle Model (LASPM) for Large-Scale Unmanned Aerial Vehicle Swarm (UAVs)

Localization Algorithm Based on a Spring Particle Model (LASPM) for Large-Scale Unmanned Aerial Vehicle Swarm (UAVs)

Sanfeng Chen, Guangming Lin, Tao Hu, Hui Wang, Zhouyi Lai
DOI: 10.4018/IJCINI.333635
Article PDF Download
Open access articles are freely available for download

Abstract

A new localization algorithm based on large scale unmanned aerial vehicle swarm (UAVs) is proposed in the paper. The localization algorithm is based on a spring particle model (LASPM). It simulates the dynamic process of physical spring particle system. The UAVs form a special mobile wireless sensor network. Each UAV works as a highly-dynamic mobile sensor node. Only a few mobile sensor nodes are equipped with GPS localization devices, which are anchor nodes, and the other nodes are blind nodes. The mobile sensor nodes are set as particles with masses and connected with neighbor nodes by virtual springs. The virtual springs will force the particles to move to the original positions. The blind nodes' position can be inferred with the LASPM algorithm. The computational and communication complexity doesn't increase with the network scale size. The proposed algorithm can not only reduce the computational complexity, but also maintain the localization accuracy. The simulation results show the algorithm is effective.
Article Preview
Top

Introduction

The development of unmanned aerial vehicle (UAV) swarm poses a great challenge to the localization system of the UAVs (Chen et al., 2021). To swarming UAVs, their positions are essential for a variety of collaborative operations, including navigation(Chen et al., 2022), motion control(Wu et al.,2021), and mission completion (Gupta et al., 2016; Villas et al., 2013). There are a number of localization schemes(Moon et al., 2022; Mozaffari et al., 2019; Xiong et al., 2021), among which the global positioning system (GPS) is one of the most representative technologies (Youn et al., 2021; Goel et al., 2017). However, the location estimation performance of GPS has been found to be unreliable in some closed and isolated environments(Qi et al., 2020), such as urban canyons and indoor spaces (Zhou et al., 2019). The other localization and navigation methods, such as inertia navigation (Svacha et al., 2020), have large error accumulations that cannot be used in long-distance navigation (Gribben et al., 2014). Wireless sensor network technologies can be used for the UAVs’ localization and navigation (Chen, et al., 2017). The wireless sensor nodes are deployed with the UAVs(Alzenad et al., 2017; Yang et al., 2017) . However, with the increase of operation area and scale of UAVs, a large number of sensor nodes need to be deployed(Alzenad et al., 2018;Kim et al., 2010), thereby constituting a large-scale wireless sensor network(Chen et al., 2018;Gao et al., 2021). A large-scale sensor network contains thousands of sensor nodes, and the complexity of the network becomes very sensitive to the sensors’ scale(Yin et al., 2020). Examples include computational complexity, time complexity, and communication complexity. Now developing a low-complexity and high-energy efficient localization algorithm for large-scale sensor networks on UAVs is very urgent.

To solve these problems, we propose a UAV system with some movable Ultra Wideband (UWB) anchors. A base station controls several anchor UAVs. Each anchor UAV is equipped with a UWB anchor and real-time kinematic (RTK)-GPS capabilities. The blind nodes are equipped with CC2431 chips, which can be determined from the proposed LASPM algorithm by calculating the related forces with the neighbor anchor nodes. The diagram of a localization model for swarming UAVs is shown in Figure 1.

Figure 1.

The diagram of localization model for swarming UAVs

IJCINI.333635.f01

The LASPM localization algorithm is based on a spring model that is suitable for large-scale sensor networks. The complexity of each sensor node is O(1), which does not increase proportionally with the scale of sensor networks. In this model, the sensor nodes are represented by particles with mass. The connection information between each pair of neighbor nodes is represented by a spring that connects this pair of nodes. The distance between this pair of neighbor nodes is represented by the original length of the spring. To localize the positions of blind nodes, we imagine that these blind particles are first drawn to random virtual positions by extra forces, and then these particles will go back to their stable positions virtually by the forces of springs.

In this paper we describe the LASPM localization algorithm, share the simulation results, and offer our conclusions.

Top

Localization Algorithm Based On Spring Particle Model (Laspm)

The proposed localization algorithm is based on the following assumptions:

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2024)
Volume 17: 1 Issue (2023)
Volume 16: 1 Issue (2022)
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing