PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION

スポンサーリンク

概要

• 論文の詳細を見る

• A target is moving on a finite number of cells in discrete time. Knowing the probabilities of the target's path selection, a searcher is searching for the target in this search space with constraints that he can move from cell i to one of the adjacent cells. He gains a value V(t) on the detection of the target at time t but expends cost c_0(i,t) for the search in cell i at t. In this paper, we propose a method to find an optimal path for the searcher, which maximizes the expected reward defined as the expected value minus the expected cost. We use a branch and bound procedure with an upper bound estimation given by solving the problem relaxed in continuous search effort.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Koji Iida

  National Defense Academy

• Hohzaki Ryusuke

  Department of Applied Physics, National Defense Academy

• Hohzaki Ryusuke

  Department Of Applied Physics National Defense Academy

関連論文

• HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
• AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER
• A SEARCH GAME WITH DURABLE SEARCHING RESOURCES
• A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
• Rescheduling for AGVs by Time Windows Concept
• AN OPTIMAL SEARCH PLAN FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
• Efficient Algorithms for a Convex Programming Problem with a Constraint on the Weighted Total Amount
• A MOVING TARGET SEARCH PROBLEM WITH NESTED CONSTRAINTS OF SEARCH EFFORT

スポンサーリンク