Sciweavers

181 search results - page 14 / 37
» Online Planning Algorithms for POMDPs
Sort
View
AIPS
2007
15 years 2 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
AIPS
2000
15 years 1 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
JAIR
2007
114views more  JAIR 2007»
14 years 11 months ago
Marvin: A Heuristic Search Planner with Online Macro-Action Learning
This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macro...
Andrew Coles, Kate A. Smith
AIPS
2008
15 years 2 months ago
Angelic Hierarchical Planning: Optimal and Online Algorithms
Bhaskara Marthi, Stuart J. Russell, Jason Wolfe
ATAL
2006
Springer
15 years 3 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....