Results 51 to 60 of about 199,848 (147)

Improved Dynamic Q-Learning Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Equal-Size Sublots

open access: yesComplex System Modeling and Simulation
The lot-streaming flowshop scheduling problem with equal-size sublots (ELFSP) is a significant extension of the classic flowshop scheduling problem, focusing on optimize makespan.
Ping Wang, Renato De Leone, Hongyan Sang
doaj   +1 more source

q-Learning in Continuous Time

open access: yes, 2022
70 pages, 4 figures, appended with an ...
Jia, Yanwei, Zhou, Xun Yu
openaire   +3 more sources

Scheduling Bi-Objective Lot-Streaming Hybrid Flow Shops with Consistent Sublots via an Enhanced Artificial Bee Colony Algorithm

open access: yesComplex System Modeling and Simulation
This work addresses bi-objective hybrid flow shop scheduling problems considering consistent sublots (Bi-HFSP_CS). The objectives are to minimize the makespan and total energy consumption.
Benxue Lu   +3 more
doaj   +1 more source

Speedy Q-learning

open access: yes, 2011
We introduce a new convergent variant of Q-learning, called speedy Q-learning, to address the problem of slow convergence in the standard form of the Q-learning algorithm. We prove a PAC bound on the performance of SQL, which shows that for an MDP with n state-action pairs and the discount factor γ only T = O(log(n)/(ε^2 (1 - γ)^4)) steps are required ...
Azar, Mohammad Gheshlaghi   +3 more
openaire   +2 more sources

A Reinforcement Learning Approach for Smart Farming [PDF]

open access: yesDatabase Systems Journal, 2019
At a basic level, the aim of machine learning is to develop solutions for real-life engineering problems and to enhance the performance of different computers tasks in order to obtain an algorithm that is highly independent of human intervention.
Gabriela ENE
doaj  

Reinforcement Learning-Based Autonomous Soccer Agents: A Study in Multi-Agent Coordination and Strategy Development

open access: yesBuana Information Technology and Computer Sciences
Reinforcement learning (RL) approaches, particularly Q-learning, have emerged as strong tools for autonomous agent training, allowing agents to acquire optimum decision-making rules through interaction with their surroundings.
Biplov Paneru   +3 more
doaj   +1 more source

MinMaxMin $Q$-learning

open access: yes
MinMaxMin $Q$-learning is a novel optimistic Actor-Critic algorithm that addresses the problem of overestimation bias ($Q$-estimations are overestimating the real $Q$-values) inherent in conservative RL algorithms. Its core formula relies on the disagreement among $Q$-networks in the form of the min-batch MaxMin $Q$-networks distance which is added to ...
Soffair, Nitsan, Mannor, Shie
openaire   +2 more sources

Frictional Q-Learning

open access: yes
We draw an analogy between static friction in classical mechanics and extrapolation error in off-policy RL, and use it to formulate a constraint that prevents the policy from drifting toward unsupported actions. In this study, we present Frictional Q-learning, a deep reinforcement learning algorithm for continuous control, which extends batch ...
Kim, Hyunwoo, Lee, Hyo Kyung
openaire   +2 more sources

Smoothed Q-learning

open access: yes, 2023
In Reinforcement Learning the Q-learning algorithm provably converges to the optimal solution. However, as others have demonstrated, Q-learning can also overestimate the values and thereby spend too long exploring unhelpful states. Double Q-learning is a provably convergent alternative that mitigates some of the overestimation issues, though sometimes ...
openaire   +2 more sources

Meta-Q-Learning

open access: yes, 2019
ICLR 2020 conference ...
Fakoor, Rasool   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy