IDEAS home Printed from https://ideas.repec.org/a/gvu/tcsst0/v4y2022i3id2013.html

Path Planning of Mobile Robot Using Reinforcement Learning

Author

Listed:
  • Kiran G Krishnan
  • Abhishek Mohan
  • S. Vishnu
  • Steve Abraham Eapen
  • Amith Raj
  • Jeevamma Jacob

Abstract

In complex planning and control operations and tasks like manipulating objects, assisting experts in various fields, navigating outdoor environments, and exploring uncharted territory, modern robots are designed to complement or completely replace humans. Even for those skilled in robot programming, designing a control schema for such robots to carry out these tasks is typically a challenging process that necessitates starting from scratch with a new and distinct controller for each task. The designer must consider the wide range of circumstances the robot might encounter. This kind of manual programming is typically expensive and time consuming. It would be more beneficial if a robot could learn the task on its own rather than having to be preprogrammed to perform all these tasks. In this paper, a method for the path planning of a robot in a known environment is implemented using Q-Learning by finding an optimal path from a specified starting and ending point.

Suggested Citation

Handle: RePEc:gvu:tcsst0:v:4:y:2022:i:3:id:2013
DOI: 10.36548/jtcsst.2022.3.004
as

Download full text from publisher

File URL: https://irojournals.com/tcsst/article/view/2013
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/tcsst/article/download/2013/1833
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jtcsst.2022.3.004?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
---><---

More about this item

Keywords

;
;
;
;
;

Statistics

Access and download statistics

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:gvu:tcsst0:v:4:y:2022:i:3:id:2013. 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: Journal Manager (email available below). General contact details of provider: https://irojournals.com/tcsst .

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.