— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
In this paper, we present a purely incremental, scalable algorithm for the detection of elliptical shapes in images. Our method uses an incremental version of the Random Hough Tra...
Abstract— In this paper, we present a novel fair queue management algorithm called Stochastic RED (StoRED), inspired by the well known stochastic fair queuing and based on the ra...
In this paper, we study the security of an image scrambling algorithm based on Space-Filling Curves (SFC). A random SFC is a pixel permutation that changes the scanning order with...
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...