Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
Russell Gayle, William Moss, Ming C. Lin, Dinesh M...
We describe a methodology for representing and optimizing user preferences on plans. Our approach differs from previous work on plan optimization in that we employ a generalizatio...
Gregg Rabideau, Barbara Engelhardt, Steve A. Chien
Traditionally, network operators have only used simple flat-rate unlimited data plans to vie for customers. But today, with the popularity of mobile devices and exponential growt...
Soumya Sen, Carlee Joe-Wong, Sangtae Ha, Mung Chia...
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...