Sciweavers

1068 search results - page 181 / 214
» Extremely randomized trees
Sort
View
ICRA
2009
IEEE
182views Robotics» more  ICRA 2009»
14 years 4 months ago
Manipulation planning on constraint manifolds
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
INFOCOM
2009
IEEE
14 years 4 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
INFOCOM
2009
IEEE
14 years 4 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
14 years 4 months ago
Planning fireworks trajectories for steerable medical needles to reduce patient trauma
— Accurate needle insertion in 3D environment is always a grand challenge. When multiple targets are located in the tissue, a procedure of inserting multiple needles from a singl...
Jijie Xu, Vincent Duindam, Ron Alterovitz, Jean Po...
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 4 months ago
Stochastic mobility-based path planning in uncertain environments
— The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generat...
Gaurav Kewlani, Genya Ishigami, Karl Iagnemma