Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Incremental heuristic search

Incremental heuristic search algorithms combine both incremental and heuristic search to speed up searches of sequences of similar search problems… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
A multiobjective incremental heuristic search algorithm which combines heuristic search with incremental search is put forward… Expand
Is this relevant?
2009
2009
We present a system that enables multiple heterogenous mobile robots to build and share an appearance based map appropriate for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Real-time situated agents, such as characters in real-time computer games, often do not know the terrain in advance but… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2006
2006
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
2004
Review
2004
Incremental search reuses information from previous searches to find solutions to a series of similar search problems potentially… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Heuristic search methods promise to find shortest paths for path-planning problems faster than uninformed search methods… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
In this paper, we investigate the face recognition problem via energy histogram of the DCT coefficients. Several issues related… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
2004
2004
Incremental search reuses information from previous searches to find solutions to a series of similar search problems potentially… Expand
Is this relevant?