Sciweavers

4973 search results - page 161 / 995
» Probabilistic Algorithms in Robotics
Sort
View
ICDCN
2009
Springer
16 years 1 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
AIPS
2000
15 years 7 months ago
Vision-Servoed Localization and Behavior-Based Planning for an Autonomous Quadruped Legged Robot
Planning for real robots to act in dynamic and uncertain environments is a challenging problem. A complete model of the world is not viable and an integration of deliberation and ...
Manuela M. Veloso, Elly Winner, Scott Lenser, Jame...
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
15 years 11 months ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon
AIPS
2011
14 years 10 months ago
Planning to Perceive: Exploiting Mobility for Robust Object Detection
Consider the task of a mobile robot autonomously navigating through an environment while detecting and mapping objects of interest using a noisy object detector. The robot must re...
Javier Vélez, Garrett Hemann, Albert S. Hua...
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
16 years 6 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...