The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces

Hang Dinh, Hieu T. Dinh, Laurent Michel, Alexander Russell

JAIR 2012 pp. 685-729

doi:10.1613/JAIR.3779 /jair/2012/dinh2012jair-time/

Abstract

We study the behavior of the We then experimentally explore to what extent our rigorous upper bounds predict the behavior of

PDF JAIR Semantic Scholar

Cite

Text

Dinh et al. "The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces." Journal of Artificial Intelligence Research, 2012. doi:10.1613/JAIR.3779

Markdown

[Dinh et al. "The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces." Journal of Artificial Intelligence Research, 2012.](https://mlanthology.org/jair/2012/dinh2012jair-time/) doi:10.1613/JAIR.3779

BibTeX

@article{dinh2012jair-time,
  title     = {{The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces}},
  author    = {Dinh, Hang and Dinh, Hieu T. and Michel, Laurent and Russell, Alexander},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2012},
  pages     = {685-729},
  doi       = {10.1613/JAIR.3779},
  volume    = {45},
  url       = {https://mlanthology.org/jair/2012/dinh2012jair-time/}
}