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

Related topics

Related topics

12 relations
A* search algorithmAny-angle path planningData stream miningEvolving intelligent system
Expand

Broader (2)

Artificial intelligenceRobot control

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
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
2009
2009
BDD-Based Incremental Heuristic Search
Incremental search reuses information from previous searches to find solutions to a series of similar search problems.It is… Expand
Highly Cited
2009
Highly Cited
2009
Efficient interactive fuzzy keyword search
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
2009
2009
A Multiobjective Incremental Heuristic Search Algorithm
A multiobjective incremental heuristic search algorithm which combines heuristic search with incremental search is put forward… Expand
2009
2009
Dynamic fringe-saving A*
Fringe-Saving A* is an incremental version of A* that repeatedly finds shortest paths from a fixed start cell to a fixed goal… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Highly Cited
2008
Highly Cited
2008
Comparing real-time and incremental heuristic search for real-time situated agents
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
Highly Cited
2007
Highly Cited
2007
A shortest path algorithm with novel heuristics for dynamic transportation networks
Finding an optimal route in dynamic real‐time transportation networks is a critical problem for vehicle navigation. Existing… Expand
Review
2004
Review
2004
Incremental Heuristic Search in AI
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
Highly Cited
2003
Highly Cited
2003
Working around BGP: An Incremental Approach to Improving Security and Accuracy in Interdomain Routing
BGP is essential to the operation of the Internet, but is vulnerable to both accidental failures and malicious attacks. We… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2001
Highly Cited
2001
Incremental A*
Incremental search techniques find optimal solutions to series of similar search tasks much faster than is possible by solving… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE