71 search results - page 13 / 15 » Partial Order Reduction for Probabilistic Branching Time |
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
AAAI
2010
13 years 11 months ago
2010
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...
KBSE
2000
IEEE
14 years 2 months ago
2000
IEEE
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...