ARA*: Anytime A* with Provable Bounds on Sub-Optimality

Maxim Likhachev, Geoffrey J. Gordon, Sebastian Thrun. ARA*: Anytime A* with Provable Bounds on Sub-Optimality. In Sebastian Thrun, Lawrence K. Saul, Bernhard Schölkopf, editors, Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, NIPS 2003, December 8-13, 2003, Vancouver and Whistler, British Columbia, Canada]. pages 767-774, MIT Press, 2003. [doi]

@inproceedings{LikhachevGT03,
  title = {ARA*: Anytime A* with Provable Bounds on Sub-Optimality},
  author = {Maxim Likhachev and Geoffrey J. Gordon and Sebastian Thrun},
  year = {2003},
  url = {http://books.nips.cc/papers/files/nips16/NIPS2003_CN03.pdf},
  researchr = {https://researchr.org/publication/LikhachevGT03},
  cites = {0},
  citedby = {0},
  pages = {767-774},
  booktitle = {Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, NIPS 2003, December 8-13, 2003, Vancouver and Whistler, British Columbia, Canada]},
  editor = {Sebastian Thrun and Lawrence K. Saul and Bernhard Schölkopf},
  publisher = {MIT Press},
  isbn = {0-262-20152-6},
}