Least-Squares Estimation of Transformation Parameters Between Two Point Patterns
IEEE Transactions on Pattern Analysis and Machine Intelligence
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Globally Consistent Range Scan Alignment for Environment Mapping
Autonomous Robots
Fast, On-Line Learning of Globally Consistent Maps
Autonomous Robots
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
Six Degree of Freedom Sensing for Docking Using IR LED Emitters and Receivers
ISER '00 Experimental Robotics VII
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Declarative networking: language, execution and optimization
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Semidefinite programming based algorithms for sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Robotics and Autonomous Systems
Miche: Modular Shape Formation by Self-Disassembly
International Journal of Robotics Research
Loopy belief propagation as a basis for communication in sensor networks
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
A multilevel relaxation algorithm for simultaneous localization and mapping
IEEE Transactions on Robotics
Self-assembly strategies in a group of autonomous mobile robots
Autonomous Robots
Hi-index | 0.00 |
Internal localization, the problem of estimating relative pose for each module of a modular robot, is a prerequisite for many shape control, locomotion, and actuation algorithms. In this paper, we propose a robust hierarchical approach that uses normalized cut to identify dense sub-regions with small mutual localization error, then progressively merges those sub-regions to localize the entire ensemble. Our method works well in both two and three dimensions, and requires neither exact measurements nor rigid inter-module connectors. Most of the computations in our method can be distributed effectively. The result is a robust algorithm that scales to large ensembles. We evaluate our algorithm in two- and three-dimensional simulations of scenarios with up to 10,000 modules.