Monitoring and control of anytime algorithms: A dynamic programming approach

DOI10.1016/S0004-3702(00)00068-0MaRDI QIDQ5940822zbMATH OpenWikidataFDO

Authors E. A. Hansen, Shlomo Zilberstein

Publication date 20 August 2001

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(00)00068-0

zbMATH Keywords

anytime algorithmsflexible computationmeta-level controlmonitoringreal-time deliberationresource-bounded reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Optimal schedules for monitoring anytime algorithms
• Dynamic programming in control
• scientific article; zbMATH DE number 4077080
• Anytime Control Algorithms for Embedded Real-Time Systems
• Dynamic programming algorithms for solving stochastic discrete control problems
• Timely monitoring of partially observable stochastic systems
• An Approximate Dynamic Programming Approach to Multiagent Persistent Monitoring in Stochastic Environments With Temporal Logic Constraints
• Dynamic monitoring under resource constraints
• Design and Stability Analysis for Anytime Control via Stochastic Scheduling
• An Optimal Control Approach to the Multi-Agent Persistent Monitoring Problem

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Deliberation scheduling for problem solving in time-constrained environments
• scientific article; zbMATH DE number 4176499 (Why is no real title available?)
• scientific article; zbMATH DE number 4162295 (Why is no real title available?)
• scientific article; zbMATH DE number 4162304 (Why is no real title available?)
• scientific article; zbMATH DE number 4061056 (Why is no real title available?)
• scientific article; zbMATH DE number 19871 (Why is no real title available?)
• scientific article; zbMATH DE number 1149416 (Why is no real title available?)
• On the Regularity of Moment Methods of Summation
• Optimal composition of real-time systems
• Optimizing decision trees through heuristically guided search
• Principles of metareasoning
• The traveling salesman. Computational solutions for RSP applications

Cited in

(12)

• A model of anytime algorithm performance for bi-objective optimization
• Optimal composition of real-time systems
• Optimal feedback scheduling of model predictive controllers
• On a control algorithm for time-varying processor availability
• Heuristic search under contract
• scientific article; zbMATH DE number 67465 (Why is no real title available?)
• scientific article; zbMATH DE number 2000819 (Why is no real title available?)
• Investigating Anytime Algorithms for Future Distance Warning Systems
• Optimal schedules for monitoring anytime algorithms
• Bargaining with limited computation: Deliberation equilibrium
• Learning dynamic algorithm portfolios
• Combining VNS with constraint programming for solving anytime optimization problems

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Monitoring and control of anytime algorithms: A dynamic programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940822)