Learn More
The copyright to the Contribution identified above is transferred to Springer-Verlag GmbH Berlin Heidelberg (hereinafter called Springer-Verlag). The copyright transfer covers the sole right to print, publish, distribute and sell throughout the world the said Contribution and parts thereof, including all revisions or versions and future editions thereof and(More)
This article describes a simple monocular navigation system for a mobile robot based on map and replay technique. The presented method is robust, easy to implement, does not require sensor calibration or structured environment and its computational complexity is independent of the environment size. The method can navigate a robot while sensing only one(More)
We present a fast and precise vision-based software intended for multiple robot localization. The core component of the software is a novel and efficient algorithm for black and white pattern detection. The method is robust to variable lighting conditions, achieves sub-pixel precision and its computational complexity is independent of the processed image(More)
In this paper, we present a novel path planning algorithm based on properties that reaction-diffusion (RD) models exhibit by the underlying non-linear dynamics of the considered system. In particular herein considered a two-variable RD model provides advantages of natural parallelism, noise resistance, and especially the non-annihilating feature that(More)
— In this paper, we present a small, lightweight , low-cost, fast and reliable system designed to satisfy requirements of relative localization within a swarm of micro aerial vehicles. The core of the proposed solution is based on off-the-shelf components consisting of the Caspa camera module and Gumstix Overo board accompanied by a developed efficient(More)
In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron weights that evolves in W, while obstacles are considered by approximation of the shortest path. The(More)
In this paper, we address the inspection planning problem to " see " the whole area of the given workspace by a mobile robot. The problem is decoupled into the sensor placement problem and the multi-goal path planning problem to visit found sensing locations. However the decoupled approach provides a feasible solution, its overall quality can be poor,(More)