Reinforcement learning with heuristic to solve POMDP problem in mobile robot path planning

6Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose a method of presenting a special case of Value Function as a solution to POMDP in mobile robot navigation. By using this new method the Value Function complexity will be reduced and more intuitive. We also propose a new reinforcement learning method to solve the Value Function. This reinforcement learning is based on Bellman Equation augmented with A* like heuristic during update iteration. The result of this new Value Function is validated with This particle filter is simulaed in Matlab and also experimented physically using a simple autonomous mobile robot built with Lego Mindstorms NXT with 3 ultrasonic sonar and RWTH Mindstorms NXT Toolbox for Matlab to connect the robot to Matlab. This simulation and experiment also incorporate particle filter localization from previous research. The simulation and experiment show that the Value Function can be utilized very well. © 2011 IEEE.

Cite

CITATION STYLE

APA

Adiprawita, W., Ahmad, A. S., Sembiring, J., & Trilaksono, B. R. (2011). Reinforcement learning with heuristic to solve POMDP problem in mobile robot path planning. In Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. https://doi.org/10.1109/ICEEI.2011.6021734

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free