Sciweavers

66 search results - page 2 / 14
» Using Caching to Solve Larger Probabilistic Planning Problem...
Sort
View
AAAI
2000
13 years 6 months ago
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
Raul Trejo, Vladik Kreinovich, Chitta Baral
INFOCOM
2006
IEEE
13 years 11 months ago
Optimizing Caching Policy for Loss Recovery in Reliable Multicast
— In reliable multicast, data packets can be cached at some nodes such as repair servers for future possible retransmission in loss recovery schemes. How to cache packets to opti...
Feng Xie, Gang Feng, Xun Yang
AAAI
2010
13 years 6 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
AI
2011
Springer
13 years 11 days ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
IROS
2007
IEEE
206views Robotics» more  IROS 2007»
13 years 11 months ago
Dexterous manipulation planning using probabilistic roadmaps in continuous grasp subspaces
— In this paper, we propose a new method for the motion planning problem of rigid object dexterous manipulation with a robotic multi-fingered hand, under quasi-static movement a...
Jean-Philippe Saut, Anis Sahbani, Sahar El-Khoury,...