Optimal placement of UV-based communications relay nodes

Journal of Global Optimization

Volumn 48, Issue 4, 2010, Pages 511-531

  Burdakov, Oleg ^a   Doherty, Patrick ^a   Holmberg, Kaj ^a   Olsson, Per Magnus ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Global optimization; Hop restricted shortest paths; Label correcting algorithms; Pareto solution; Unmanned vehicles

Indexed keywords

BELLMAN-FORD ALGORITHMS; COMMUNICATIONS RELAY; CONSTRAINED OPTIMIZATION PROBLEMS; DECISION VARIABLES; EXTREMAL PROBLEMS; FEASIBLE SET; FIXED NUMBERS; FREE LINES; GLOBAL MINIMA; LABEL CORRECTING; LABEL CORRECTING ALGORITHMS; LIMITED COMMUNICATION RANGE; MIXED INTEGER; NUMBER OF HOPS; OBJECTIVE FUNCTIONS; OPTIMAL PLACEMENTS; PARETO SOLUTION; RESTRICTED SHORTEST PATH; SHORTEST PATH PROBLEM; SPATIAL DISCRETIZATIONS; SUBSEQUENT REDUCTION;

ALGORITHMS; COMMUNICATION; CONSTRAINED OPTIMIZATION; GLOBAL OPTIMIZATION; GRAPH THEORY; GROUND VEHICLES; INTEGER PROGRAMMING; PARETO PRINCIPLE; REAL VARIABLES; UNMANNED VEHICLES; WIRELESS SENSOR NETWORKS;

PROBLEM SOLVING;

EID: 78149280416     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9526-8     Document Type: Article

References (40)

1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ (1993)
2. 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-2272. IEEE (2003)
3. Anisi, D.A., Ögren, P., Hu, X.: Communication constrained multi-UGV surveillance. In: Proceedings of the 17th IFAC World Congress, Seoul, South Korea, 6-11 July 2008
4. 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-461 (2002)
5. A. Balakrishnan K. Altinkemer 1992 Using a hop-constrained model to generate alternative communication network design ORSA J. Comput. 4 2 192 205
6. R. Bellman 1958 On a routing problem Q. Appl. Math. 16 1 87 90
7. B. Ben-Moshe P. Carmi M.J. Katz 2008 Approximating the visible region of a point on a terrain GeoInformatica 12 1 21 36 10.1007/s10707-006-0017-5
8. Bertsekas D.P.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA (1995)
9. Bertsekas D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont, MA (1998)
10. 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öping University (2008)
11. Burdakov, O., Doherty, P., Holmberg, K., Kvarnström, J., Olsson, P.-M.: Positioning unmanned aerial vehicles as communication relays for surveillance tasks. In: Proceedings of Robotics: Science and Systems, Seattle, USA (2009)
12. B.V. Cherkassky A.V. Goldberg T. Radzik 1996 Shortest paths algorithms: theory and experimental evaluation Math. Program. 73 2 129 174 10.1007/BF02592101
13. 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)
14. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw-Hill, Cambridge/New York (2001)
15. L. De Floriani P. Magillo 2003 Algorithms for visibility computation on terrains: a survey Environ. Plann. B Plann. Des. 30 5 709 728 10.1068/b12979
16. Doherty, P.: Advanced research with autonomous unmanned aerial vehicles. In: Proceedings on the 9th International Conference on Principles of Knowledge Representation and Reasoning (2004)
17. 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)
18. I. Dumitrescu N. Boland 2003 Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem Networks 42 3 135 153 10.1002/net.10090
19. 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 '07: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 260-269. ACM Press, New York, USA, 1 Jan 2007
20. Ford L.R. Jr, Fulkerson D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)
21. 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-387. IEEE (2007)
22. Ghosh S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge, MA (2007)
23. R. Guérin A. Orda 2002 Computing shortest paths for any number of hops IEEE/ACM Trans. Netw. 10 5 613 620 10.1109/TNET.2002.803917
24. LaValle S.M.: Planning Algorithms. Cambridge University Press, Cambridge, MA (2006)
25. Lawler E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)
26. F.T. Leighton A.L. Rosenberg 1986 Three-dimensional circuit layouts SIAM J. Comput. 15 3 793 813 10.1137/0215057
27. A. Moitra R.M. Mattheyses V.A. DiDomizio L.J. Hoebel R.J. Szczerba B. Yamrom 2003 Multivehicle reconnaissance route and sensor planning IEEE Trans. Aerosp. Electron. Syst. 39 3 799 812 10.1109/TAES.2003.1238737
28. G. Nagy 1994 Terrain visibility Comput. Graph. 18 6 763 773 10.1016/0097-8493(94)90002-7
29. Obermeyer, K.J.: The VisiLibity library. http://www.VisiLibity.org (2008)
30. 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-278. Kluwer Academic Press (2003)
31. 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)
32. Pinkney, M.F.J., Hampel, D., DiPierro, S.: Unmanned aerial vehicle (uav) communications relay. In: Military Communications Conference MILCOM'96, vol. 1, pp. 45-51. IEEE (1996)
33. H. Pirkul S. Soni 2003 New formulations and solution procedures for the hop constrained network design problem Eur. J. Oper. Res. 148 1 126 140 10.1016/S0377-2217(02)00366-1
34. T. Schouwenaars A. Stubbs J. Paduano E. Feron 2006 Multivehicle path planning for nonline-of-sight communication J. Field Rob. 23 3-4 269 290 10.1002/rob.20119
35. K. Sridharan T.K. Priya 2007 A hardware accelerator and fpga realization for reduced visibility graph construction using efficient bit representations IEEE Trans. Ind. Electron. 54 3 1800 1804 10.1109/TIE.2007.894726
36. A.J. Stewart 1998 Fast horizon computation at all points of a terrain with visibility and shading applications IEEE Trans. Vis. Comput. Graph. 4 1 82 93 10.1109/2945.675656
37. 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-403. IEEE (1997)
38. Szeszler, D.: Combinatorial algorithms in VLSI routing. PhD thesis, Budapest University of Technology and Economics (2005)
39. Tandy, C.R.V.: The isovist method of landscape survey. In: Murray, H.C. (ed.) Symposium on Methods of Landscape Analysis, pp. 9-10. Landscape Research Group, London (1967)
40. A. Turner M. Doxa D. O'Sullivan A. Penn 2001 From isovists to visibility graphs: a methodology for the analysis of architectural space Environ. Plann. B Plann. Des. 28 103 121 10.1068/b2684