By Topic

Customized learning algorithms for episodic tasks with acyclic state spaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bountourelis, T. ; Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Reveliotis, S.

The work presented in this paper provides a practical, customized learning algorithm for reinforcement learning tasks that evolve episodically over acyclic state spaces. The presented results are motivated by the optimal disassembly planning (ODP) problem described in, and they complement and enhance some earlier developments on this problem that were presented in. In particular, the proposed algorithm is shown to be a substantial improvement of the original algorithm developed in, in terms of, both, the involved computational effort and the attained performance, where the latter is measured by the accumulated reward. The new algorithm also leads to a robust performance gain over the typical Q-learning implementations for the considered problem context.

Published in:

Automation Science and Engineering, 2009. CASE 2009. IEEE International Conference on

Date of Conference:

22-25 Aug. 2009