The coordinated search problem faced by two searchers who start together from some point on
the line in order to search for a lost target which randomly located on the line. In this paper the distribution of
the lost target is symmetric around the point of the intersection of two lines, where the intersected point is a
starting point of the motion of the searchers. There are four searchers start together the search for the lost
target at the intersection point under this condition we defined the search plan and computed the expected
value of the first meeting time between one of the searchers and the target. The search plan which minimized
this first meeting time is studied. Finally we obtained some special cases for a search problems. An illustrative
examples is given to demonstrate the applicability of this model.