Connectivity and bandwidth-aware real-time exploration in mobile robot networks

Wireless Communications and Mobile Computing

Volumn 13, Issue 9, 2013, Pages 847-863

  Pei, Yuanteng ^a   Mutka, Matt W ^a   Xi, Ning ^a  

^a Michigan State University   (United States)

Author keywords

bandwidth; bottleneck assignment; mobile robot networks; real time exploration; relay node placement; Steiner minimum tree

Indexed keywords

BANDWIDTH CONSTRAINT; BANDWIDTH-CONSTRAINED; BOTTLENECK ASSIGNMENTS; COMMUNICATION QUALITY; MOBILE ROBOT NETWORKS; MULTI-ROBOT EXPLORATION; RELAY NODE PLACEMENT; STEINER MINIMUM TREES;

BANDWIDTH; COMMUNICATION; FORESTRY; MOBILE ROBOTS;

TELECOMMUNICATION SYSTEMS;

FORESTRY; MOBILE EQUIPMENT; ROBOTS; TELECOMMUNICATIONS;

EID: 84878683050     PISSN: 15308669     EISSN: 15308677     Source Type: Journal    
DOI: 10.1002/wcm.1145     Document Type: Article

References (28)

1. Franchi A, Freda L, Oriolo G, Vendittelli M,. The sensor-based random graph method for cooperative robot exploration. IEEE/ASME Transactions on Mechatronics 2009; 14 (2): 163-175.
2. Sheng W, Yang Q, Tan J, Xi N,. Distributed multi-robot coordination in area exploration. Robotics and Autonomous Systems 2006; 54 (12): 945-955.
3. Rooker MN, Birk A,. Multi-robot exploration under the constraints of wireless networking. Control Engineering Practice 2007; 15 (4): 435-445.
4. Sugiyama H, Tsujioka T, Murata M,. Coordination of rescue robots for real-time exploration over disaster areas. In Proceedings of the 11th IEEE International Symposium on Object Oriented Real-time Distributed Computing (ISORC '08), Orlando, FL, USA, 05-07 May 2008. IEEE Computer Society: Washington, DC, 2008; 170-177.
5. Cen Z, Mutka M, Liu Y, Goradia A, Xi N,. QoS management of supermedia enhanced teleoperation via overlay networks. In Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '05), Edmonton, Alberta, 2-6 Aug 2005. IEEE Computer Society: Washington, DC, 2005; 1630-1635.
6. Cheng X, Du D, Wang L, Xu B,. Relay sensor placement in wireless sensor networks. Wireless Networks 2008; 14 (3): 347-355.
7. Du D, Hu X,. Steiner tree problem for minimal steiner points, chapter 5. Steiner Tree Problems in Computer Communication Networks. World Scientific Publishing Co.: Singapore, 2008; 177-193.
8. Zavlanos M, Pappas G,. Distributed connectivity control of mobile networks. IEEE Transactions on Robotics 2008; 24 (6).
9. Michael N, Zavlanos MM, Kumar V, Pappas GJ,. Maintaining connectivity in mobile robot networks. In International Symposium on Experimental Robotics (ISER '08), Athens, Greece, 13-16 July 2008. Springer-Verlag: Berlin, Heidelberg, 2008; 117-126.
10. Birk A, Schwertfeger S, Pathak K,. A networking framework for teleoperation in safety, security, and rescue robotics. IEEE Wireless Communications, Special Issue on Wireless Communications in Networked Robotics 2009; 16 (1): 6-13.
11. Zeiger F, Kraemer N, Schilling K,. Commanding mobile robots via wireless ad-hoc networks-a comparison of four ad-hoc routing protocol implementations. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA '08), Pasadena, CA, 19-23 May 2008. IEEE Computer Society: Washington, DC, 2008; 590-595.
12. Wurm K, Stachniss C, Burgard W,. Coordinated multi-robot exploration using a segmentation of the environment. In Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '08), Nice, France, 22-26 September 2008. IEEE Computer Society: Washington, DC, 2008; 1160-1165.
13. Rocha R, Ferreira F, Dias J,. Multi-robot complete exploration using hill climbing and topological recovery. In Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '08), Nice, France, 22-26 September 2008. IEEE Computer Society: Washington, DC, 2008; 1884-1889.
14. Vazquez J, Malcolm C,. Distributed multirobot exploration maintaining a mobile network. In Proceedings of the Second International IEEE Conference on Intelligent Systems, Varna, Bulgaria, 22-24 June 2004, Vol. 3. IEEE Computer Society: Washington, DC, 2004; 113-118.
15. Amigoni F,. Experimental evaluation of some exploration strategies for mobile robots. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA '08), Pasadena, CA, 19-23 May 2008. IEEE Computer Society: Washington, DC, 2008; 2818-2823.
16. Mosteo A, Montano L, Lagoudakis M,. Multi-robot routing under limited communication range. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA '08), Pasadena, CA, 19-23 May 2008. IEEE Computer Society: Washington, DC, 2008; 1531-1536.
17. Bekris KE, Tsianos KI, Kavraki LE,. A distributed protocol for safe real-time planning of communicating vehicles with second-order dynamics. In Proceedings of the First International Conference on Robot Communication and Coordination (RoboComm '07), Odense, Denmark, 31 March-2 April 2009. IEEE Press: Piscataway, NJ, 2007; 15-17.
18. Guo W, Huang X,. Mobility model and relay management for disaster area wireless networks. In Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications (WASA '08), Dallas, TX, USA, 26-28 October 2008. Springer-Verlag: Berlin, Heidelberg, 2008; 274-285.
19. Gonzáles-Baños HH, Latombe J-C,. Navigation strategies for exploring indoor environments. International Journal of Robotics Research 2002; 21 (10-11): 829-848.
20. Cormen TH, Leiserson CE, Rivest RL, Stein C,. Approximation algorithms chapter 35. Introduction to Algorithms, 2nd Edition. The MIT Press: Cambridge, MA, 2001; 1056-1061.
21. Russell S, Norvig P,. Informed search methods, chapter 4. Artificial Intelligence: a Modern Approach, 2nd Edition. Prentice-Hall: Upper Saddle River, NJ, 2003; 97-101.
22. Burkard R, Dell'Amico M, Martello S,. Other types of linear assignment problems, chapter 6. Assignment Problems. SIAM: Philadelphia, PA, 2009; 172-191.
23. Krokhmal P, Pardalos PM,. Random assignment problems. European Journal of Operational Research 2009; 194 (1): 1-17.
24. Pferschy U,. The random linear bottleneck assignment problem. RAIRO-Operations Research 1996; 30 (2): 145-156.
25. Gabow H, Tarjan R,. Algorithms for two bottleneck assignment problems. Journal of Algorithms 1988; 9 (3): 411-417.
26. Burkard R, Cela E,. Linear assignment problems and extensions. In Handbook of Combinatorial Optimization, Vol. A (Suppl.) Kluwer Academic Publishers: Dordrecht, 1999; 75-149.
27. Franchi A, Freda L, Oriolo G, Vendittelli M,. SRG-based video clips from a cluster start with 4 robots. http://www.dis.uniroma1.it~labrob/research/ multiSRG.html.2007. [Accessed on June 2009 ].
28. Jardosh A, Belding-Royer EM, Almeroth KC, Suri S,. Towards realistic mobility models for mobile ad hoc networks. In Proceedings of the Ninth ACM International conference on Mobile Computing and networking (MobiCom '03), San Diego, CA, 14-19 September 2003. ACM: New York, NY, 2003; 217-229.