—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
Abstract-- Motion planning of deformable objects is challenging due to the high degrees-of-freedom inherent in deformation as well as the computational cost of producing physically...
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...