Sciweavers

3758 search results - page 32 / 752
» A Complete Subsumption Algorithm
Sort
View
AIPS
1994
13 years 9 months ago
UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presente...
Kutluhan Erol, James A. Hendler, Dana S. Nau
CVPR
2010
IEEE
14 years 4 months ago
Robust video denoising using low rank matrix completion
Most existing video denoising algorithms assume a single statistical model of image noise, e.g. additive Gaussian white noise, which often is violated in practice. In this paper, ...
Hui Ji, Chaoqiang Liu, Zuowei Shen, Yuhong Xu
CVPR
2008
IEEE
14 years 2 months ago
Stereoscopic inpainting: Joint color and depth completion from stereo images
We present a novel algorithm for simultaneous color and depth inpainting. The algorithm takes stereo images and estimated disparity maps as input and fills in missing color and d...
Liang Wang, Hailin Jin, Ruigang Yang, Minglun Gong
ICRA
2010
IEEE
127views Robotics» more  ICRA 2010»
13 years 6 months ago
Probabilistically complete planning with end-effector pose constraints
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
Dmitry Berenson, Siddhartha S. Srinivasa
RTSS
1994
IEEE
13 years 11 months ago
On-Line Scheduling to Maximize Task Completions
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma