An optimal policy for competitive processing of high- and low-priority arrivals

1991 ◽  
Vol 4 (3) ◽  
pp. 209-224 ◽  
Author(s):  
Hakan Delic ◽  
P. Papantoni-Kazakos
Keyword(s):  
Optimal Policy ◽  
Competitive Processing

scholarly journals Improved Q-Learning Algorithm Based on Approximate State Matching in Agricultural Plant Protection Environment

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 737
Author(s):  
Fengjie Sun ◽  
Xianchang Wang ◽  
Rui Zhang
Keyword(s):  
Decision Making ◽  
Reinforcement Learning ◽  
Optimal Policy ◽  
Feasible Solution ◽  
Learning Algorithm ◽  
Plant Protection ◽  
Agricultural Plant ◽  
Q Learning ◽  
Aerial Vehicle ◽  
Optimal Action

An Unmanned Aerial Vehicle (UAV) can greatly reduce manpower in the agricultural plant protection such as watering, sowing, and pesticide spraying. It is essential to develop a Decision-making Support System (DSS) for UAVs to help them choose the correct action in states according to the policy. In an unknown environment, the method of formulating rules for UAVs to help them choose actions is not applicable, and it is a feasible solution to obtain the optimal policy through reinforcement learning. However, experiments show that the existing reinforcement learning algorithms cannot get the optimal policy for a UAV in the agricultural plant protection environment. In this work we propose an improved Q-learning algorithm based on similar state matching, and we prove theoretically that there has a greater probability for UAV choosing the optimal action according to the policy learned by the algorithm we proposed than the classic Q-learning algorithm in the agricultural plant protection environment. This proposed algorithm is implemented and tested on datasets that are evenly distributed based on real UAV parameters and real farm information. The performance evaluation of the algorithm is discussed in detail. Experimental results show that the algorithm we proposed can efficiently learn the optimal policy for UAVs in the agricultural plant protection environment.

scholarly journals The Race Between Deterrence and Displacement: Theory and Evidence from Bank Robberies

2020 ◽  
pp. 1-45 ◽  
Author(s):  
Vikram Maheshri ◽  
Giovanni Mastrobuoni
Keyword(s):  
Optimal Policy ◽  
Security Measures ◽  
Precise Information ◽  
Rural Markets ◽  
Security Guard ◽  
Urban Markets ◽  
Displacement Theory ◽  
Displacement Effects

Security measures that deter crime may unwittingly displace it to neighboring areas, but evidence of displacement is scarce. We exploit precise information on the timing and locations of all Italian bank robberies and security guard hirings/firings over a decade to estimate deterrence and displacement effects of guards. A guard lowers the likelihood a bank is robbed by 35-40%. Over half of this reduction is displaced to nearby unguarded banks. Theory suggests optimal policy to mitigate this spillover is ambiguous. Our findings indicate restricting guards in sparse, rural markets and requiring guards in dense, urban markets could be socially beneficial.

scholarly journals HOPF BIFURCATION FROM NEW-KEYNESIAN TAYLOR RULE TO RAMSEY OPTIMAL POLICY

2020 ◽  
pp. 1-33
Author(s):  
Jean-Bernard Chatelain ◽  
Kirsten Ralf
Keyword(s):  
Hopf Bifurcation ◽  
Optimal Policy ◽  
Ad Hoc ◽  
Taylor Rule ◽  
Dynamic Properties ◽  
Feedback Mechanism ◽  
New Keynesian ◽  
Negative Feedback Mechanism ◽  
Positive Feedback Mechanism ◽  
Forward Looking

This paper compares different implementations of monetary policy in a new-Keynesian setting. We can show that a shift from Ramsey optimal policy under short-term commitment (based on a negative feedback mechanism) to a Taylor rule (based on a positive feedback mechanism) corresponds to a Hopf bifurcation with opposite policy advice and a change of the dynamic properties. This bifurcation occurs because of the ad hoc assumption that interest rate is a forward-looking variable when policy targets (inflation and output gap) are forward-looking variables in the new-Keynesian theory.

OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS

2007 ◽  
Vol 22 (1) ◽  
pp. 107-131 ◽  
Author(s):  
Dimitrios G. Pandelis
Keyword(s):  
Optimal Control ◽  
Optimal Policy ◽  
Optimal Allocation ◽  
Operating Costs ◽  
Queuing Systems ◽  
Tandem Queues ◽  
Holding Costs ◽  
Flexible Servers ◽  
Tandem Queuing ◽  
Dedicated Servers

We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. We assume exponential service times, linear holding costs, and operating costs incurred by the servers at rates proportional to their speeds. Under conditions that ensure the optimality of nonidling policies, we show that the optimal allocation of flexible servers is determined by a transition-monotone policy. Moreover, we present conditions under which the optimal policy can be explicitly determined.

Sign in / Sign up

Export Citation Format

Share Document