A Fast Collision Detection Algorithm Based on Multi-Agent Particle Swarm Optimization

Author

Fu Yue-Wen ; Liang Jia-Hong ; Hu Xiao-Qian ; Yang Shan-Liang

Author_Institution

Coll. of Inf. Syst. & Manage., Nat. Univ. of Defense Technol., Changsha, China

fYear

2013

fDate

14-15 Sept. 2013

Firstpage

269

Lastpage

272

Abstract

In this paper, a fast collision detection algorithm based on multi-agent particle swarm optimization (MPSO) is proposed. We use the stochastic method to convert the collision detection problem into a nonlinear optimization problem in the distance mechanism. Combined with the evolution strategy of particle swarm optimization and the multi-agent system technology, a multi-agent particle swarm optimization based on the hierarchical topology structure is presented for the problem. The simulation results prove that this algorithm has a good optimal searching performance and it can satisfy the real-time requirement.

Keywords

computational complexity; multi-agent systems; particle swarm optimisation; stochastic processes; MPSO; distance mechanism; evolution strategy; fast collision detection algorithm; hierarchical topology structure; multiagent particle swarm optimization; multiagent system technology; nonlinear optimization problem; optimal searching performance; stochastic method; Algorithm design and analysis; Geometry; Optimization; Particle swarm optimization; Real-time systems; Search problems; Stochastic processes; Collision Detection; Hierarchical Topological Structure; Multi-agent; Particle Swarm Optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Virtual Reality and Visualization (ICVRV), 2013 International Conference on

Conference_Location

Xi´an

Type

conf

DOI

10.1109/ICVRV.2013.52

Filename

6689433