Sciweavers

232 search results - page 28 / 47
» Randomized Kinodynamic Planning
Sort
View
EOR
2011
134views more  EOR 2011»
13 years 4 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
FOCS
2008
IEEE
14 years 4 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
ICRA
2009
IEEE
119views Robotics» more  ICRA 2009»
14 years 4 months ago
Survivability: Measuring and ensuring path diversity
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
Lawrence H. Erickson, Steven M. LaValle
ICCBR
2009
Springer
14 years 4 months ago
S-Learning: A Model-Free, Case-Based Algorithm for Robot Learning and Control
A model-free, case-based learning and control algorithm called S-learning is described as implemented in a simulation of a light-seeking mobile robot. S-learning demonstrated learn...
Brandon Rohrer
ICRA
2006
IEEE
70views Robotics» more  ICRA 2006»
14 years 3 months ago
Pushing using Compliance
— This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open spaces, we also a...
Dennis Nieuwenhuisen, A. Frank van der Stappen, Ma...