Skip to search formSkip to main contentSkip to account menu

Incremental heuristic search

Incremental heuristic search algorithms combine both incremental and heuristic search to speed up searches of sequences of similar search problems… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning… 
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… 
2009
2009
Fringe-Saving A* is an incremental version of A* that repeatedly finds shortest paths from a fixed start cell to a fixed goal… 
2009
2009
Incremental search reuses information from previous searches to find solutions to a series of similar search problems.It is… 
2009
2009
We investigate consistency properties of workflows from the perspectives of control flow and evidence life cycles for incremental… 
2009
2009
A multiobjective incremental heuristic search algorithm which combines heuristic search with incremental search is put forward… 
Review
2004
Review
2004
Incremental search reuses information from previous searches to find solutions to a series of similar search problems potentially… 
Highly Cited
2004
Review
2004
Review
2004
Incremental search reuses information from previous searches to find solutions to a series of similar search problems potentially… 
Highly Cited
2003
Highly Cited
2003
BGP is essential to the operation of the Internet, but is vulnerable to both accidental failures and malicious attacks. We…