Learning to Execute Navigation Plans

  • Authors:
  • Thorsten Belker;Michael Beetz

  • Affiliations:
  • -;-

  • Venue:
  • KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most state-of-the-art navigation systems for autonomous service robots decompose navigation into global navigation planning and local reactive navigation. While the methods for navigation planning and local navigation are well understood, the plan execution problem, the problem of how to generate and parameterize local navigation tasks from a given navigation plan, is largely unsolved. This article describes how a robot can autonomously learn to execute navigation plans. We formalize the problem as a Markov Decision Problem (MDP), discuss how it can be simplified to make its solution feasible, and describe how the robot can acquire the necessary action models. We show, both in simulation and on a RWI B21 mobile robot, that the learned models are able to produce competent navigation behavior.