Please use this identifier to cite or link to this item: https://doi.org/10.1002/nav.10005
DC FieldValue
dc.titleRendezvous of three agents on the line
dc.contributor.authorAlpern, S.
dc.contributor.authorLim, W.S.
dc.date.accessioned2013-10-09T02:45:58Z
dc.date.available2013-10-09T02:45:58Z
dc.date.issued2002
dc.identifier.citationAlpern, S., Lim, W.S. (2002). Rendezvous of three agents on the line. Naval Research Logistics 49 (3) : 244-255. ScholarBank@NUS Repository. https://doi.org/10.1002/nav.10005
dc.identifier.issn0894069X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/43814
dc.description.abstractThis paper considers a three-person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind and have a maximum speed of 1. Their common aim is to gather at a common location as quickly as possible. The main result is the proof that a strategy given by V. Baston is the unique minimax strategy. Baston's strategy ensures a three way rendezvous in time at most 3.5 for any of the 3!23 = 48 possible initial configurations corresponding to positions and directions of each agent. A connection is established between the above rendezvous problem and a search problem of L. Thomas in which two parents search separately to find their lost child and then meet again. © 2002 Wiley Periodicals, Inc. Naval Research Logistics.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1002/nav.10005
dc.sourceScopus
dc.subjectCoordinated search
dc.subjectRendezvous search
dc.typeArticle
dc.contributor.departmentMARKETING
dc.description.doi10.1002/nav.10005
dc.description.sourcetitleNaval Research Logistics
dc.description.volume49
dc.description.issue3
dc.description.page244-255
dc.description.codenNRLOE
dc.identifier.isiut000174449400002
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

6
checked on Dec 2, 2022

WEB OF SCIENCETM
Citations

4
checked on Dec 2, 2022

Page view(s)

318
checked on Dec 8, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.