Apprenticeship learning for motion planning with application to parking lot navigation

Pieter Abbeel, Dmitri Dolgov, Andrew Y. Ng, Sebastian ThrunIROS 2008 · OpenReview

Abstract

Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires carefully hand-engineering the trade-offs between different terms in the cost function. In practice, it is often much easier to demonstrate a few good trajectories. In this paper, we describe an efficient algorithm which - when given access to a few trajectory demonstrations - can automatically infer good trade-offs between the different costs. In our experiments, we apply our algorithm to the problem of navigating a robotic car in a parking lot.
BibTeX
@inproceedings{abbeel2008apprenticeship,
  author = {Pieter Abbeel and Dmitri Dolgov and Andrew Y. Ng and Sebastian Thrun},
  title = {{Apprenticeship learning for motion planning with application to parking lot navigation}},
  booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
  year = {2008},
  url = {https://openreview.net/forum?id=HWyFOLHkyVA},
}

Loading related content...

Figure