Fetching the paper…
Reading the bibliography…
The conventional model for online planning under uncertainty assumes that an agent can stop and plan without incurring costs for the time spent planning.
Dynamic Programming and Markov Processes
R.A. Howard · 1960
Earlier work this paper cites.
Reasoning about beliefs and actions under computational resource constraints
Eric Horvitz · 1987
Earlier work this paper cites.
Reflection and action under scarce resources: Theoretical principles and empirical study
Eric J. Horvitz, Gregory F. Cooper, and David E.Heckerman · 1989
Earlier work this paper cites.
Ideal reformulation of belief networks
John S. Breese and Eric Horvitz · 1990
Earlier work this paper cites.
Ideal partition of resources for metareasoning
Eric J. Horvitz and John S. Breese · 1990
Earlier work this paper cites.
Principles of metareasoning
Stuart Russell and Eric Wefald · 1991
Earlier work this paper cites.
Anytime sensing, planning and action: A practical model for robot control
Shlomo Zilberstein and Stuart J. Russell · 1993
Earlier work this paper cites.
Learning to act using real-time dynamic programming
Andrew G. Barto, Steven J. Bradtke, and Satinder P. Singh · 1995
Earlier work this paper cites.
Planning under time constraints in stochastic domains
Thomas Dean, Leslie Pack Kaelbling, Jak Kirman, and Ann Nicholson · 1995
Earlier work this paper cites.
Reasoning, metareasoning, and mathematical truth: Studies of theorem proving under limited resources
Eric Horvitz and Adrian Klein · 1995
Cited alongside, same era.
Neuro-dynamic Programming
Dimitri P. Bertsekas and John Tsitsiklis · 1996
Cited alongside, same era.
Optimal composition of real-time systems
Shlomo Zilberstein and Stuart Russell · 1996
Cited alongside, same era.
Introduction to Reinforcement Learning
Richard S. Sutton and Andrew G. Barto · 1998
Cited alongside, same era.
Monitoring and control of anytime algorithms: A dynamic programming approach
Eric A Hansen and Shlomo Zilberstein · 2001
Cited alongside, same era.
A bayesian approach to tackling hard computational problems
Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry Kautz, Bart Selman, and David M. Chickering · 2001
Bounded real-time dynamic programming: Rtdp with monotone upper bounds and performance guarantees
H. Brendan McMahan, Maxim Likhachev, and Geoffrey J. Gordon · 2005
Later among the works it cites.
Bandit based monte-carlo planning
Levente Kocsis and Csaba Szepesvári · 2006
Later among the works it cites.
Ivestigations of continual computation
Dafna Shahaf and Eric Horvitz · 2009
Later among the works it cites.
Selecting computations: Theory and applications
Nick Hay, Stuart Russell, David Toplin, and Solomon Eyal Shimony · 2012
Later among the works it cites.
Lrtdp vs uct for online probabilistic planning
Andrey Kolobov, Mausam, and Daniel S. Weld · 2012
Later among the works it cites.
Heuristic search when time matters
Ethan Burns, Wheeler Ruml, and Minh B. Do · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Principles and applications of continual computation
Eric Horvitz · 2001
Cited alongside, same era.
Dynamic restart policies
Henry Kautz, Eric Horvitz, Yongshao Ruan, Carla Gomes, and Bart Selman · 2002
Cited alongside, same era.
A robotic execution framework for online probabilistic (re)planning
Caroline P. Carvalho Chanel, Charles Lesire, and Florent Teichteil-Königsbuch · 2014
Later among the works it cites.
Better be lucky than good: Exceeding expectations in mdp evaluation
Thomas Keller and Florian Geißer · 2015
Closest in time.