Result: Multiplicative linear search for a brownian target motion
Title:
Multiplicative linear search for a brownian target motion
Source:
Applied mathematical modelling. 35(9):4127-4139
Publisher Information:
Kidlington: Elsevier, 2011.
Publication Year:
2011
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Civil engineering, Génie civil, Mathematics, Mathématiques, Mechanics acoustics, Mécanique et acoustique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Programmation mathématique, Mathematical programming, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Intersection, Intersección, Modélisation, Modeling, Modelización, Mouvement brownien, Brownian motion, Movimiento browniano, Problème recherche, Search problem, Problema investigación, Programmation multiobjectif, Multiobjective programming, Programación multiobjetivo, Programmation non linéaire, Non linear programming, Programación no lineal, Poursuite cible, Target tracking, Persecución de blanco, First meeting time, Multiobjective non linear programming problem, Real line, Search model
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
Mathematics Department, Faculty of Science, Tanta University, Tanta, Egypt
ISSN:
0307-904X
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.24208640
Database:
PASCAL Archive
Further Information
This paper investigates a search problem for a brownian target motion on one of n-intersected real lines in which any information of the target position is not available to the searchers all the time. We have n-searchers start searching for the target from the origin that is the intersection point of these lines. Each of the searchers moves continuously along his line in both directions of the starting point. The purpose of this paper is to formulate a search model and find the condition under which the expected value of the first meeting time between one of the searchers and the target is finite. Also, we show the existence of the optimal search plan which minimizes the expected value of the first meeting time and find it.