Optimal design of multistage coilgun

被引:25
作者
Kim, SW [1 ]
Jung, HK [1 ]
Hahn, SY [1 ]
机构
[1] KANGWEON NATL UNIV,DEPT ELECT ENGN,CHUNCHON 200701,SOUTH KOREA
关键词
D O I
10.1109/20.486539
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents an optimal design for a multistage capacitor-driven inductive coilgun, For the optimal design, the genetic algorithm and a launching simulation are used. The launching simulation algorithm employs equivalent circuit equations and the equation of motion of projectile, The equations set for each stage are solved simultaneously using the Runge-Kutta method, The multistage coilgun is designed by a sequential design method. The resulting specifications and characteristics of a three-stage coilgun are obtained, It is found that the three-stage coilgun is more energy efficient than the single-stage one, For the same amount of energy expended the three-stage coilgun achieves a higher muzzle velocity.
引用
收藏
页码:505 / 508
页数:4
相关论文
共 12 条
[1]  
[Anonymous], 1991, Handbook of genetic algorithms
[2]   TRAVELING-WAVE INDUCTION LAUNCHERS [J].
ELLIOTT, DG .
IEEE TRANSACTIONS ON MAGNETICS, 1989, 25 (01) :159-163
[3]  
FAIR HD, 1989, IEEE T MAGN, V25, P9
[4]  
Goldberg D. E., 2013, Genetic Algorithms
[5]   TRANSIENT PERFORMANCE OF LINEAR INDUCTION LAUNCHERS FED BY GENERATORS AND BY CAPACITOR BANKS [J].
HE, JL ;
ZABAR, Z ;
LEVI, E ;
BIRENBAUM, L .
IEEE TRANSACTIONS ON MAGNETICS, 1991, 27 (01) :585-590
[6]   CONCERNING THE DESIGN OF CAPACITIVELY DRIVEN INDUCTION COIL GUNS [J].
HE, JL ;
LEVI, E ;
ZABAR, Z ;
BIRENBAUM, L .
IEEE TRANSACTIONS ON PLASMA SCIENCE, 1989, 17 (03) :429-438
[7]   AN OPTIMAL-DESIGN OF CAPACITOR-DRIVEN COILGUN [J].
KIM, SW ;
JUNG, HK ;
HAHN, SY .
IEEE TRANSACTIONS ON MAGNETICS, 1994, 30 (02) :207-211
[8]   BASIC PRINCIPLES OF COAXIAL LAUNCH TECHNOLOGY [J].
KOLM, H ;
MONGEAU, P .
IEEE TRANSACTIONS ON MAGNETICS, 1984, 20 (02) :227-230
[10]   MULTIPLE STAGE PULSED INDUCTION ACCELERATION [J].
MCKINNEY, K ;
MONGEAU, P .
IEEE TRANSACTIONS ON MAGNETICS, 1984, 20 (02) :239-242