Multiple Object Trajectography Using Particle Swarm Optimization Combined to Hungarian Method
[1]
Max Cerf, Department of Mission Analysis, Ariane Group, Les Mureaux, France.
The problem of simultaneous trajectography of several dynamical objects is formulated as an optimization problem. The available observations consist in a series of photographs showing undiscriminated objects. The goal is to find the object initial states so that the resulting trajectories match as well as possible the set of observations. An assignment problem is solved at each observation date by the Hungarian method, yielding a deviation cost between the simulated trajectories and the measurements. A fitness function summing the deviation costs is minimized by a particle swarm algorithm. The method is illustrated on a space orbitography application.
Trajectography, Assignment, Particle Swarm Optimization, Hungarian Method
[1]
Gelb A., Applied Optimal Estimation, Cambridge MA, MIT Press, 1989.
[2]
Ljung L., System identification: Theory for the user, Edition 2, Prentive Hall, 1999.
[3]
Vallado D. A., Fundamentals of Astrodynamics and Applications, Springer, 2007.
[4]
Schrijver A., Theory of Integer and Linear Programming, Wiley and Sons, 1986.
[5]
Nemhauser G., Wolsey L., Integer and Combinatorial Optimization, Wiley and Sons, 1999.
[6]
Busacker R. G., Gowen P. J., A procedure for determining minimal-cost network flow patterns, ORO Technical Report 15, Operational Research Office, John Hopkins University, 1961.
[7]
Orlin J. B., A faster strongly polynomial minimum cost flow algorithm, Proceedings of the 20th ACM Symposium on the Theory of Computing, p. 377-387, 1988.
[8]
Ravindra K. A., Thomas L. M., Orlin J. B., Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993.
[9]
Kuhn H. W., The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly, vol. 2, p. 83-97, 1955.
[10]
Christofides N., Graph Theory: An Algorithmic Approach, Academic Press, 1975.
[11]
Papadimitriou C., Steiglitz K., Combinatorial Optimization, Dover, 1998.
[12]
Conway B., Spacecraft Trajectory Optimization, Cambridge University Press, 2010.
[13]
Bonyadi M. R., Michalewicz Z., Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review, Evolutionary Computation, vol. 25, issue 1, p. 1-54, 2017.
[14]
Kennedy J., Eberhart R., Particle swarm optimization, IEEE International Conference on Neural Networks Proceedings, vol. 4, p. 1942-1948, 1995.
[15]
Mishra S. K., Repulsive Particle Swarm Method on Some Difficult Test Problems of Global Optimization, MPRA Paper no. 1742, 2006.
[16]
Chobotov, V., Orbital mechanics, 3rd Edition, AIAA Education Series, 2002.
[17]
Escobal, P. R., Methods of Orbit Determination, 2nd Edition, Wiley and Sons, 1976.
[18]
Fadrique, F. M., Maté A. A., Grau J. J., Sanchez J. F., Garcia L. A., Comparison of angles only initial orbit determination algorithms for space debris cataloguing of Orbit Determination, Journal of Aerospace Engineering, Vol IV, No 1, 2012.
