In this paper, we present a new approach for continuous probabilistic mapping. The objective is to build metric maps of unknown environments through cooperation between multiple au...
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
— This paper presents an algorithmic framework for conducting search and identification missions using multiple heterogeneous agents. Dynamic objects of type “neutral” or ...
Abstract— Researchers have addressed the localization problem for mobile robots using many different kinds of sensors, including rangefinders, cameras, and odometers. In this pa...
Lawrence H. Erickson, Joseph Knuth, Jason M. O'Kan...