In order to solve the task allocation problem in a multi-agent system, namely RoboCup robot rescue simulation system (RCRSS), a task allocation mechanism based on auction is proposed. Using the mechanism, the agents can enter and leave the auction market flexibly and switch role dynamically. Meanwhile the anxiety degree is introduced to adjust the allocation scheme after the basic task allocation. As a result, rescue agents can adapt to dynamic disaster environments. Experimental results show that the rescue team using the proposed method is more suitable for different complex disaster environments than the rescue team using the genetic algorithm in terms of fulfilling the rescue tasks, reducing the task response delay and improving the efficiency of rescue system in a limit time.
[1] Zhang L P, Zhang Y S. Research on hierarchical distributed coordination control in process industry based on multi-agent system[C]//International Conference on Measuring Technology and Mechatronics Automation. Piscataway, USA: IEEE, 2010: 96-100.[2] Charaf M E H, Benattou M, Azzouzi S. A rule-based multi-agent system for testing distributed applications[C]//Interna- tional Conference on Multimedia Computing and Systems. Piscataway, USA: IEEE, 2012: 967-972.[3] Balbo F, Pinson S. Dynamic modeling of disturbance in a multi-agent system for traffic regulation[J]. Decision Support Systems, 2005, 41(1): 131-146. [4] Ponda S S, Johnson L B, How J P. Distributed chance-constrained task allocation for autonomous multi-agent teams [C]//American Control Conference. Piscataway, USA: IEEE, 2012: 4528-4533.[5] Li Y K, Gao Z P, Yang Y, et al. An improved auction scheme for task allocation in wireless sensor network[C]//6th International Conference on Wireless Communications, Networking and Mobile Computing. Piscataway, USA: IEEE, 2010: 1-4.[6] 廖沫,陈宗基.基于多Agent分布协同拍卖的动态目标分配算法[J].北京航空航天大学学报,2007,33(2):180-183,196. Liao M, Chen Z J. Dynamic target assignment method based on multi-agent decentralized cooperative auction[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(2): 180-183,196.[7] Boutilier C, Goldszmidt M, Sabata B. Sequential auctions for the allocation of resources with complementarities[C]//16th International Joint Conference on Artificial Intelligence. San Francisco, USA: Morgan Kaufmann, 1999: 527-534.[8] Guan D Q, Xu Y Q, Tan Y Z. Particle filter based study of fire forecasting in RCRSS[C]//IEEE International Conference on Industrial Engineering and Engineering Management. Piscataway, USA: IEEE, 2009: 1265-1268.[9] P A T, Murthy C S R. Optimal task allocation in distributed systems by graph matching and state space search[J]. Journal of Systems and Software, 1999, 46(1): 59-75. [10] Chand P, Carnegie D A. Development of a reduced human user input task allocation method for multiple robots[J]. Robotics and Autonomous Systems, 2012, 60(10): 1231-1244. [11] Conti P L, de Giovanni L, Naldi M. A rank-and-compare algorithm to detect abnormally low bids in procurement auctions[J]. Electronic Commerce Research and Applications, 2012, 11(2): 192-203. [12] Gao L, Xu Y Y, Wang X B. MAP: Multiauctioneer progressive auction for dynamic spectrum access[J]. IEEE Transactions on Mobile Computing, 2011, 10(8): 1144-1161. [13] 姜健,臧希喆,赵杰.基于焦虑度概念和拍卖方法的多机器人协作搜集[J].控制与决策,2008,23(5):541-545. Jiang J, Zang X Z, Zhao J. Cooperative multi-robot foraging based on anxiety conception and auction method[J]. Control and Decision, 2008, 23(5): 541-545.
