OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, an optimal search-and-rescue operation maximizing the expected reward for a survivor with a conditionally deterministic motion and with a random lifetime is investigated. Necessary conditions for the optimal distribution of the searching effort and the optimal stopping time of the search are derived and the meaning of the conditions for the optimal plan are elucidated. To show the properties of the optimal search plan, several numerical examples are presented and special cases and generalization of the model are also discussed.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Iida K
National Defense Academy
-
Iida Koji
National Defense Academy
-
Hohzaki R
National Defense Acad.
-
Hohzaki Ryusuke
National Defence Academy
-
Inada Kenji
Maritime Safety Agency
関連論文
- 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
- A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
- Rescheduling for AGVs by Time Windows Concept
- 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