Automatic search algorithms for near-field ferromagnetic targets based on magnetic anomaly detection

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For searching and detecting near-field unknown ferromagnetic targets, four automatic search algorithms are proposed based on magnetic anomaly information from any position on planes or in space. Firstly, gradient search algorithms and enhanced gradient search algorithms are deduced using magnetic modulus anomaly information and magnetic vector anomaly information. In each algorithm, there are plane search forms and space search forms considering different practical search situations. Then the magnetic anomaly space data of typical magnetic source of oblique magnetization are forwardly simulated by ANSYS MAXWELL software. The plane distributions of some variables are numerically computed and the search destinations of different algorithms are predicted. Four automatic search algorithms are applied to simulate search paths on three characteristic orthogonal planes and in whole solution space. The factor affecting the performance of algorithms is analyzed. Features of each algorithm in different conditions are analyzed and suitable applications are discussed and verified by the experiment. The results show that proposed search algorithms require few prior information and have real-time performance for searching and tracking magnetic anomaly target.

Cite

CITATION STYLE

APA

Zhang, M., Wang, H., Ge, L., Cheng, H., & Cheng, F. (2018). Automatic search algorithms for near-field ferromagnetic targets based on magnetic anomaly detection. Mathematical Problems in Engineering, 2018. https://doi.org/10.1155/2018/2130236

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free