Results 1 - 10 of 508

Real-time search in non-deterministic domains

by Sven Koenig, Reid G. Simmons - In Proceedings of the IJCAI , 1995
"... Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching nondeterministic domains since they do not have to plan for every contingency { they can react to the actual outcomes of actions. ..."
Abstract - Cited by 55 (15 self) - Add to MetaCart
Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching nondeterministic domains since they do not have to plan for every contingency { they can react to the actual outcomes of actions

Real-Time Search in Non-Deterministic Domains*

by unknown authors
"... Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching nondeterministic domains since they do not have to plan for every contingency they can react to the actual outcomes of actions. In ..."
Abstract - Add to MetaCart
Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching nondeterministic domains since they do not have to plan for every contingency they can react to the actual outcomes of actions

Real-Time Search in Non-Deterministic Domains ∗

by unknown authors
"... Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching non-deterministic domains since they do not have to plan for every contingency – they can react to the actual outcomes of actions. ..."
Abstract - Add to MetaCart
Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching non-deterministic domains since they do not have to plan for every contingency – they can react to the actual outcomes of actions

Planning as Model Checking for Extended Goals in Non-Deterministic Domains

by Marco Pistore, Paolo Traverso , 2001
"... Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal properties. However, the combination of these two aspects is not trivial. In non-deterministic domains, goals should take ..."
Abstract - Cited by 77 (14 self) - Add to MetaCart
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal properties. However, the combination of these two aspects is not trivial. In non-deterministic domains, goals should take

Symbolic Techniques for Planning With Extended Goals in Non-Deterministic Domains

by Marco Pistore , Renato Bettin, Paolo Traverso , 2001
"... Several real world applications require planners that deal with non-deterministic domains and with temporally extended goals. Recent research is addressing this planning problem. However, the ability of dealing in practice with large state spaces is still an open problem. Indeed, this is one of t ..."
Abstract - Cited by 28 (6 self) - Add to MetaCart
Several real world applications require planners that deal with non-deterministic domains and with temporally extended goals. Recent research is addressing this planning problem. However, the ability of dealing in practice with large state spaces is still an open problem. Indeed, this is one

Synthesis of Fault Tolerant Plans for Non-Deterministic Domains

by Rune Jensen , Manuela M. Veloso, Randal E. Bryant - IN WORKSHOP ON PLANNING UNDER UNCERTAINTY AND INCOMPLETE INFORMATION , 2003
"... Non-determinism is often caused by infrequent errors that make otherwise deterministic actions fail. In this paper, we introduce fault tolerant planning to address this problem. An n-fault tolerant plan is guaranteed to recover from up to n errors occurring during its execution. We show how opti ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
optimal n-fault tolerant plans can be generated via the strong universal planning algorithm. This algorithm uses an implicit search technique based on the reduced Ordered Binary Decision Diagram (OBDD) that is particularly well suited for non-deterministic planning and has outperformed most

Planning Graph Heuristics for Incomplete and Non-Deterministic Domains

by Daniel Bryce , 2004
"... This doctoral work centers on developing domain-independent heuristics for planning problems characterized by state incompleteness and action non-determinism. The key means by which the heuristics are computed is through planning graph analysis. The approach has been used to construct conformant ..."
Abstract - Add to MetaCart
This doctoral work centers on developing domain-independent heuristics for planning problems characterized by state incompleteness and action non-determinism. The key means by which the heuristics are computed is through planning graph analysis. The approach has been used to construct

Automatic OBDD-based Generation of Universal Plans in Non-Deterministic Domains

by A. Cimatti, M. Roveri, P. Traverso , 1998
"... Most real world environments are non-deterministic. Automatic plan formation in non-deterministic domains is, however, still an open problem. In this paper we present a practical algorithm for the automatic generation of solutions to planning problems in nondeterministic domains. Our approach h ..."
Abstract - Cited by 99 (21 self) - Add to MetaCart
Most real world environments are non-deterministic. Automatic plan formation in non-deterministic domains is, however, still an open problem. In this paper we present a practical algorithm for the automatic generation of solutions to planning problems in nondeterministic domains. Our approach

Inducing Fuzzy Decision Trees in Non-Deterministic Domains using CHAID

by Jay Fowdar, Zuhair B, Keeley Crockett, M Gd
"... Most decision tree induction methods used for extracting knowledge in classification problems are unable to deal with uncertainties embedded within the data, associated with human thinking and perception. This paper describes the development of a novel tree induction algorithm which improves the cla ..."
Abstract - Add to MetaCart
the classification accuracy of decision tree induction in non-deterministic domains. The research involved applies the principles of fuzzy theory to the CHAID (Chi-Square Automatic Interaction Detection) algorithm in order to soften the sharp decision boundaries which are inherent in traditional decision tree

OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains

by Rune M. Jensen, Manuela M. Veloso - Journal of Artificial Intelligence Research , 2000
"... Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic finite automaton ..."
Abstract - Cited by 60 (17 self) - Add to MetaCart
Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic finite automaton
Results 1 - 10 of 508