Sciweavers

875 search results - page 154 / 175
» On Reachability Under Uncertainty
Sort
View
ICRA
2009
IEEE
210views Robotics» more  ICRA 2009»
13 years 6 months ago
An adaptive-scale robust estimator for motion estimation
Although RANSAC is the most widely used robust estimator in computer vision, it has certain limitations making it ineffective in some situations, such as the motion estimation prob...
Trung Ngo Thanh, Hajime Nagahara, Ryusuke Sagawa, ...
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
13 years 6 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
ICTAI
2009
IEEE
13 years 6 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
IJAR
2010
139views more  IJAR 2010»
13 years 5 months ago
Imprecise expectations for imprecise linear filtering
In the last 10 years, there has been increasing interest in interval valued data in signal processing. According to the conventional view, an interval value supposedly reflects th...
Agnès Rico, Olivier Strauss
JAIR
2011
103views more  JAIR 2011»
13 years 3 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss