{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:04Z","timestamp":1759847344979},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/tro.2013.2272252","type":"journal-article","created":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T18:04:16Z","timestamp":1374257056000},"page":"1366-1379","source":"Crossref","is-referenced-by-count":15,"title":["Symmetric Rendezvous Search on the Line With an Unknown Initial Distance"],"prefix":"10.1109","volume":"29","author":[{"given":"Deniz","family":"Ozsoyeller","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Beveridge","sequence":"additional","affiliation":[]},{"given":"Volkan","family":"Isler","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.6.974"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.3.604"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.3.498.12432"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIC.1998.713735"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2003.1249327"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02798690"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1054"},{"key":"ref17","author":"gal","year":"1980","journal-title":"Search Games"},{"key":"ref18","first-page":"372","article-title":"Optimal construction of hybrid algorithms","author":"kao","year":"1994","journal-title":"Proc 5th ACM-SIAM Symp Discrete Algorithms"},{"key":"ref19","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199904)46:3<335::AID-NAV6>3.0.CO;2-Q"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993260707"},{"key":"ref6","first-page":"69","article-title":"Improved bounds for the symmetric rendezvous value on the line","author":"han","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref5","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993260288"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95891-8_45"},{"key":"ref2","author":"alpern","year":"2003","journal-title":"The Theory of Search Games and Rendezvous"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993249195"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012996314130"},{"key":"ref20","year":"0"},{"key":"ref21","year":"0"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8860\/6670312\/06564428.pdf?arnumber=6564428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:38:11Z","timestamp":1642005491000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6564428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":21,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tro.2013.2272252","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}