@article{osherovich08all,
author = {E. Osherovich and A. M. Bruckstein},
title = {All triangulations are reachable via sequences of edge-flips: an elementary proof},
journal = {Computer Aided Geometric Design},
year = {2008},
volume = {25},
pages = {157--161},
number = {3},
abstract = {A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.},
address = {Amsterdam, The Netherlands, The Netherlands},
doi = {http://dx.doi.org/10.1016/j.cagd.2007.07.002},
file = {:osherovich08all.pdf:PDF},
issn = {0167-8396},
publisher = {Elsevier Science Publishers B. V.}
}
@inproceedings{osherovich06covering,
author = {Eliyahu Osherovich and Alfred M. Bruckstein and Vladimir Yanovski},
title = {Covering a Continuous Domain by Distributed, Limited Robots},
booktitle = {ANTS Workshop},
year = {2006},
editor = {Marco Dorigo and Luca Maria Gambardella and Mauro Birattari and Alcherio Martinoli and Riccardo Poli and Thomas St{\"u}tzle},
volume = {4150},
series = {Lecture Notes in Computer Science},
pages = {144--155},
publisher = {Springer},
abstract = {We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in their neighborhood. These pheromone marks can be sensed by all robots and thus provide a way for indirect communication between the robots. Apart from this, the robots have no means to communicate. Additionally they are memoryless, have no global information such as the domain map, own position, coverage percentage, etc. Despite the robots’ simplicity, we show that they are able to cover efficiently any connected domains, including non-planar ones.},
bibdate = {2006-12-07},
bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/antsw/antsw2006.html#OsherovichBY06},
file = {:osherovich06covering.pdf:PDF},
isbn = {3-540-38482-0},
url = {http://dx.doi.org/10.1007/11839088_13}
}
@article{osherovich08robust,
author = {Eliyahu Osherovich and Vladimir Yanovski and Israel A. Wagner and Alfred M. Bruckstein},
title = {Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts},
journal = {The International Journal of Robotics Research},
year = {2008},
volume = {27},
pages = {815--831},
number = {7},
month = {July},
abstract = {We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark places visited with pheromone marks and sense the level of the pheromone in their local neighborhood. In the case of multiple robots, these pheromone marks can be sensed by all robots and provide the only way of (indirect) communication between the robots. The robots are assumed to be memoryless, and to have no information besides that mentioned above. Despite the robots' simplicity we show that they are able, by running a very simple rule of behavior, to ensure efficient covering of arbitrary connected domains, including non-planar and multidimensional domains. The novelty of our algorithm lies in the fact that, unlike previously proposed methods, our algorithm works on continuous domains without relying on some induced underlying graph effectively reducing the problem to a discrete case of graph covering. In addition, we demonstrate various benefits of our algorithm such as ability to cope with arbitrary initial pheromone profile and a bounded constant time between two successive visits of the robot at the same location, making it suitable for patrolling. Finally, we provide a new theoretical bound on covering time of a wide family of such mark and walk algorithms.},
doi = {10.1177/0278364908092465},
file = {:osherovich08robust.pdf:PDF},
owner = {eli},
timestamp = {2008.08.28},
url = {http://ijr.sagepub.com/cgi/content/abstract/27/7/815}
}
@inproceedings{osherovich09fast,
author = {Eliyahu Osherovich and Michael Zibulevsky and Irad Yavneh},
title = {Fast Reconstruction Method for Diffraction Imaging},
booktitle = {ISVC 2009},
year = {2009},
editor = {George Bebis and Richard Boyle and Darko Koracin and Bharam Parvin},
volume = {5876},
series = {Lecture Notes in Computer Science},
pages = {1063--1072},
publisher = {Springer},
abstract = {We present a fast image reconstruction method for two- and three-dimensional diffraction imaging. Provided that very little information about the phase is available, the method demonstrates convergence rates that are several orders of magnitude faster than current reconstruction techniques. Unlike current methods, our approach is based on convex optimization. Besides fast convergence, our method allows great deal of flexibility in choosing most appropriate objective function as well as introducing additional information about the sought signal, e.g., smoothness. Benefits of good choice of the objective function are demonstrated by reconstructing an image from noisy data.},
file = {:osherovich09fast.pdf:PDF},
owner = {eli},
timestamp = {2009.10.06}
}
