Symmetric Linear Rendezvous with an Unknown Initial Distance
2011-03-28
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Symmetric Linear Rendezvous with an Unknown Initial Distance
Authors
Published Date
2011-03-28
Publisher
Type
Report
Abstract
Imagine two robots trying to meet. They do not know each other's locations. How should they move so that they meet as quickly as possible? This classical rendezvous problem has numerous applications in search-and-rescue, network formation, multi-robot exploration and mapping.
We study symmetric rendezvous on the line and introduce a new version of the problem in which the robots do not have any information about their initial distance. Further, they must execute the same strategy. We present an algorithm that is 19.166-competitive in terms of distance traveled, and discuss further refinements. As an application of our algorithm, we present results from an experiment in which two mobile robots try to meet in a corridor.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Beveridge, Andrew; Ozsoyeller, Deniz. (2011). Symmetric Linear Rendezvous with an Unknown Initial Distance. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215855.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.