Dissertation > Excellent graduate degree dissertation topics show

Research into Fuzzy Optimal Search Method of Static Target

Author: SongTao
Tutor: GuoSiZuo
School: Liaoning Technical University
Course: Applied Mathematics
Keywords: Optimal search Fuzzy detection region Similar probability operator Fuzzy probability Non-linear programming
CLC: O229
Type: Master's thesis
Year: 2011
Downloads: 23
Quote: 0
Read: Download Dissertation

Abstract


So far, the optimal search theory of static target has been obtained rich theory and application results. For the discrete effort search problem of continuous search space, we can determine the quantity of detector in various regions according to the existing theories, but we can not determine the prccise locations of the detectors, In addition, in the discrete search space, whether discrete effort search problem or continuous effort search problem, there has no a unified method to determine the initial probability distribution of the target. To determine the initial target probability distributions, it requires us not only to use the mathematical knowledge, but also many skills and experiences.To solve the above problems, this article adopts the idea of fuzzy set, and specific methods are as follows:First of all, for the discrete effort search problem in search space, this paper puts forward the concept of fuzzy detection region about positioning detectors. When the target location is random distribution, we set up two kinds of fuzzy random search mode by using the similar probability operator of fuzzy set. Meanwhile, as the application of fuzzy random search model, we give a calculation example of signal detection and sovle it with the help of genetic algorithms.Secondly, for the optimal search problems in discrete space, we give the range of object location probability distribution and its credible degree within this range by using the concept of discrete fuzzy probability. Under the concept of discrete fuzzy probability this paper puts forward the calculation method of discovery probability when the search effort is continuous, and gives the specific search strategies and search effort distribution plans of the upper and lower bounds of target distribution probability under different credibility levels by using nonlinear programming.Finally, applying the thought and method to the problem in discrete space with discrete search effort, we also get the the specific search strategies and search effort distribution plans of the upper and lower bounds of target distribution probability under different credibility levels.Example analysis of the above issues shows that when the target distribution probability is fuzzy probability the search plan can effectively reduce the effects entire search plan due to the lack of information and provide more comprehensive real useful information for the analysis and design of optimal search strategy.

Related Dissertations

  1. Two Classes of Methods for Nonlinear Programming,O221.2
  2. Two Methods Based on Filter for Solving Nonlinear Programming Problems,O221.2
  3. Study on the Algorithms of the Bilevel Programming Problems,O221.1
  4. Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2
  5. The Auxiliary Function Method for Nonlinear Global Optimization,O224
  6. Study of Several Algorithms for Solving Nonlinear Optimization Problems,O221.2
  7. Globally Convex Filled Function Method for Nonlinear Global Optimization Problem,O221.2
  8. A Primal-Dual Interior-Point FS Algorithm and Its Global Convergence,O221.2
  9. Research on Differential Evolution Algorithm Based on Large-scale Industrial Process Optimization of Fuzzy Model,O221.2
  10. The Programming Models and Relevant Applications,O221
  11. Filled Function for Nonlinearly Global Optimization,O224
  12. Trust-region Algorithm for Nonlinear Programming,O221.2
  13. The Upper and Lower Bound Estimations of Nonlinear Optimization Problems,O224
  14. Two Classes of Filled Function for Constrained Global Optimization Problem,O224
  15. Convergences of Two Classes of Conjugated Gradient Methods and Properties of the Augmented Lagrangian Function,O221.2
  16. Nonlinear Programming JFNK homotopy method,O221.2
  17. Smooth Penalty Functions and Penalty Algorithms for Solving Nonlinear Programming Problems,O221.2
  18. The Penalty Function Method for Nonlinear Global Optimization,O221.2
  19. Properties of Saddle Points for a New Class of Augmented Lagrangian Functions,O221.2
  20. Studies for Multiobjective Nonlinear Programming Algorithm,O221.2
  21. Study on Deterministic Algorithms for Global Optimization Problem,O224

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Search theory
© 2012 www.DissertationTopic.Net  Mobile