Skip to main content
Log in

An improved adaptive hybrid firefly differential evolution algorithm for passive target localization

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper considers a passive target localization problem based on the noisy time of arrival measurements obtained from multiple receivers and a single transmitter. The maximum likelihood (ML) estimator for this localization problem is formulated as a highly nonlinear and non-convex optimization problem, where conventional optimization methods are not suitable for solving such a problem. Consequently, this paper proposes an improved adaptive hybrid firefly differential evolution (AHFADE) algorithm, based on hybridization of firefly algorithm (FA) and differential evolution (DE) algorithm to estimate the unknown position of the target. The proposed AHFADE algorithm dynamically adjusts the control parameters, thus maintaining high population diversity during the evolution process. This paper aims to improve the accuracy of the global optimal solution by incorporating evolutionary operators of the DE in different searching stages of the FA. In this regard, an adaptive parameter is employed to select an appropriate mutation operator for achieving a proper balance between global exploration and local exploitation. In order to efficiently solve the ML estimation problem, this paper proposes the well-known semidefinite programming (SDP) method to convert the non-convex problem into a convex one. The simulation results obtained from the proposed AHFADE algorithm and well-known algorithms, such as SDP, DE and FA, are compared against Cramér–Rao lower bound (CRLB). The statistical analysis has been performed to compare the performance of the proposed AHFADE algorithm with several well-known algorithms on CEC2014 benchmark problems. The obtained simulation results show that the proposed AHFADE algorithm is more robust in high-noise environments compared to existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Alweshah M, Abdullah S (2015) Hybridizing firefly algorithms with a probabilistic neural network for solving classification problems. Appl Soft Comput 35:513–524

    Google Scholar 

  • Arora JS (2004) Introduction to optimum design. Elsevier, Amsterdam

    Google Scholar 

  • Asmaa L, Hatim KA, Abdelaaziz M (2014) Localization algorithms research in wireless sensor network based on multilateration and trilateration techniques. In: 2014 3rd IEEE international colloquium in information science and technology (CIST), IEEE, pp 415–419

  • Awad NH, Ali MZ, Mallipeddi R, Suganthan PN (2018) An improved differential evolution algorithm using efficient adapted surrogate model for numerical optimization. Inf Sci 451:326–347

    MathSciNet  Google Scholar 

  • Aydilek IB (2018) A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems. Appl Soft Comput 66:232–249

    Google Scholar 

  • Baraldi P, Cannarile F, Di Maio F, Zio E (2016) Hierarchical k-nearest neighbours classification and binary differential evolution for fault diagnostics of automotive bearings operating under variable conditions. Eng Appl Artif Intell 56:1–13

    Google Scholar 

  • Bishop AN, Fidan B, Anderson BD, Doğançay K, Pathirana PN (2010) Optimality analysis of sensor-target localization geometries. Automatica 46(3):479–492

    MathSciNet  MATH  Google Scholar 

  • Biswas P, Liang TC, Toh KC, Ye Y, Wang TC (2006) Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans Autom Sci Eng 3(4):360–371

    Google Scholar 

  • Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Brest J, Greiner S, Boskovic B, Mernik M, Zumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evol Comput 10(6):646–657

    Google Scholar 

  • Cakir O, Kaya I, Yazgan A, Cakir O, Tugcu E (2014) Emitter location finding using particle swarm optimization. Radioengineering 23(1):252–258

    Google Scholar 

  • Chalise BK, Zhang YD, Amin MG, Himed B (2014) Target localization in a multi-static passive radar system through convex optimization. Signal Process 102:207–215

    Google Scholar 

  • Chan FK, So HC, Ma WK, Lui KW (2013) A flexible semi-definite programming approach for source localization problems. Digital Signal Process 23(2):601–609

    MathSciNet  Google Scholar 

  • Choi KH, Ra WS, Park SY, Park JB (2014) Robust least squares approach to passive target localization using ultrasonic receiver array. IEEE Trans Ind Electr 61(4):1993–2002

    Google Scholar 

  • Chowdhury TJ, Elkin C, Devabhaktuni V, Rawat DB, Oluoch J (2016) Advances on localization techniques for wireless sensor networks: A survey. Comput Netw 110:284–305

    Google Scholar 

  • Coluccia A, Fascista A (2018) On the hybrid TOA/RSS range estimation in wireless sensor networks. IEEE Trans Wirel Commun 17(1):361–371. https://doi.org/10.1109/TWC.2017.2766628

    Article  Google Scholar 

  • Cui L, Li G, Lin Q, Chen J, Lu N (2016) Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations. Comput Oper Res 67:155–173

    MathSciNet  MATH  Google Scholar 

  • Das S, Mullick SS, Suganthan PN (2016) Recent advances in differential evolution: an updated survey. Swarm Evol Comput 27:1–30

    Google Scholar 

  • Deak G, Curran K, Condell J (2012) A survey of active and passive indoor localisation systems. Comput Commun 35(16):1939–1954

    Google Scholar 

  • Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18

    Google Scholar 

  • Destino G, Abreu G (2011) On the maximum likelihood approach for source and network localization. IEEE Trans Signal Process 59(10):4954–4970

    MathSciNet  MATH  Google Scholar 

  • Einemo M, So HC (2015) Weighted least squares algorithm for target localization in distributed MIMO radar. Signal Process 115:144–150

    Google Scholar 

  • Goel R, Maini R (2018) A hybrid of ant colony and firefly algorithms (hafa) for solving vehicle routing problems. J Comput Sci 25:28–37

    MathSciNet  Google Scholar 

  • Goyal S, Patterh MS (2014) Wireless sensor network localization based on cuckoo search algorithm. Wirel Pers Commun 79(1):223–234

    Google Scholar 

  • Grant M, Boyd S (2008) Graph implementations for nonsmooth convex programs. In: Blondel V, Boyd S, Kimura H (eds) Recent advances in learning and control, lecture notes in control and information sciences. Springer-Verlag Limited, Berlin, pp 95–110

    Google Scholar 

  • Grant M, Boyd S (2014) CVX: Matlab software for disciplined convex programming, version 2.1. http://cvxr.com/cvx

  • Guo L, Wang GG, Wang H (2013) Wang D (2013) An effective hybrid firefly algorithm with harmony search for global numerical optimization. Sci World J

  • Halder S, Ghosal A (2016) A survey on mobile anchor assisted localization techniques in wireless sensor networks. Wirel Netw 22(7):2317–2336. https://doi.org/10.1007/s11276-015-1101-2

    Article  Google Scholar 

  • Harikrishnan R, Kumar VJS, Ponmalar PS (2016) A comparative analysis of intelligent algorithms for localization in wireless sensor networks. Wirel Pers Commun 87(3):1057–1069. https://doi.org/10.1007/s11277-015-2635-4

    Article  Google Scholar 

  • Huang B, Xie L, Yang Z (2015) TDOA-based source localization with distance-dependent noises. IEEE Trans Wirel Commun 14(1):468–480

    Google Scholar 

  • Jiang Y, Liu M, Chen T, Gao L (2018) TDOA passive location based on cuckoo search algorithm. J Shanghai Jiaotong Univ (Sci) 23(3):368–375

    Google Scholar 

  • Kaur A, Kumar P, Gupta GP (2016) A novel DV-Hop algorithm based on gauss-newton method. In: 2016 4th international conference on parallel. Distributed and grid computing (PDGC), IEEE, pp 625–629

  • Kocuk B, Dey S, Sun X (2016) Strong SOCP relaxations for the optimal power flow problem. Oper Res 64:1177–1196

    MathSciNet  MATH  Google Scholar 

  • Kuila P, Gupta SK, Jana PK (2013) A novel evolutionary approach for load balanced clustering problem for wireless sensor networks. Swarm Evol Comput 12:48–56

    Google Scholar 

  • Kulkarni VR, Desai V, Kulkarni RV (2019) A comparative investigation of deterministic and metaheuristic algorithms for node localization in wireless sensor networks. Wirel Netw 25(5):2789–2803

    Google Scholar 

  • Li Z, Chung PJ, Mulgrew B (2017) Distributed target localization using quantized received signal strength. Signal Process 134:214–223

    Google Scholar 

  • Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the cec 2014 special session and competition on single objective real-parameter numerical optimization. Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, Computational Intelligence Laboratory, p 635

  • Lieu QX, Do DTT, Lee J (2018) An adaptive hybrid evolutionary firefly algorithm for shape and size optimization of truss structures with frequency constraints. Comput Struct 195:99–112

    Google Scholar 

  • Lin L, So HC, Chan FK, Chan YT, Ho K (2013) A new constrained weighted least squares algorithm for TDOA-based localization. Signal Process 93(11):2872–2878

    Google Scholar 

  • Luthra J, Pal SK (2011) A hybrid firefly algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher. In: Information and communication technologies (WICT), 2011 world congress on, IEEE, pp 202–206

  • Mohamed AW (2017) Almazyad AS (2017) Differential evolution with novel mutation and adaptive crossover strategies for solving large scale global optimization problems. Appl Comput Intell Soft Comput

  • Mohamed AW, Suganthan PN (2018) Real-parameter unconstrained optimization based on enhanced fitness-adaptive differential evolution algorithm with novel mutation. Soft Computing 22(10):3215–3235

    Google Scholar 

  • Noroozi A, Sebt MA (2015) Target localization from bistatic range measurements in multi-transmitter multi-receiver passive radar. IEEE Signal Process Lett 22(12):2445–2449

    Google Scholar 

  • Qian W, Chai J, Xu Z, Zhang Z (2018) Differential evolution algorithm with multiple mutation strategies based on roulette wheel selection. Appl Intell 48:3612–3629

    Google Scholar 

  • Qu X, Xie L (2016) An efficient convex constrained weighted least squares source localization algorithm based on TDOA measurements. Signal Process 119:142–152

    Google Scholar 

  • Rao SS, Rao SS (2009) Engineering optimization: theory and practice. John Wiley & Sons, New Jersey

    Google Scholar 

  • Sachs J (2013) Handbook of ultra-wideband short-range sensing: theory sensors, applications. John Wiley & Sons, New Jersey

    MATH  Google Scholar 

  • Sadowski S, Spachos P (2018) RSSI-based indoor localization with the internet of things. IEEE Access 6:30149–30161

    Google Scholar 

  • Shen J, Molisch AF, Salmi J (2012) Accurate passive location estimation using TOA measurements. IEEE Trans Wirel Commun 11(6):2182–2192

    Google Scholar 

  • Singh SP, Sharma S (2015) Range free localization techniques in wireless sensor networks: a review. Proc Comput Sci 57:7–16

    Google Scholar 

  • Storn R, Price K (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    MathSciNet  MATH  Google Scholar 

  • Tanabe R, Fukunaga A (2013) (2013) Success-history based parameter adaptation for differential evolution. Evolutionary computation (CEC). IEEE congress on, IEEE, pp 71–78

  • Wang G, Li Y, Ansari N (2013) A semidefinite relaxation method for source localization using TDOA and FDOA measurements. IEEE Trans Veh Technol 62(2):853–862

    Google Scholar 

  • Wang H, Cui Z, Sun H, Rahnamayan S, Yang XS (2017) Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism. Soft Comput 21(18):5325–5339

    Google Scholar 

  • Wang Y (2015) Linear least squares localization in sensor networks. EURASIP J Wirel Commun Netw 2015(1):51

    Google Scholar 

  • Wang Y, Wu Y (2016) An efficient semidefinite relaxation algorithm for moving source localization using TDOA and FDOA measurements. IEEE Commun Lett 21(1):80–83

    Google Scholar 

  • Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15(1):55–66

    Google Scholar 

  • Wang Y, Ma S, Chen CP (2014) TOA-based passive localization in quasi-synchronous networks. IEEE Commun Lett 18(4):592–595

    Google Scholar 

  • Wu G, Shen X, Li H, Chen H, Lin A, Suganthan PN (2018) Ensemble of differential evolution variants. Inf Sci 423:172–186

    MathSciNet  Google Scholar 

  • Wu N, Yuan W, Wang H, Kuang J (2016) TOA-based passive localization of multiple targets with inaccurate receivers based on belief propagation on factor graph. Digital Signal Process 49:14–23

    Google Scholar 

  • Wu P, Su S, Zuo Z, Guo X, Sun B, Wen X (2019) Time difference of arrival (TDoA) localization combining weighted least squares and firefly algorithm. Sensors 19(11):2554

    Google Scholar 

  • Xu S, Doğançay K (2015) Optimal sensor deployment for 3D AOA target localization. In: 2015 IEEE international conference on acoustics. Speech and signal processing (ICASSP), IEEE, pp 2544–2548

  • Yan J, Zhang X, Luo X, Wang Y, Chen C, Guan X (2018) Asynchronous localization with mobility prediction for underwater acoustic sensor networks. IEEE Trans Veh Technol 67(3):2543–2556

    Google Scholar 

  • Yang XS (2009) Firefly algorithms for multimodal optimization. In: International symposium on stochastic algorithms, Springer, pp 169–178

  • Yang XS (2010a) Firefly algorithm, levy flights and global optimization. In: Research and development in intelligent systems 26, Springer, pp 209–218

  • Yang XS (2010b) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-Inspired Comput 2(2):78–84

    Google Scholar 

  • Zekavat R, Buehrer RM (2011) Handbook of position location: theory, practice and advances, vol 27. John Wiley & Sons, New Jersey

    Google Scholar 

  • Zhang D, Fang Z, Wang Y, Sun H (2015a) Research on an improved DV-Hop localization algorithm based on PSODE in WSN. J Commun 10(9):

  • Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958

    Google Scholar 

  • Zhang L, Liu L, Yang XS, Dai Y (2016) A novel hybrid firefly algorithm for global optimization. PloS ONE 11(9):e0163230

    Google Scholar 

  • Zhang Y, Wei D, Fu W, Yang B (2014) Target positioning with GDOP assisted nodes selection algorithm in wireless sensor networks. Int J Distrib Sensor Netw 10(6):404812

    Google Scholar 

  • Zhang Y, Wang S, Ji G (2015b) A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng

Download references

Acknowledgements

The work of M. Simić was supported in part by Serbian Ministry of Education and Science under Grant TR32028.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maja B. Rosić.

Ethics declarations

Conflict of interest

Author Maja Rosić declares that she has no conflict of interest. Author Mirjana Simić declares that she has no conflict of interest. Author Predrag Pejović declares that he has no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A Derivation of CRLB

A Derivation of CRLB

From Eq. (8), the first partial derivative of the log-likelihood function with respect to \(\mathbf {x}\) is given as:

$$\begin{aligned}&\frac{{\partial \ln \left( {f\left( {{\tilde{\mathbf{d}}}\left| \mathbf {x} \right. } \right) } \right) }}{{\partial \mathbf {x}}}\nonumber \\&= - \frac{1}{2}\frac{\partial }{{\partial {\mathbf {x}}}}\left( {{{\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) }^T}{{\mathbf {C}}^{ - 1}}\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) } \right) ,\nonumber \\ \end{aligned}$$
(64)

where

$$\begin{aligned}&\frac{\partial }{{\partial {\mathbf {x}}}}\left( {{{\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) }^T}{{\mathbf {C}}^{ - 1}}\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) } \right) \nonumber \\&\quad = - 2\frac{{\partial {\mathbf {d}}{{\left( {\mathbf {x}} \right) }^T}}}{{\partial {\mathbf {x}}}}{{\mathbf {C}}^{ - 1}}\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) . \end{aligned}$$
(65)

Then, Eq. (64) can be expressed as:

$$\begin{aligned} \frac{{\partial \ln \left( {f\left( {{{\tilde{\mathbf{d}}}}\left| {\mathbf {x}} \right. } \right) } \right) }}{{\partial {\mathbf {x}}}} = \frac{{\partial {\mathbf {d}}{{\left( {\mathbf {x}} \right) }^T}}}{{\partial {\mathbf {x}}}}{{\mathbf {C}}^{ - 1}}\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) . \end{aligned}$$
(66)

Hence, taking the partial derivative with respect to x follows:

$$\begin{aligned} \frac{{\partial \ln \left( {f\left( {{{\tilde{\mathbf{d}}}}\left| {\mathbf {x}} \right. } \right) } \right) }}{{\partial {{x}}}} = \frac{{\partial {\mathbf {d}}{{\left( {\mathbf {x}} \right) }^T}}}{{\partial {{x}}}}{{\mathbf {C}}^{ - 1}}\left( {{{\tilde{\mathbf{d}}}} - {\mathbf {d}}\left( {\mathbf {x}} \right) } \right) . \end{aligned}$$
(67)

Then, the first diagonal element of the FIM can be derived as follows:

$$\begin{aligned} {I_{xx}}&= E\left[ {\left( {\frac{{\partial \ln \left( {f\left( {\left. {\tilde{\mathbf{d}}} \right| \mathbf {x}} \right) } \right) }}{{\partial {x}}}} \right) {{\left( {\frac{{\partial \ln \left( {f\left( {\left. {\tilde{\mathbf{d}}} \right| \mathbf {x}} \right) } \right) }}{{\partial {x}}}} \right) }^T}} \right] \nonumber \\&= E\left[ {{\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) }^T}{\mathbf {C}^{ - 1}}\left( {{\tilde{\mathbf{d}}} - \mathbf {d}\left( \mathbf {x} \right) } \right) {{\left( {{\tilde{\mathbf{d}}} - \mathbf {d}\left( \mathbf {x} \right) } \right) }^T}\right. \nonumber \\&\quad \left. {{\left( {{\mathbf {C}^{ - 1}}} \right) }^T} \left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) \right] \nonumber \\&={\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) ^T}{\mathbf {C}^{ - 1}}E\left[ {\mathbf {n}{\mathbf {n}^T}} \right] {\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) \nonumber \\&={\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) ^T}{\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) . \end{aligned}$$
(68)

The remaining elements of the FIM can be derived in the same way as above:

$$\begin{aligned} {I_{xy}}&= {I_{yx}} = E\left[ {\left( {\frac{{\partial \ln \left( {f\left( {\left. {\tilde{\mathbf{d}}} \right| \mathbf {x}} \right) } \right) }}{{\partial {x}}}} \right) {{\left( {\frac{{\partial \ln \left( {f\left( {\left. {\tilde{\mathbf{d}}} \right| \mathbf {x}} \right) } \right) }}{{\partial {y}}}} \right) }^T}} \right] \nonumber \\&={\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) ^T}{\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial y}}} \right) , \end{aligned}$$
(69)
$$\begin{aligned} {I_{yy}}&= E\left[ {\left( {\frac{{\partial \ln \left( {f\left( {\left. {\tilde{\mathbf{d}}} \right| \mathbf {x}} \right) } \right) }}{{\partial {y}}}} \right) {{\left( {\frac{{\partial \ln \left( {f\left( {\left. {\tilde{\mathbf{d}}} \right| \mathbf {x}} \right) } \right) }}{{\partial {y}}}} \right) }^T}} \right] \nonumber \\&={\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial y}}} \right) ^T}{\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial y}}} \right) . \end{aligned}$$
(70)

According to Eq. (4), the partial derivative of \(\mathbf {d}\left( \mathbf {x} \right) \) with respect to the components of \(\mathbf {x}\) can be expressed as:

$$\begin{aligned} \frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial \mathbf {x}}} = \begin{bmatrix} {{\frac{{x - x_1^r}}{{{{\left\| {{\mathbf {x}} - \mathbf {x}_1^r} \right\| }_{2}}}} + \frac{x}{{{{\left\| {\mathbf {x}} \right\| }_{{2}}}}}}} &{} {{\frac{{y - y_1^r}}{{{{\left\| {{\mathbf {x}} - \mathbf {x}_1^r} \right\| }_{2}}}} + \frac{y}{{{{\left\| {\mathbf {x}} \right\| }_{{2}}}}}}}\\ {{\frac{{x - x_2^r}}{{{{\left\| {{\mathbf {x}} - \mathbf {x}_2^r} \right\| }_{2}}}} + \frac{x}{{{{\left\| {\mathbf {x}} \right\| }_{{2}}}}}}}&{} {{\frac{{y - y_2^r}}{{{{\left\| {{\mathbf {x}} - \mathbf {x}_2^r} \right\| }_{2}}}} + \frac{y}{{{{\left\| {\mathbf {x}} \right\| }_{{2}}}}}}}\\ \vdots &{} \vdots \\ {{\frac{{x - x_N^r}}{{{{\left\| {{\mathbf {x}} - \mathbf {x}_N^r} \right\| }_{2}}}} + \frac{x}{{{{\left\| {\mathbf {x}} \right\| }_{{2}}}}}}} &{} {{\frac{{y - y_N^r}}{{{{\left\| {{\mathbf {x}} - \mathbf {x}_N^r} \right\| }_{2}}}} + \frac{y}{{{{\left\| {\mathbf {x}} \right\| }_{{2}}}}}}}\\ \end{bmatrix}, \end{aligned}$$
(71)

where \(\partial \mathbf {d}\left( \mathbf {x} \right) /\partial \mathbf {x}\) is the \(N \times 2\) Jacobian matrix.

Performing the matrix multiplication, the following expressions can be easily obtained

$$\begin{aligned} {I_{xx}}&= {\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) ^T}{\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) \nonumber \\&= \sum \limits _{i = 1}^N {\frac{1}{{\sigma _{ni}^2}}{{\left( {\frac{{x - x_i^r}}{{{{\left\| {\mathbf {x} - \mathbf {x}_i^r} \right\| }_{{2}}}}} + \frac{x}{{{{\left\| \mathbf {x} \right\| }_{{2}}}}}} \right) }^2}}. \end{aligned}$$
(72)

Similarly, the expressions for the remaining elements of FIM can be obtained as:

$$\begin{aligned} {I_{xy}}&= {I_{yx}} = {\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial x}}} \right) ^T}{\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial y}}} \right) \nonumber \\&= \sum \limits _{i = 1}^N {\frac{1}{{\sigma _{ni}^2}}{{\left( {\frac{{x - x_i^r}}{{{{\left\| {\mathbf {x} - \mathbf {x}_i^r} \right\| }_{{2}}}}} + \frac{x}{{{{\left\| \mathbf {x} \right\| }_{{2}}}}}} \right) }}{{\left( {\frac{{y - y_i^r}}{{{{\left\| {\mathbf {x} - \mathbf {x}_i^r} \right\| }_{{2}}}}} + \frac{y}{{{{\left\| \mathbf {x} \right\| }_{{2}}}}}} \right) }}}, \end{aligned}$$
(73)
$$\begin{aligned} {I_{yy}}&= {\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial y}}} \right) ^T}{\left( {{\mathbf {C}^{ - 1}}} \right) ^T}\left( {\frac{{\partial \mathbf {d}\left( \mathbf {x} \right) }}{{\partial y}}} \right) \nonumber \\&= \sum \limits _{i = 1}^N {\frac{1}{{\sigma _{ni}^2}}{{\left( {\frac{{y - y_i^r}}{{{{\left\| {\mathbf {x} - \mathbf {x}_i^r} \right\| }_{{2}}}}} + \frac{y}{{{{\left\| \mathbf {x} \right\| }_{{2}}}}}} \right) }^2}}. \end{aligned}$$
(74)

Finally, Eqs. (55)-(57) of the corresponding elements of FIM are obtained.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rosić, M.B., Simić, M.I. & Pejović, P.V. An improved adaptive hybrid firefly differential evolution algorithm for passive target localization. Soft Comput 25, 5559–5585 (2021). https://doi.org/10.1007/s00500-020-05554-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05554-8

Keywords

Navigation