Sciweavers

169 search results - page 21 / 34
» Tractability of Planning with Loops
Sort
View
JAIR
2006
157views more  JAIR 2006»
13 years 6 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
CI
2005
106views more  CI 2005»
13 years 6 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
ATAL
2005
Springer
14 years 8 days ago
Multiagent coordination by Extended Markov Tracking
We present here Extended Markov Tracking (EMT), a computationally tractable method for the online estimation of Markovian system dynamics, along with experimental support for its ...
Zinovi Rabinovich, Jeffrey S. Rosenschein
AAAI
1996
13 years 8 months ago
What Is Planning in the Presence of Sensing?
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
Hector J. Levesque
PDSE
2000
96views more  PDSE 2000»
13 years 8 months ago
Applying Distributed Object Technology to Network Planning
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ...
Tertius D. Wessels, Judy M. Bishop