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...
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
Several methods can be used for a robot to return to a previously visited position. In our approach we use the average landmark vector method to calculate a homing vector which sho...