Formation Vector Based Shortest Path-Planning in CGF Formation

Fei Jie; Zhao Han Lu; Bao Di  Xie

doi:10.4028/www.scientific.net/AMR.756-759.3351

Paper Titles

A Principal Components Analysis Self-Organizing Neural Network Model and Computational Experiment
p.3330

A Novel Approach to Improve the Frequency Resolution Based on Sparse Representation
p.3336

High Quality Algorithm for Chinese Short Messages Text Clustering Based on Semantic
p.3341

An Improved Differential Evolution Optimization Based on P System
p.3346

Formation Vector Based Shortest Path-Planning in CGF Formation
p.3351

Convolutive Blind Source Separation Based on Wavelet De-Noising
p.3356

A Direct Filling Algorithm of Isogram in Complex Boundary
p.3362

An Air Quality Predictive Model of Licang of Qingdao City Based on BP Neural Network
p.3366

Mix-Subdivision Dynamic Terrain Visualization Algorithm
p.3372

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759Formation Vector Based Shortest Path-Planning in...

Formation Vector Based Shortest Path-Planning in CGF Formation

Abstract:

In order to improve the poor reality and bad flexibility of the mapping relationship which matched entities with aim locations in traditional approximation method, the formation vector shortest path-planning method was presented in this paper. By analyzing the lack of aim path-planning in the approximation method, shortest path-planning was discussed and was improved by introducing the formation vector and the idea of pheromone. Furthermore, the improved algorithm was applied in a CGF simulation system. The experimental results showed that the mapping relationship had better reality and rationality and the possibility of collision was significantly reduced than the traditional formation change process.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

3351-3355

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.3351

Citation:

Cite this paper

Online since:

September 2013

Authors:

Fei Jie, Zhao Han Lu, Bao Di Xie

Keywords:

Aim Path-Planning, Approximation Method, Computer Generated Forces, Formation Change

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] P. Tabuada, G. J. Pappas, and P. Lima, Motion Feasibility of Multi-Agent Formations, IEEE Transactions On Robotics, vol. 21, March. 2005, pp.387-391.

DOI: 10.1109/tro.2004.839224

Google Scholar

[2] L. G. Yang, G. Ji, Q. S. Guo and X. C. Wang, The Simulation of Group Change in the Aggregated Computer Generated Forces, Computer Engineering and Applications, 23: 17-34, (2001).

Google Scholar

[3] T. Balch, R. C. Arkin, Behavior-based formation control for multirobot teams, IEEE Transactions on Robotics & Automation, vol. 12, Jun. 1998, pp.926-939.

DOI: 10.1109/70.736776

Google Scholar

[4] X. L. Kong, Q, Xue, and J. H. Song, Research and Realization on Formation's Change of Tank CGF Unit, 4th Chinese Conference of Virtual Reality and Visualization, Aug. 2004, pp.61-65.

Google Scholar

[5] R. W. Floyd, Algorithm 97: Shortest Path, Communications of the ACM 18, (1968).

Google Scholar

[6] Y. Zhang, Research on the virtual scheduling optimization methods of large scale theatrical performances, unpublished.

Google Scholar

[7] H. B. Duan, D. B. Wang, J. Q. Zhu, and X. H. Huang, Development on Ant Colony Algorithm Theory and Its Application, Control and Decision, vol. 19, Dec. 2004, pp.1321-1326.

Google Scholar