Motion-encoded Gravitational Search Algorithm for moving target search using UAVs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Bastami S.; Dolatshahi M.B.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2022 | Volume:10 | Issue:2 Page(s): 63-73

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Motion-encoded Gravitational Search Algorithm for moving target search using UAVs

Author(s)

Bastami S. | Dolatshahi M.B. | Issue Writer Certificate

Keywords

OptimizationQ4

target searchQ4

gravitational search algorithmQ4

motion codingQ4

dronesQ4

Abstract

In this paper, a new algorithm called motion coding gravitational search algorithm (MGSA) is proposed to find a moving target using a unmanned aerial vehicles (UAVs). Using the laws of physics and the properties of the earth, each dimension has its own equation of motion based on the type of variable. Many traditional exploratory methods can not achieve the desired solution in high-dimensional spaces to search for a moving target. The Optimization process of the gravitational search algorithm, which is based on the gravitational interaction between particles, the dependence on the distance and the relationship between mass values, and the fit calculation, make this algorithm unique. In this paper, the proposed MGSA algorithm is proposed to solve the path complexity challenge problem in order to find the moving target through motion coding using UAVs. A set of particles in the path of search for the target will reach a near-optimal solution through the gravity constant, weight factor, force and distance, which evolved with many search scenarios in a GSA algorithm. This coded method of motion makes it possible to preserve important particle properties, including the optimum global motion. The results of the existing simulation show that the proposed MGSA improves the detection performance by 12% and the time performance by 1. 71 times compared to APSO. It works better.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops