Multi-Robot Fish Path Planning Based on the Modified A* Algorithm

Article Preview

Abstract:

Based on improved A* algorithm, this paper proposes the optimal path planning of robot fish in globally known environment, so as to achieve better coordination between the robot fish by means of improving their path planning. In the known obstacle environment which is rasterized, target nodes are generated via smoothing A* algorithm. The unnecessary connection points are removed then and the path is smoothed at the turning points. That improved algorithm, in combination with distributed scroll algorithms, is applied to multi-robot path planning in an effort to optimize the path with the avoidance of collision. The experimental results on the 2D simulation platform have verified the feasibility of that method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1054-1058

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lei Li. Current Situation and Future of Mobile Robotics Research[J]. robot, 2002, 24: 475-480.

Google Scholar

[2] N.A. Mardi, Liuping Wang. Subspace-based model predictive control of time-varing system[c]/Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference. Shanghai: [s. n. ], 2009: 4005-4010.

DOI: 10.1109/cdc.2009.5400285

Google Scholar

[3] Xinyan Gu, Shijun Jin. Mobile Robot Path Planning Based on A*algorithm[J]. Science & Technology Information, 2007, 34: 36-38.

Google Scholar

[4] Yunan Zhang, Yongbao Yan. 6x6 Wheeled vehicle optimal path planning based on smoothing A* algorithm[J]. (2012).

Google Scholar

[5] Hongwei Wang, Yong Ma . Smoothing A * algorithm based on mobile robot path planning[J]. Tongji University, 2010, 38(11): 253-374.

Google Scholar

[6] Daokui Qu . The reserch on path planning of mobile robot[J]. Robot, 2008, 30(2): 97-106.

Google Scholar

[7] Dijkstra E W.A note on two problems in connection with graphsFJ]. Numerische Mathematik 1959, 1(1): 269.

Google Scholar

[8] Latombe J C.Robot motion planning IM].Kluwer Academic Publishing·Norwell·M[A,(1991).

Google Scholar

[9] Trovato K I, Dorst L. Differential A*[J]. IEEE Transactions on Knowledge and Data Engineering, 2002, 14(6): 1218.

Google Scholar