In this work we consider a mobile robot with a laser range finder. Our goal is to find the best set of lines from the sequence of points given by a laser scan. We propose a probabi...
We propose an algorithm for assessing probabilistic performance constraints for systems including components with uncertain delays. We make a case for designing systems based on a...
Gustavo de Veciana, Margarida F. Jacome, J.-H. Guo
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
— This paper describes a method of probabilistic obstacle map building based on Bayesian estimation. Most active or passive obstacle sensors observe only the most frontal objects...
— We propose two contrasting approaches to the scalable distributed control of a swarm of self-assembling miniaturized robots, specifically the formation of chains of a desired ...