Enhance A* Searching Algorithm Applying in Multiple Robot System

Article Preview

Abstract:

The article programs the shortest motion paths of the multiple mobile robots to be applied in the Chinese chess game, and presents the movement scenario of the chess using mobile robots on the grid based chessboard platform. Users play the chess game using the mouse to obey the evaluation algorithm on the user interface. The user interface programs the motion paths that are the shortest displacement using enhance A* searching algorithm and solves the collision problem of the programmed motion paths for the assigned chesses to and reprogram the new motion paths using enhance A* searching algorithm, too. The supervised computer controls mobile robots according to the programmed motion paths of the assigned chess moving on the platform via wireless RF interface. In the experimental results, we use simulation method to search the motion paths of the assigned chesses on the user interface, and implement the simulation results on the chessboard platform using mobile robots. Mobile robots move on the platform according to the programmed motion paths from the start points to the target points and avoid the collision points.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

773-777

Citation:

Online since:

December 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S.J. Yen, J.C. Chen, T.N. Yang and S.C. Hsu, Computer Chinese Chess, ICGA Journal, Vol. 27, No. 1(2004), pp.3-18.

Google Scholar

[2] P. Darwen and X. Yao, Coevolution in Iterated Prisoner's Dilemma with Intermediate Levels of Cooperation: Application to Missile Defense, International Journal of Computational Intelligence Applications, Vol. 2, No. 1(2002), pp.83-107.

DOI: 10.1142/s1469026802000440

Google Scholar

[3] W. Zhou, J.C. Liu and Y.H. Zhao, The construction of Chinese chess computer game platform, The 6th International Conference on Computer Science & Eduation(2012), SuperStar Virgo, Singapore, pp.126-128.

DOI: 10.1109/iccse.2011.6028599

Google Scholar

[4] J. Wang, Y.H. Luo, D.N. Qiu and X.H. Xu, Adaptive Genetic Algorithm's Implement on Evaluation Function in Computer Chinese Chess, Proceeding of ISCIT(2005), pp.1206-1209.

DOI: 10.1109/iscit.2005.1567095

Google Scholar

[5] K.L. Su, S.V. Shiau, J.H. Guo and C.W. Shiau, Mobile Robot Based Onlin Chinese Chess Game, The Fourth International Conference on Innovative Computing, Information and Control(2009), p.63.

DOI: 10.1109/icicic.2009.261

Google Scholar

[6] Z. Kong, L.Q. Gao, L.F. Wang and Y.F. Ge, Onan adaptive harmony search algorithm, International journal of Innovative Computing, Information and Control, Vol. 5, No. 9(2009), pp.2551-2560.

Google Scholar

[7] T. Fu and H. Yin, Designing a hybrid position evaluation function for Chinese-chess computer game, International Conference on Software Engineering and Service Science(2012), Beijing, China, pp.75-78.

DOI: 10.1109/icsess.2012.6269409

Google Scholar

[8] K.L. Su, C.Y. Chung, Y.L. Liao and J.H. Guo, A* Searching Algorithm Based Path Planning of Mobile Robots, The Innovative Computing, Information and Control – Express Letters, Part B: Applications (ICIC-ELB), Vol. 2, No. 1(2011), pp.273-278.

Google Scholar