Multi-robot path finding with wireless multihop communications

IEEE Communications Magazine

Volumn 48, Issue 7, 2010, Pages 126-132

  Jung, Jin ^a   Park, Sujin ^b   Kim, Seong Lyun ^c  

^a SAMSUNG Electronics   (South Korea)

^b SK Broadband Inc   (United States)

^c Yonsei University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COLLEAGUE ROBOT; INFORMATION EXCHANGES; MATLAB SIMULATIONS; MICROROBOTS; MULTI HOP COMMUNICATION; MULTIPLE ROBOT; MULTIROBOTS; PATH FINDING; PATH-FINDING ALGORITHMS; WIRELESS COMMUNICATIONS; WIRELESS MULTIHOP COMMUNICATIONS; ZIG-BEE;

DISTRIBUTED COMPUTER SYSTEMS; INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMMUNICATION;

EID: 77954298753     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2010.5496889     Document Type: Article

References (15)

1. G. Bekey and J. Yuh, "The Status of Robotics," IEEE Robotics and Automation Mag., vol.15, no.1, 2008, pp. 80-86.
2. T. Akimoto and N. Hagita, "Introduction to a Network Robot System," Proc. Int'l. Symp. Intelligent Sig. Processing and Commun., Tottori, Japan, 2006.
3. S.-L. Kim, W. Burgard and D. Kim, "Wireless Communications in Networked Robotics," IEEE Wireless Commun., vol.16, no.1, 2009, pp. 4-5.
4. J. McLurkin and J. Smith "Distributed Algorithms for Dispersion in Indoor Environments using a Swarm of Autonomous Mobile Robots," Proc. Int'l. Symp. Distrib. Autonomous Robotic Sys., Toulouse, France, 2004.
5. Cibermouse, http://www.ieeta.pt/lse/ciberRTSS08/
6. A. Stentz, "Optimal and Efficient Path Planning for Unknown and Dynamic Environments," tech. rep. CMURI- TR-93-120, The Robotics Inst., Carnegie Mellon Univ., 1993.
7. V. S. Gordon and Z. Matley, "Evolving Sparse Direction Maps for Maze Pathfinding," Proc. Congress on Evolutionary Computation, Portland, OR, 2004.
8. L. Podsedkowski et al., "A New Solution Method for Path Planning in Partially Known or Unknown Environment for Nonholonomic Mobile Robots," Robotics and Autonomous Sys., vol.34, no.2-3, 2001, pp. 145-152
9. M. Szymanski et al., "Distributed Shortest-Path Finding by a Micro-Robot Swarm," Springer Ant Colony Optimization and Swarm Intelligence, LNCS 4150, 2006, pp. 404-411
10. D. M. Kim, Y. J. Hwang and S.-L. Kim, "Random Basketball Routing for ZigBee Based Sensor Networks," Proc. IEEE VTS Asia Pacific Wireless Commun. Symp., Hsinchu, Taiwan, 2007; extended (revised) version submitted for publication, 2009.
11. Y. J. Hwang and S.-L. Kim, "The Capacity of Random Wireless Networks," IEEE Trans. Wireless Commun., vol.7, no.12, 2008, pp. 4968-4975
12. X. Qiu et al., "A Complete Coverage Path Planning Method for Mobile Robot in Uncertain Environments," Proc. World Cong. on Intelligent Control and Automation, Dalian, China, 2006.
13. L. Wyard-Scott and Q. -H. M. Meng, "A Potential Maze Solving Algorithm for a Micromouse Robot," Proc. IEEE Pacific Rim Conf. Commun., Comp., and Sig. Proc., Victoria, BC, Canada, 1995.
14. B. Arthaya, A. Sadiyoko and A. Hadiwidjaja, "The Design of a Maze Solving System for a Micromouse by Using A Potential Value Algorithm," World Trans. Eng. and Tech. Education, vol.5, no.3, 2006, pp. 509-512
15. R. C. Shah et al., "When Does Opportunistic Routing Make Sense?" Proc. IEEE Int'l. Conf. Pervasive Comp. and Commun. Wksps., Kauai Island, HI, 2005.