Continuous Q-learning application

Abstract eng:
Standard algorithm of Q-Learning is limited by discrete states and actions and Qfunction is u sually represented as discrete table. To avoid this obstacle and extend the use of Q-learning for continuous states and actions the algorithm must be modified and such modification is presented in the paper. Straightforward way is to replace discrete table with suitable approximator. A number of approximators can be used, with respect to memory and computational requirements the local approximator is particularly favorable. We have used Locally Weighted Regression (LWR) algorithm. The paper discusses advantages and disadvantages of modified algorithm demonstrated on simple control task.

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket