Anytime search in dynamic graphs

  title={Anytime search in dynamic graphs},
  author={Maxim Likhachev and Dave Ferguson and Geoffrey J. Gordon and Anthony Stentz and Sebastian Thrun},
  journal={Artif. Intell.},
Agents operating in the real world often have limited time available for planning their next actions. Producing optimal plans is infeasible in these scenarios. Instead, agents must be satisfied with the best plans they can generate within the time available. One class of planners well-suited to this task are anytime planners, which quickly find an initial, highly suboptimal plan, and then improve this plan until time runs out. A second challenge associated with planning in the real world is… CONTINUE READING
Highly Cited
This paper has 165 citations. REVIEW CITATIONS



Citations per Year

165 Citations

Semantic Scholar estimates that this publication has 165 citations based on the available data.

See our FAQ for additional information.