OPTIMAL SEARCH FOR A MOVING TARGET WITH NO TIME INFORMATION MAXIMIZING THE EXPECTED REWARD
スポンサーリンク
概要
- 論文の詳細を見る
This paper investigates a search problem for a moving target on a network in which any time information of the target position is not available to a searcher. The searcher has to distribute the limited amount of search efforts on a search space to detect the target, knowing only route information of target paths but not time information about when the target passes there. On detection of the target, the searcher gains some value but expends search cost. There have been few papers which mathematically deal with such a search model without any time information of the target position so far. We formulate the search-efforts-optimizing problem under the expected reward criterion as a convex programming problem and obtain necessary and sufficient conditions for optimal solutions. Using the conditions, a new algorithm is proposed to give an optimal solution. It is shown that the algorithm has the high efficiency for computational time and the robustness for the size of problems comparing with some well-known methods for non-linear programming problems: the gradient projection method and the multiplier method, by numerical examinations. We also elucidate some properties of the optimal solution by the sensitivity analysis of system parameters.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Iida Koji
National Defense Academy
-
Hohzaki Ryusuke
National Defence Academy
-
Teramoto Masayoshi
National Defense Academy
関連論文
- A MULTI-STAGE SEARCH ALLOCATION GAME WITH THE PAYOFF OF DETECTION PROBABILITY
- AN INSPECTION GAME WITH SMUGGLER'S DECISION ON THE AMOUNT OF CONTRABAND
- AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
- AN OPTIMAL INVESTIVATION IN TWO STAGE SEARCH WITH RECOGNITION ERRORS
- DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS
- A CONCAVE MAXIMIZATION PROBLEM WITH DOUBLE LAYERS OF CONSTRAINTS ON THE TOTAL AMOUNT OF RESOURCES
- A SEARCH GAME FOR A MOBILE TARGET WITH THE CONDITIONALLY DETERMINISTIC MOTION DEFINED BY PATHS
- OPTIMAL SEARCH FOR A MOVING TARGET WITH NO TIME INFORMATION MAXIMIZING THE EXPECTED REWARD
- A COMPULSORY SMUGGLING MODEL OF INSPECTION GAME TAKING ACCOUNT OF FULFILLMENT PROBABILITIES OF PLAYERS' AIMS
- OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
- OPTIMAL INVESTIGATING SEARCH MAXIMIZING THE DETECTION PROBABILITY
- A SEARCH GAME WITH REWARD CRITERION
- RANDOMIZED LOOK STRATEGY FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- AN INTEGER RESOURCE ALLOCATION PROBLEM WITH COST CONSTRAINT
- AN APPROXIMATION FOR A CONTINUOUS DATUM SEARCH GAME WITH ENERGY CONSTRAINT
- A SEARCH GAME TAKING ACCOUNT OF LINEAR EFFECTS AND LINEAR CONSTRAINTS OF SEARCHING RESOURCE