Abstract— We provide a method for planning under uncertainty for robotic manipulation by partitioning the configuration space into a set of regions that are closed under complia...
Learning on real robots in an real, unaltered environment provides an extremely challenging problem. Many of the simplifying assumptions made in other areas of learning cannot be ...
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...