Sciweavers

4973 search results - page 343 / 995
» Probabilistic Algorithms in Robotics
Sort
View
IROS
2007
IEEE
107views Robotics» more  IROS 2007»
16 years 29 days ago
Scheduling for humans in multirobot supervisory control
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
Sandra Mau, John M. Dolan
AR
2007
105views more  AR 2007»
15 years 6 months ago
Reinforcement learning of a continuous motor sequence with hidden states
—Reinforcement learning is the scheme for unsupervised learning in which robots are expected to acquire behavior skills through self-explorations based on reward signals. There a...
Hiroaki Arie, Tetsuya Ogata, Jun Tani, Shigeki Sug...
ICRA
2010
IEEE
178views Robotics» more  ICRA 2010»
15 years 5 months ago
Autonomous operation of novel elevators for robot navigation
— Although robot navigation in indoor environments has achieved great success, robots are unable to fully navigate these spaces without the ability to operate elevators, includin...
Ellen Klingbeil, Blake Carpenter, Olga Russakovsky...
ICPR
2008
IEEE
16 years 1 months ago
On the scalability of robot localization using high-dimensional features
This study provides an investigation of scalability of mobile robot localization. In recent years, inference algorithms based on map-matching have proved their superior performanc...
Takeshi Ueda, Kanji Tanaka
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 6 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma