{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:35:24Z","timestamp":1761647724573,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,13]],"date-time":"2010-02-13T00:00:00Z","timestamp":1266019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10898-010-9526-8","type":"journal-article","created":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T08:49:44Z","timestamp":1265964584000},"page":"511-531","source":"Crossref","is-referenced-by-count":42,"title":["Optimal placement of UV-based communications relay nodes"],"prefix":"10.1007","volume":"48","author":[{"given":"Oleg","family":"Burdakov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Doherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaj","family":"Holmberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Per-Magnus","family":"Olsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,13]]},"reference":[{"key":"9526_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ (1993)"},{"key":"9526_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, S.O., Simmons, R., Goldberg, D.: Maintaining line of sight communications network between planetary rovers. In: Proceedings of the 2003 IEEE\/RSJ International Conference of Intelligent Robots and Systems, pp. 2266\u20132272. IEEE (2003)","DOI":"10.1109\/IROS.2003.1249208"},{"key":"9526_CR3","unstructured":"Anisi, D.A., \u00d6gren, P., Hu, X.: Communication constrained multi-UGV surveillance. In: Proceedings of the 17th IFAC World Congress, Seoul, South Korea, 6\u201311 July 2008"},{"key":"9526_CR4","doi-asserted-by":"crossref","unstructured":"Arkin, R.C., Diaz, J.: Line-of-sight constrained exploration for reactive multiagent robotic teams. In: 7th International Workshop on Advanced Motion Control, pp. 455\u2013461 (2002)","DOI":"10.1109\/AMC.2002.1026963"},{"issue":"2","key":"9526_CR5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A. Balakrishnan","year":"1992","unstructured":"Balakrishnan A., Altinkemer K.: Using a hop-constrained model to generate alternative communication network design. ORSA J. Comput. 4(2), 192\u2013205 (1992)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9526_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman R.: On a routing problem. Q. Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"issue":"1","key":"9526_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10707-006-0017-5","volume":"12","author":"B. Ben-Moshe","year":"2008","unstructured":"Ben-Moshe B., Carmi P., Katz M.J.: Approximating the visible region of a point on a terrain. GeoInformatica 12(1), 21\u201336 (2008)","journal-title":"GeoInformatica"},{"key":"9526_CR8","volume-title":"Dynamic Programming and Optimal Control","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas D.P.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA (1995)"},{"key":"9526_CR9","volume-title":"Network Optimization: Continuous and Discrete Models","author":"D.P. Bertsekas","year":"1998","unstructured":"Bertsekas D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont, MA (1998)"},{"key":"9526_CR10","unstructured":"Burdakov, O., Holmberg, K., Olsson, P.-M.: A dual ascent method for the hop-constrained shortest path problem with application to positioning of unmanned aerial vehicles. Technical Report LiTH-MAT-R-2008-07, Department of Mathematics, Link\u00f6ping University (2008)"},{"key":"9526_CR11","doi-asserted-by":"crossref","unstructured":"Burdakov, O., Doherty, P., Holmberg, K., Kvarnstr\u00f6m, J., Olsson, P.-M.: Positioning unmanned aerial vehicles as communication relays for surveillance tasks. In: Proceedings of Robotics: Science and Systems, Seattle, USA (2009)","DOI":"10.15607\/RSS.2009.V.033"},{"issue":"2","key":"9526_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky B.V., Goldberg A.V., Radzik T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"9526_CR13","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H. Choset","year":"2005","unstructured":"Choset H., Lynch K.M., Hutchinson S., Kantor G., Burgard W., Kavraki L.E., Thrun S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge, MA (2005)"},{"key":"9526_CR14","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, 2nd edn. MIT Press\/McGraw-Hill, Cambridge\/New York (2001)","edition":"2"},{"issue":"5","key":"9526_CR15","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1068\/b12979","volume":"30","author":"L. De Floriani","year":"2003","unstructured":"De Floriani L., Magillo P.: Algorithms for visibility computation on terrains: a survey. Environ. Plann. B Plann. Des. 30(5), 709\u2013728 (2003)","journal-title":"Environ. Plann. B Plann. Des."},{"key":"9526_CR16","doi-asserted-by":"crossref","unstructured":"Doherty, P.: Advanced research with autonomous unmanned aerial vehicles. In: Proceedings on the 9th International Conference on Principles of Knowledge Representation and Reasoning (2004)","DOI":"10.1109\/IAT.2005.93"},{"key":"9526_CR17","doi-asserted-by":"crossref","unstructured":"Doherty, P., Rudol, P.: A UAV search and rescue scenario with human body detection and geolocalization. In: 20th Australian Joint Conference on Artificial Intelligence (AI07) (2007)","DOI":"10.1007\/978-3-540-76928-6_1"},{"issue":"3","key":"9526_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu I., Boland N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3), 135\u2013153 (2003)","journal-title":"Networks"},{"key":"9526_CR19","doi-asserted-by":"crossref","unstructured":"Dynia, M., Kutylowski, J., auf der Heide, F.M., Schrieb, J.: Local strategies for maintaining a chain of relay stations between an explorer and a base station. In: SPAA \u201907: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 260\u2013269. ACM Press, New York, USA, 1 Jan 2007","DOI":"10.1145\/1248377.1248420"},{"key":"9526_CR20","volume-title":"Flows in Networks","author":"L.R. Ford Jr","year":"1962","unstructured":"Ford L.R. Jr, Fulkerson D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)"},{"key":"9526_CR21","doi-asserted-by":"crossref","unstructured":"Fridman, A., Modi, J., Weber, S., Kam, M.: Communication-based motion planning. In: Proceedings of 41st Annual Conference on Information Sciences and Systems, pp. 382\u2013387. IEEE (2007)","DOI":"10.1109\/CISS.2007.4298333"},{"key":"9526_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge, MA (2007)"},{"issue":"5","key":"9526_CR23","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/TNET.2002.803917","volume":"10","author":"R. Gu\u00e9rin","year":"2002","unstructured":"Gu\u00e9rin R., Orda A.: Computing shortest paths for any number of hops. IEEE\/ACM Trans. Netw. 10(5), 613\u2013620 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9526_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"LaValle S.M.: Planning Algorithms. Cambridge University Press, Cambridge, MA (2006)"},{"key":"9526_CR25","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"issue":"3","key":"9526_CR26","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/0215057","volume":"15","author":"F.T. Leighton","year":"1986","unstructured":"Leighton F.T., Rosenberg A.L.: Three-dimensional circuit layouts. SIAM J. Comput. 15(3), 793\u2013813 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9526_CR27","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/TAES.2003.1238737","volume":"39","author":"A. Moitra","year":"2003","unstructured":"Moitra A., Mattheyses R.M., DiDomizio V.A., Hoebel L.J., Szczerba R.J., Yamrom B.: Multivehicle reconnaissance route and sensor planning. IEEE Trans. Aerosp. Electron. Syst. 39(3), 799\u2013812 (2003)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"issue":"6","key":"9526_CR28","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/0097-8493(94)90002-7","volume":"18","author":"G. Nagy","year":"1994","unstructured":"Nagy G.: Terrain visibility. Comput. Graph. 18(6), 763\u2013773 (1994)","journal-title":"Comput. Graph."},{"key":"9526_CR29","unstructured":"Obermeyer, K.J.: The VisiLibity library. http:\/\/www.VisiLibity.org (2008)"},{"key":"9526_CR30","unstructured":"Pereira, G.A.S., Das, A.K., Kumar, V., Campos, M.F.M.: Decentralized motion planning for multiple robots subject to sensing and communication constraints. In: Proceedings of the Second Multi-Robot Systems Workshop, pp. 267\u2013278. Kluwer Academic Press (2003)"},{"key":"9526_CR31","doi-asserted-by":"crossref","unstructured":"Pezeshkian, N., Nguyen, H.G., Burmeister, A.: Unmanned ground vehicle radio relay deployment system for non-line-of-sight operations. In: Proceedings of IASTED International Conference on Robotics and Applications. ACTA Press (2007)","DOI":"10.21236\/ADA475525"},{"key":"9526_CR32","doi-asserted-by":"crossref","unstructured":"Pinkney, M.F.J., Hampel, D., DiPierro, S.: Unmanned aerial vehicle (uav) communications relay. In: Military Communications Conference MILCOM\u201996, vol. 1, pp. 45\u201351. IEEE (1996)","DOI":"10.1109\/MILCOM.1996.568581"},{"issue":"1","key":"9526_CR33","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0377-2217(02)00366-1","volume":"148","author":"H. Pirkul","year":"2003","unstructured":"Pirkul H., Soni S.: New formulations and solution procedures for the hop constrained network design problem. Eur. J. Oper. Res. 148(1), 126\u2013140 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"3\u20134","key":"9526_CR34","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/rob.20119","volume":"23","author":"T. Schouwenaars","year":"2006","unstructured":"Schouwenaars T., Stubbs A., Paduano J., Feron E.: Multivehicle path planning for nonline-of-sight communication. J. Field Rob. 23(3\u20134), 269\u2013290 (2006)","journal-title":"J. Field Rob."},{"issue":"3","key":"9526_CR35","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1109\/TIE.2007.894726","volume":"54","author":"K. Sridharan","year":"2007","unstructured":"Sridharan K., Priya T.K.: A hardware accelerator and fpga realization for reduced visibility graph construction using efficient bit representations. IEEE Trans. Ind. Electron. 54(3), 1800\u20131804 (2007)","journal-title":"IEEE Trans. Ind. Electron."},{"issue":"1","key":"9526_CR36","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/2945.675656","volume":"4","author":"A.J. Stewart","year":"1998","unstructured":"Stewart A.J.: Fast horizon computation at all points of a terrain with visibility and shading applications. IEEE Trans. Vis. Comput. Graph. 4(1), 82\u201393 (1998)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"9526_CR37","doi-asserted-by":"crossref","unstructured":"Szczerba, R.J., Chen, D.Z., Klenk, K.S.: Minimum turns\/shortest path problems: a framed-subspace approach. In: Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics, vol. 1, pp. 398\u2013403. IEEE (1997)","DOI":"10.1109\/ICSMC.1997.625782"},{"key":"9526_CR38","unstructured":"Szeszler, D.: Combinatorial algorithms in VLSI routing. PhD thesis, Budapest University of Technology and Economics (2005)"},{"key":"9526_CR39","unstructured":"Tandy, C.R.V.: The isovist method of landscape survey. In: Murray, H.C. (ed.) Symposium on Methods of Landscape Analysis, pp. 9\u201310. Landscape Research Group, London (1967)"},{"key":"9526_CR40","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1068\/b2684","volume":"28","author":"A. Turner","year":"2001","unstructured":"Turner A., Doxa M., O\u2019Sullivan D., Penn A.: From isovists to visibility graphs: a methodology for the analysis of architectural space. Environ. Plann. B Plann. Des. 28, 103\u2013121 (2001)","journal-title":"Environ. Plann. B Plann. Des."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9526-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9526-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9526-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T11:03:00Z","timestamp":1739876580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9526-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,13]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9526"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9526-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2010,2,13]]}}}