IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v12y2001i10ns0129183101002851.html
   My bibliography  Save this article

Deep-Sarsa: A Reinforcement Learning Algorithm For Autonomous Navigation

Author

Listed:
  • M. ANDRECUT

    (Department of Physics, University of Lethbridge, 4401 University Drive, Lethbridge, Alberta, T1K 3M4, Canada)

  • M. K. ALI

    (Department of Physics, University of Lethbridge, 4401 University Drive, Lethbridge, Alberta, T1K 3M4, Canada)

Abstract

In this paper we discuss the application of reinforcement learning algorithms to the problem of autonomous robot navigation. We show that the autonomous navigation using the standard delayed reinforcement learning algorithms is an ill posed problem and we present a more efficient algorithm for which the convergence speed is greatly improved. The proposed algorithm (Deep-Sarsa) is based on a combination between the Depth-First Search (a graph searching algorithm) and Sarsa (a delayed reinforcement learning algorithm).

Suggested Citation

  • M. Andrecut & M. K. Ali, 2001. "Deep-Sarsa: A Reinforcement Learning Algorithm For Autonomous Navigation," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 12(10), pages 1513-1523.
  • Handle: RePEc:wsi:ijmpcx:v:12:y:2001:i:10:n:s0129183101002851
    DOI: 10.1142/S0129183101002851
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183101002851
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183101002851?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:12:y:2001:i:10:n:s0129183101002851. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.