Sciweavers

547 search results - page 11 / 110
» A Planning Algorithm not based on Directional Search
Sort
View
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
14 years 5 days ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
AAAI
2010
13 years 9 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
TSE
2010
123views more  TSE 2010»
13 years 2 months ago
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking
Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper we apply directed explicit state space search to discrete- a...
Husain Aljazzar, Stefan Leue
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
CORR
2011
Springer
160views Education» more  CORR 2011»
12 years 11 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos