Learning Robust Plans for Mobile Robots from a Single Trial
Abstract
We address the problem of learning robust plans for robot navigation by observing particular robot behaviors. In this paper we present a method which can learn a robust reactive plan from a single example of a desired behavior. The system operates by translating a sequence of events arising from the effector system into a plan which represents the dependencies among such events. This method allows us to rely on the underlying stability properties of low-level behavior processes in order to produce robust plans. Since the resultant plan reproduces the original behavior of the robot at a high level, it generalizes over small environmental changes and is robust to sensor and effector noise. Introduction Recently, a number of sophisticated `reactive' planning formalisms have been developed (Firby 1989; Gat 1991; McDermott 1991; Simmons 1994), which allow a great deal of flexibility in control flow and explicitly include a notion of an intelligent plan execution system. However, the compl...
Cite
Text
Engelson. "Learning Robust Plans for Mobile Robots from a Single Trial." AAAI Conference on Artificial Intelligence, 1996. doi:10.5555/1892875.1893004Markdown
[Engelson. "Learning Robust Plans for Mobile Robots from a Single Trial." AAAI Conference on Artificial Intelligence, 1996.](https://mlanthology.org/aaai/1996/engelson1996aaai-learning/) doi:10.5555/1892875.1893004BibTeX
@inproceedings{engelson1996aaai-learning,
title = {{Learning Robust Plans for Mobile Robots from a Single Trial}},
author = {Engelson, Sean P.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1996},
pages = {869-874},
doi = {10.5555/1892875.1893004},
url = {https://mlanthology.org/aaai/1996/engelson1996aaai-learning/}
}