i-manager Publications

CPA Based Multi-Robot Path Finding Algorithm for Wireless Multihop Network

S. Mohammad Malik Mubeen*

ME- Embedded System Technologies, PSN College of Engineering and Technology, Tirunelveli, Tamil Nadu.

Periodicity:April - June'2011
DOI : https://doi.org/10.26634/jse.5.4.1447

Abstract

The main theme of this project is to apply wireless multi-hop communications to the collaborative path-finding algorithm. Here multiple robots are used in path finding. When the robot is able to communicate with other colleague robots, path finding will be solved collaboratively among the robots. The goal of the communication is to spread the map information as quickly as possible. Every robot shares its map information and the network map information to all other robots simultaneously by broadcasting the information thus reducing the time to find the efficient path from source to destination. For this purpose, cooperative path finding algorithm (CPA) is proposed for a collaborative robot system. This is useful in many applications such as area monitoring where path finding is very important. This project is planned to implement with the help of NS-2.

Keywords

Multi-robots, path finding, CPA.

How to Cite this Article?

S. Mohammad Malik Mubeen (2011). CPA Based Multi-Robot Path Finding Algorithm For Wireless Multihop Network. i-manager’s Journal on Software Engineering, 5(4), 35-40. https://doi.org/10.26634/jse.5.4.1447

References

[1]. S.-L. Kim, W. Burgard and D. Kim, (2009). “Wireless Communications in Networked Robotics”, IEEE Wireless Communication, vol. 16, no. 1, pp. 4–5.

[2]. G. Bekey and J. Yuh, (2008). “The Status of Robotics”, IEEE Robotics and Automation Mag., vol. 15, no. 1, 2008, pp. 80–86.

[3]. T. Akimoto and N. Hagita, (2006). “Introduction to a Network Robot System,” Proc. Int'l. Symp. Intelligent Sig. Processing and Communication, Tottori, Japan.

[4]. A. Stentz, (1993). “Optimal and Efficient Path Planning for Unknown and Dynamic Environments,” tech. rep. CMURI-TR-93-20, The Robotics Inst., Carnegie Mellon Univ.,1993.

[5]. L. Podsedkowski et al., (2001). “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, pp. 145–52.

[6]. Y. J. Hwang and S.-L. Kim, (2008). “The Capacity of Random Wireless Networks,” IEEE Trans. Wireless Communication, Vol.7, No. 12, pp. 4968–75.

[7]. X. Qiu et al., (2006). “A Complete Coverage Path Planning Method for Mobile Robot in Uncertain Environments,” Proc. World Cong. on Intelligent Control and Automation, Dalian, China.

[8]. V. S. Gordon and Z. Matley, (2004). “Evolving Sparse Direction Maps for Maze Pathfinding,” Proc. Congress on Evolutionary Computation, Portland, OR, 2004.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.