On information invariants in robotics
Artificial Intelligence - Special volume on computational research on interaction and agency, part 1
Communication in reactive multiagent robotic systems
Autonomous Robots
Rendezvous Search on the Line With Distinguishable Players
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
Rendezvous Search on the Line with Indistinguishable Players
SIAM Journal on Control and Optimization
Heterogeneous multi-robot cooperation
Heterogeneous multi-robot cooperation
Learning metric-topological maps for indoor mobile robot navigation
Artificial Intelligence
A Probabilistic Approach to Collaborative Multi-Robot Localization
Autonomous Robots
Learning topological maps with weak local odometric information
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Multi-robot exploration of an unknown environment, efficiently reducing the odometry error
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Integrating grid-based and topological maps for mobile robot navigation
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Collaborative Exploration of Unknown Environments with Teams of Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Improved approximation algorithms for the freeze-tag problem
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
International Journal of Robotics Research
Multi-robot Simultaneous Localization and Mapping using Particle Filters
International Journal of Robotics Research
Achieving connectivity through coalescence in mobile robot networks
Proceedings of the 1st international conference on Robot communication and coordination
Path planning using Shi and Karl level sets
Proceedings of the 1st international conference on Robot communication and coordination
Efficient exploration of unknown indoor environments using a team of mobile robots
Annals of Mathematics and Artificial Intelligence
Multiple UAV exploration of an unknown region
Annals of Mathematics and Artificial Intelligence
Multi-agent robot systems as distributed autonomous systems
Advanced Engineering Informatics
Multirobot rendezvous with visibility sensors in nonconvex environments
IEEE Transactions on Robotics
A quantitative assessment of structural errors in grid maps
Autonomous Robots
An algorithmic theory of mobile agents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Exploration strategy related design considerations of WSN-Aided mobile robot exploration teams
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Hi-index | 0.00 |
We consider the problem of how two heterogeneous robots can arrange to meet in an unknown environment from unknown starting locations: that is, the problem of arranging a robot rendezvous. We are interested, in particular, in allowing two robots to rendezvous so that they can collaboratively explore an unknown environment. Specifically, we address the problem of how a pair of exploring agents that cannot communicate with one another over long distances can meet if they start exploring at different unknown locations in an unknown environment.We propose several alternative algorithms that robots could use in attempting to rendezvous quickly while continuing to explore. These algorithms exemplify different classes of strategy whose relative suitability depends on characteristics of the problem definition. We consider the performance of our proposed algorithms analytically with respect to both expected- and worst-case behavior. We then examine their behavior under a wider set of conditions using both numerical analysis and also a simulation of multi-agent exploration and rendezvous. We examine the exploration speed, and show that a multi-robot system can explore an unknown environment faster than a single-agent system, even with the constraint of performing rendezvous to allow communication.We conclude with a demonstration of rendezvous implemented on a pair of actual robots.