Multi-Agent Collaborative Research Based on an Optimization Method about Multiple Evaluation Function with Hybrid Particle Swarm with Constraints

Article Preview

Abstract:

This paper presents an optimization method about multiple evaluation function with hybrid particle swarm with constraints on the base of an optimization algorithm of hybrid particle swarm, which is used to solve the problem of multi-agent collaboration in the rescue simulation system. The optimization process uses a variety of evaluation function and also calculates the constraint relationship among the evaluation functions on the particle iterative process in order to obtain multi-objective optimization results that meet multiple conditions. The method is suitable for the collaborative problem among a variety of heterogeneous agents, which presents the collaboration among heterogeneous agents through constraints. The method proves to be effective in the practical application of the rescue simulation system.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1510-1514

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] EREKMEN I, ERKMEN AM, MATSUNO Fetal. Snake robots to the rescue[J]. IEEE Robotics &Automation Magazine, 2002, 9(3): 17-25.

DOI: 10.1109/mra.2002.1035210

Google Scholar

[2] GUAN Da-qi, CHEN Ning, JIANG Yin-hao. RoboCup Rescue 2010 – Rescue Simulation League Team Description <SEU_REDSUN (P.R. China)>[EB/CD]. RoboCup 2010 Symposium Proceeding CD. Singapore: RoboCup Foundation, (2010).

DOI: 10.1007/3-540-45603-1_130

Google Scholar

[3] AKIN H L, YILMAZ O, SEVIM M M. RoboAKUT 2010 Rescue Simulation League Agent Team Description [EB/CD]. RoboCup 2010 Symposium Proceeding CD. Singapore: RoboCup Foundation, (2010).

Google Scholar

[4] CASPER J, MURPHY R, Human robot interaction during the robot-assisted urban search and rescue response at the World Trade Center [J]. IEEE Transaction on System, Man., and Cybernetics-Part B: Cybernetics, 2003, 33(3): 367-383.

DOI: 10.1109/tsmcb.2003.811794

Google Scholar

[5] KENNEDY J, EBERHART R C. Particle swarm optimization[C] /IEEE International Conference on Neural Networks. Piscataway, NJ: IEEE Press, 1995:1942-(1948).

Google Scholar

[6] KENNEDY J, EBERHART R C. A discrete binary version of the particle swarm algorithm[C]/ Proceedings of the World Multi-conference on Systemics, Cybernetics and Informatics. Piscataway, NJ: IEEE Service Center, 1997:4104- 4109.

DOI: 10.1109/icsmc.1997.637339

Google Scholar

[7] SHI Y, EBERHART R C. A modified particle swarm optimizer[C] /IEEE International Conference of Evolutionary Computation Proceedings. Alaska: IEEE Press, 1998: 69-73.

DOI: 10.1109/icec.1998.699146

Google Scholar

[8] PARSOPOULOS K E, PLAGIANAKOS V P, MAGOULAS G D, et al. Improving the particle swarm optimizer by function stretching, [C]/HADJISAVVAS N, PARDALOS P. Advances in Convex Analysis and Global Optimization. Netherlands: Kluwer Academic Publishers, 2001: 445-457.

DOI: 10.1007/978-1-4613-0279-7_28

Google Scholar