Sciweavers

122 search results - page 19 / 25
» An Algorithm for Probabilistic Least-Commitment Planning
Sort
View
HRI
2006
ACM
15 years 3 months ago
Effective team-driven multi-model motion tracking
Autonomous robots use sensors to perceive and track objects in the world. Tracking algorithms use object motion models to estimate the position of a moving object. Tracking effic...
Yang Gu, Manuela M. Veloso
CSL
2003
Springer
15 years 2 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
COMPGEOM
1995
ACM
15 years 1 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
APWEB
2006
Springer
15 years 1 months ago
Providing an Uncertainty Reasoning Service for Semantic Web Application
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
Lei Li, Qiaoling Liu, Yunfeng Tao, Lei Zhang, Jian...
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
14 years 8 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake