Sequential Decision Making Using Q Learning Algorithm for Diabetic Patients

2014 ◽  
pp. 313-321
Author(s):  
Pramod Patil ◽  
Parag Kulkarni ◽  
Rachana Shirsath
Keyword(s):  
Decision Making ◽  
Learning Algorithm ◽  
Sequential Decision Making ◽  
Diabetic Patients ◽  
Sequential Decision ◽  
Q Learning

scholarly journals Preventing Disparate Treatment in Sequential Decision Making

2018 ◽  
Author(s):  
Hoda Heidari ◽  
Andreas Krause
Keyword(s):  
Decision Making ◽  
Learning Algorithm ◽  
Feature Space ◽  
Sequential Decision Making ◽  
Data Sets ◽  
Sequential Decision ◽  
Real World Data ◽  
Time Step ◽  
Job Application ◽  
Disparate Treatment

We study fairness in sequential decision making environments, where at each time step a learning algorithm receives data corresponding to a new individual (e.g. a new job application) and must make an irrevocable decision about him/her (e.g. whether to hire the applicant) based on observations made so far. In order to prevent cases of disparate treatment, our time-dependent notion of fairness requires algorithmic decisions to be consistent: if two individuals are similar in the feature space and arrive during the same time epoch, the algorithm must assign them to similar outcomes. We propose a general framework for post-processing predictions made by a black-box learning model, that guarantees the resulting sequence of outcomes is consistent. We show theoretically that imposing consistency will not significantly slow down learning. Our experiments on two real-world data sets illustrate and confirm this finding in practice.

scholarly journals Decision-making method for vehicle longitudinal automatic driving based on reinforcement Q-learning

2019 ◽  
Vol 16 (3) ◽  
pp. 172988141985318
Author(s):  
Zhenhai Gao ◽  
Tianjun Sun ◽  
Hongwei Xiao
Keyword(s):  
Decision Making ◽  
Process Model ◽  
Driving Simulator ◽  
Learning Algorithm ◽  
Autonomous Driving ◽  
Sequential Decision ◽  
Q Learning ◽  
Reward Function ◽  
Automatic Driving ◽  
Independent Decision

In the development of autonomous driving, decision-making has become one of the technical difficulties. Traditional rule-based decision-making methods lack adaptive capacity when dealing with unfamiliar and complex traffic conditions. However, reinforcement learning shows the potential to solve sequential decision problems. In this article, an independent decision-making method based on reinforcement Q-learning is proposed. First, a Markov decision process model is established by analysis of car-following. Then, the state set and action set are designed by the synthesized consideration of driving simulator experimental results and driving risk principles. Furthermore, the reinforcement Q-learning algorithm is developed mainly based on the reward function and update function. Finally, the feasibility is verified through random simulation tests, and the improvement is made by comparative analysis with a traditional method.

A State-Space Representation Model and Learning Algorithm for Real-Time Decision-Making Under Uncertainty

2007 ◽  
Author(s):  
Andreas A. Malikopoulos ◽  
Panos Y. Papalambros ◽  
Dennis N. Assanis
Keyword(s):  
Decision Making ◽  
Optimal Control ◽  
Real Time ◽  
Learning Algorithm ◽  
Control Policy ◽  
Sequential Decision Making ◽  
Space Representation ◽  
Decision Making Under Uncertainty ◽  
Sequential Decision ◽  
State Space Representation

Modeling dynamic systems incurring stochastic disturbances for deriving a control policy is a ubiquitous task in engineering. However, in some instances obtaining a model of a system may be impractical or impossible. Alternative approaches have been developed using a simulation-based stochastic framework, in which the system interacts with its environment in real time and obtains information that can be processed to produce an optimal control policy. In this context, the problem of developing a policy for controlling the system’s behavior is formulated as a sequential decision-making problem under uncertainty. This paper considers real-time sequential decision-making under uncertainty modeled as a Markov Decision Process (MDP). A state-space representation model is constructed through a learning mechanism and is used to improve system performance over time. The model allows decision making based on gradually enhanced knowledge of system response as it transitions from one state to another, in conjunction with actions taken at each state. A learning algorithm is implemented realizing in real time the optimal control policy associated with the state transitions. The proposed method is demonstrated on the single cart-pole balancing problem and a vehicle cruise control problem.

scholarly journals Optimal Policies for Quantum Markov Decision Processes

2021 ◽  
Author(s):  
Ming-Sheng Ying ◽  
Yuan Feng ◽  
Sheng-Gang Ying
Keyword(s):  
Decision Making ◽  
Reinforcement Learning ◽  
Quantum Systems ◽  
Sequential Decision Making ◽  
Mathematical Framework ◽  
Sequential Decision ◽  
Learning Techniques ◽  
Optimal Policies ◽  
Markov Decision ◽  
Programming Algorithms

AbstractMarkov decision process (MDP) offers a general framework for modelling sequential decision making where outcomes are random. In particular, it serves as a mathematical framework for reinforcement learning. This paper introduces an extension of MDP, namely quantum MDP (qMDP), that can serve as a mathematical model of decision making about quantum systems. We develop dynamic programming algorithms for policy evaluation and finding optimal policies for qMDPs in the case of finite-horizon. The results obtained in this paper provide some useful mathematical tools for reinforcement learning techniques applied to the quantum world.

Sign in / Sign up

Export Citation Format

Share Document