Bounded Anytime Deflation
نویسنده
چکیده
This paper rearranges a key property of anytime algorithms to derive a technique that determines an admissible lower bound on the minimum solution cost. In conjunction with a class of performance metric known as ‘time-focussed metrics’, the technique can be used to determine when to abort the deflation process within an anytime planning algorithm. The aim of this paper is to exploit this technique to determine when to abort an anytime planning process, however the technique is shown to be unsuitable for dynamic state spaces. Despite this, the bounded anytime deflation technique is applicable to the wider field of anytime optimisation, and may be expected to have application outside the planning domain.
منابع مشابه
Anytime Bounded Rationality
Dependable cyber-physical systems strive to deliver anticipative, multi-objective performance anytime, facing deluges of inputs with varying and limited resources. This is even more challenging for life-long learning rational agents as they also have to contend with the varying and growing know-how accumulated from experience. These issues are of crucial practical value, yet have been only marg...
متن کاملA Bounded Error, Anytime, Parallel Algorithm for Exact Bayesian Network Structure Learning
Bayesian network structure learning is NP-hard. Several anytime structure learning algorithms have been proposed which guarantee to learn optimal networks if given enough resources. In this paper, we describe a general purpose, anytime search algorithm with bounded error that also guarantees optimality. We give an efficient, sparse representation of a key data structure for structure learning. ...
متن کاملEvaluation of Jacobian Matrices for Newton’s Method with Deflation to approximate Isolated Singular Solutions of Polynomial Systems
For isolated singular solutions of polynomial systems, we can restore the quadratic convergence of Newton’s method by deflation. The number of deflation stages is bounded by the multiplicity of the root. A preliminary implementation performs well in case only a few deflation stages are needed, but suffers from expression swell as the number of deflation stages grows. In this paper we describe h...
متن کامل$-calculus Bounded Rationality = Process Algebra + Anytime Algorithms
$-calculus is a higher-order polyadic process algebra with a utility (cost) integrating deliberative and reactive approaches for action selection in real time, and allowing to capture bounded optimization and metaresoning in distributed interactive AI systems. In this paper we present basic notions of $-calculus and demonstrate the versatility of its k meta-control to plan behaviors for single ...
متن کاملAnytime Marginal MAP Inference
This paper presents a new anytime algorithm for the marginal MAP problem in graphical models of bounded treewidth. We show asymptotic convergence and theoretical error bounds for any fixed step. Experiments show that it compares well to a state-of-the-art systematic search algorithm.
متن کامل