Fuzzy Optimal Search Plan for N-Dimensional Randomly Moving Target

2016 ◽  
Vol 13 (06) ◽  
pp. 1650038 ◽  
Author(s):  
Mohamed Abd Allah El-Hadidy
Keyword(s):  
Target Position ◽  
Expected Value ◽  
Numerical Results ◽  
Search Model ◽  
Moving Target ◽  
Optimal Search ◽  
Search Plan

This paper presents a search model that finds [Formula: see text]-dimensional randomly moving target in which any information of the target position is not available to the searchers. There exist [Formula: see text]-searchers, starting the searching process from the origin. Rather than finding the conditions that make the expected value of the first meeting time between one of the searchers and the target is finite, this work shows the existence of the fuzzy optimal search plan that minimizes the expected value of the first meeting time. The effectiveness of this method is illustrated by using an example with numerical results.

scholarly journals Parabolic Spiral Search Plan for a Randomly Located Target in the Plane

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Mohamed Beltagy ◽  
Mohamed Abd Allah El-Hadidy
Keyword(s):  
Target Position ◽  
Expected Value ◽  
Dimensional Case ◽  
Linear Search ◽  
Search Technique ◽  
One Dimensional ◽  
Search Plan ◽  
Starting Point ◽  
Complete Revolution ◽  
The One

This paper addresses the problem of searching for a located target in the plane by using one searcher starting its motion from the point . The searcher moves along parabolic spiral curve. The position of the target has a known distribution. We show that the distance between the target position and the searcher starting point depends on the number of revolutions, where the complete revolution is done when . Furthermore, we study this technique in the one-dimensional case (i.e., when the searcher moves with linear search technique). It is desired to get the expected value of the time for detecting the target. Illustrative examples are given to demonstrate the applicability of this technique assuming circular normal distributed estimates of the target position.

Coordinated Search for a Random Walk Target Motion

2018 ◽  
Vol 17 (01) ◽  
pp. 1850002 ◽  
Author(s):  
Mohamed Abd Allah El-Hadidy ◽  
Hamdy M. Abou-Gabal
Keyword(s):  
Random Walk ◽  
Real Line ◽  
Search Strategy ◽  
Expected Value ◽  
Target Motion ◽  
Moving Target ◽  
Optimal Search ◽  
The Real ◽  
Numerical Example

This paper presents the cooperation between two searchers at the origin to find a Random Walk moving target on the real line. No information is not available about the target’s position all the time. Rather than finding the conditions that make the expected value of the first meeting time between one of the searchers and the target is finite, we show the existence of the optimal search strategy which minimizes this first meeting time. The effectiveness of this model is illustrated using a numerical example.

Searching for the Random Walking microorganism cells

2019 ◽  
Vol 12 (06) ◽  
pp. 1950064 ◽  
Author(s):  
Mohamed Abd Allah El-Hadidy ◽  
Hamdy M. Abou-Gabal
Keyword(s):  
Expected Value ◽  
Random Walking ◽  
Search Technique ◽  
Cooperative Search ◽  
Search Plan ◽  
Unit Speed ◽  
Text Unit

In this paper, we present a complex cooperative search technique for finding the Random Walking microorganism cells on one of [Formula: see text]-intersect real lines at the origin. We have 2[Formula: see text] unit speed searchers starting together from the origin. Furthermore, proving the existence of a finite search plan, we are discussing the existence of optimality for this search plan which minimizes the expected value of the first meeting time between one of the searchers and the microorganism cells.

Ground-Constrained Motion Target Tracking for Monocular Sequence Images

2018 ◽  
Vol 32 (12) ◽  
pp. 1850044 ◽  
Author(s):  
Ling Guo
Keyword(s):  
Background Subtraction ◽  
Target Position ◽  
Video Monitoring ◽  
Moving Target ◽  
Constrained Motion ◽  
Otsu Method ◽  
Test Platform ◽  
Monitoring Test ◽  
Nonlinear Compensation ◽  
Nonlinear Imaging

For the detection of a moving target position in video monitoring images, the existing locating tracking systems mainly adopt binocular or structured light stereoscopic technology, which has drawbacks such as system design complexity and slow detection speed. In light of these limitations, a tracking method for monocular sequence moving targets is presented, with the introduction of ground constraints into monocular visual monitoring; the principle and process of the method are introduced in detail in this paper. This method uses camera installation information and geometric imaging principles combined with nonlinear compensation to derive the calculation formula for the actual position of the ground moving target in monocular asymmetric nonlinear imaging. The footprint location of a walker is searched in the sequence imaging of a monitoring test platform that is built indoors. Because of the shadow of the walker in the image, the multi-threshold OTSU method based on test target background subtraction is used here to segment the images. The experimental results verify the effectiveness of the proposed method.

scholarly journals Optimal Search for a Moving Target

1995 ◽  
Vol 9 (2) ◽  
pp. 159-182 ◽  
Author(s):  
I. M. MacPhee ◽  
B. P. Jordan
Keyword(s):  
Markov Chain ◽  
Optimal Policy ◽  
Average Cost ◽  
Large Range ◽  
Moving Target ◽  
Optimal Search ◽  
Threshold Probability

Consider the problem of searching for a leprechaun that moves randomly between two sites. The movement is modelled with a two-state Markov chain. One of the sites is searched at each time t = 1,2,…, until the leprechaun is found. Associated with each search of site i is an overlook probability αi and a cost Ci Our aim is to determine the policy that will find the leprechaun with the minimal average cost. Let p denote the probability that the leprechaun is at site 1. Ross conjectured that an optimal policy can be defined in terms of a threshold probability P* such that site 1 is searched if and only if p ≥ P*. We show this conjecture to be correct (i) when α1 = α2 and C1 = C2, (ii) for general Ci when the overlook probabilities α, are small, and (iii) for general αi and Ci for a large range of transition laws for the movement. We also derive some properties of the optimal policy for the problem on n sites in the no-overlook case and for the case where each site has the same αi, and Ci.

Research on Electric Power Distribution Method

2013 ◽  
Vol 373-375 ◽  
pp. 2288-2291
Author(s):  
Hua Ren Zhou ◽  
Yue Hong Qian ◽  
Ze Qing Yao ◽  
Zi Sen Mao
Keyword(s):  
Electric Power ◽  
Electricity Market ◽  
Power Distribution ◽  
Unit Price ◽  
Search Model ◽  
Ramp Rate ◽  
Optimal Search ◽  
Distribution Method ◽  
Electric Power Distribution ◽  
Market Rules

According to the unit price, the section capacity section and the data of ramp rate, in accordance with the electricity market rules, the pushing method and optimal search model of the next time the output of the unit distribution plan are established.

Sign in / Sign up

Export Citation Format

Share Document