Analysis of Genetic Algorithm on Bearings-Only Target Motion Analysis

• URL: http://arxiv.org/abs/2001.05381v1
• Date: Wed, 15 Jan 2020 15:40:01 GMT
• Title: Analysis of Genetic Algorithm on Bearings-Only Target Motion Analysis
• Authors: Erdem Kose
• Abstract summary: Target motion analysis using only bearing angles is an important study for tracking targets in water. Several methods including Kalman-like filters and evolutionary strategies are used to get a good predictor.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Target motion analysis using only bearing angles is an important study for tracking targets in water. Several methods including Kalman-like filters and evolutionary strategies are used to get a good predictor. Kalman-like filters couldn't get the expected results thus evolutionary strategies have been using in this area for a long time. Target Motion Analysis with Genetic Algorithm is the most successful method for Bearings-Only Target Motion Analysis and we investigated it. We found that Covariance Matrix Adaptation Evolutionary Strategies does the similar work with Target Motion Analysis with Genetic Algorithm and tried it; but it has statistical feedback mechanism and converges faster than other methods. In this study, we compared and criticize the methods.

Related papers

• Enhanced Gene Selection in Single-Cell Genomics: Pre-Filtering Synergy and Reinforced Optimization [16.491060073775884]
  We introduce an iterative gene panel selection strategy applicable to clustering tasks in single-cell genomics. Our method integrates results from other gene selection algorithms, providing valuable preliminary boundaries. We incorporate the nature of the exploration process in reinforcement learning (RL) and its capability for continuous optimization.
  arXiv  Detail & Related papers  (2024-06-11T16:21:33Z)
• Un análisis bibliométrico de la producción científica acerca del agrupamiento de trayectorias GPS [0.3124884279860061]
  Clustering algorithms or methods for GPS trajectories are in constant evolution due to the interest aroused in part of the scientific community. This work aims to analyze the scientific production that exists around the topic "GPS trajectory" by means of bibliometrics.
  arXiv  Detail & Related papers  (2024-04-27T02:39:13Z)
• Phylogeny-informed fitness estimation [58.720142291102135]
  We propose phylogeny-informed fitness estimation, which exploits a population's phylogeny to estimate fitness evaluations. Our results indicate that phylogeny-informed fitness estimation can mitigate the drawbacks of down-sampled lexicase. This work serves as an initial step toward improving evolutionary algorithms by exploiting runtime phylogenetic analysis.
  arXiv  Detail & Related papers  (2023-06-06T19:05:01Z)
• An Investigation of the Bias-Variance Tradeoff in Meta-Gradients [53.28925387487846]
  Hessian estimation always adds bias and can also add variance to meta-gradient estimation. We study the bias and variance tradeoff arising from truncated backpropagation and sampling correction.
  arXiv  Detail & Related papers  (2022-09-22T20:33:05Z)
• Natural language processing for clusterization of genes according to their functions [62.997667081978825]
  We propose an approach that reduces the analysis of several thousand genes to analysis of several clusters. The descriptions are encoded as vectors using the pretrained language model (BERT) and some text processing approaches.
  arXiv  Detail & Related papers  (2022-07-17T12:59:34Z)
• Amortized Implicit Differentiation for Stochastic Bilevel Optimization [53.12363770169761]
  We study a class of algorithms for solving bilevel optimization problems in both deterministic and deterministic settings. We exploit a warm-start strategy to amortize the estimation of the exact gradient. By using this framework, our analysis shows these algorithms to match the computational complexity of methods that have access to an unbiased estimate of the gradient.
  arXiv  Detail & Related papers  (2021-11-29T15:10:09Z)
• Understanding Nesterov's Acceleration via Proximal Point Method [52.99237600875452]
  The proximal point method (PPM) is often used as a building block for designing optimization algorithms. In this work, we use the PPM method to provide conceptually simple derivations along with convergence analyses of different versions of Nesterov's accelerated gradient method (AGM)
  arXiv  Detail & Related papers  (2020-05-17T17:17:18Z)
• Nonlinear Regression Analysis Using Multi-Verse Optimizer [0.0]
  In regression analysis, optimization algorithms play a significant role in search the coefficients in the regression model. In this paper, nonlinear regression analysis using a recently developed meta-heuristic Multi-Verse model (MVO) is proposed. The proposed method is applied to 10 well-known benchmark nonlinear regression problems.
  arXiv  Detail & Related papers  (2020-04-28T15:03:52Z)
• Fixed-Target Runtime Analysis [8.246980996934347]
  runtime analysis classically studies the time needed to find an optimal solution. Two complementary approaches have been suggested: fixed-budget analyses and fixed-target analyses. We show that, different from fixed-budget analyses, many classical methods from the runtime analysis of discrete evolutionary algorithms yield fixed-target results without greater effort.
  arXiv  Detail & Related papers  (2020-04-20T20:26:35Z)
• The Hessian Estimation Evolution Strategy [3.756550107432323]
  We present a novel black box optimization algorithm called Hessian Estimation Evolution Strategy. The algorithm updates the covariance matrix of its sampling distribution by directly estimating the curvature of the objective function.
  arXiv  Detail & Related papers  (2020-03-30T08:01:16Z)
• Mixed Strategies for Robust Optimization of Unknown Objectives [93.8672371143881]
  We consider robust optimization problems, where the goal is to optimize an unknown objective function against the worst-case realization of an uncertain parameter. We design a novel sample-efficient algorithm GP-MRO, which sequentially learns about the unknown objective from noisy point evaluations. GP-MRO seeks to discover a robust and randomized mixed strategy, that maximizes the worst-case expected objective value.
  arXiv  Detail & Related papers  (2020-02-28T09:28:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.