Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 31 March 2005

Seek of an Optimal Way by Q-Learning

Y. Dahmani & A. Benyettou

Journal of Computer Science, Volume 1, Issue 1, pp. 28–30 · doi.org/10.3844/jcssp.2005.28.30

6,929 accesses4,330 downloads8 citations (Crossref)Metrics
Cite Check for updates

Abstract

In this article, we presented the Q-Learning training method which is a derivative of the reinforcement learning called sometimes training by penalty-reward. We illustrate this by an application to the mobility of a mobile in an enclosure closed on the basis of a starting point towards an unspecified arrival point. The objective is to find an optimal way optimal without leaving the enclosure.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2005 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Dahmani, Y. & Benyettou, A. (2005). Seek of an Optimal Way by Q-Learning. Journal of Computer Science, 1(1), 28–30. https://doi.org/10.3844/jcssp.2005.28.30

Licence
© Science Publications
Issue
Volume 1, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Seek of an Optimal Way by Q-LearningJournal of Computer Science · Volume 1, Issue 1 · pp. 28–30 · © Science PublicationsDownload