Sciweavers

25 search results - page 3 / 5
» On Smale's 17th Problem: A Probabilistic Positive Solution
Sort
View
AIPS
2009
14 years 10 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
PVLDB
2010
97views more  PVLDB 2010»
14 years 7 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 10 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
IJSR
2010
153views more  IJSR 2010»
14 years 6 months ago
A Bank of Unscented Kalman Filters for Multimodal Human Perception with Mobile Service Robots
A new generation of mobile service robots could be ready soon to operate in human environments if they can robustly estimate position and identity of surrounding people. Researcher...
Nicola Bellotto, Huosheng Hu
TPDS
2008
161views more  TPDS 2008»
14 years 9 months ago
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...
You-Chiun Wang, Yu-Chee Tseng