DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with a search game. In a search space, a target wants to avoid a searcher by selecting his path. The searcher has superior mobility and makes effort to detect the target by distributing divisible searching effort anywhere he wants. The target might move diffusively from the starting points but his motion is restricted by some constraints on his maximum speed and energy consumption. The searcher also has limits on the total amount of searching effort. A payoff of the game is assumed to be the detection probability of the target, which is represented by an exponential function of the cumulative searching effort weighted by the probability distribution of the target. Regardless of the payoff function, we name the game the search allocation game with energy constraints. We formulate it as a two-person zero-sum game and propose a linear programming method to solve it. Our formulation and method have the flexibility to be applied to other search models by a small modification.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Iida K
National Defense Academy
-
Iida Koji
National Defense Academy
-
Hohzaki Ryusuke
National Defence Academy
-
Komiya Toru
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