Anytime algorithm

Known as: Anytime 
In computer science, an anytime algorithm is an algorithm that can return a valid solution to a problem even if it's interrupted at any time before… (More)
Wikipedia

Related topics

Related topics

18 relations
Action selectionAlgorithmAnalysis of algorithmsBeam search
(More)

Broader (1)

Artificial intelligence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Anytime Motion Planning using the RRT*
The Rapidly-exploring Random Tree (RRT) algorithm, based on incremental sampling, efficiently computes motion plans. Although the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
An Anytime Algorithm for Optimal Coalition Structure Generation
Coalition formation is a fundamental type of interaction that involves the creation of coherent groupings of distinct, autonomous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Anytime search in dynamic graphs
Agents operating in the real world often have limited time available for planning their next actions. Producing optimal plans is… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Anytime Heuristic Search
We describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Anytime RRTs
We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Anytime Dynamic A*: An Anytime, Replanning Algorithm
We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
In real world planning problems, time for deliberation is often limited. Anytime planners are well suited for these problems… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Anytime Algorithm Development Tools
Anytime algorithms are playing an increasingly important role in the construction of effective reasoning and planning systems… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Operational Rationality through Compilation of Anytime Algorithms
description of the domain In a hierarchical (quad-trees) representation, the level of abstraction corresponds to a certain coarse… (More)
Is this relevant?