摘要
针对多机器人搜集任务中可能出现的任务死锁现象,采用基于组合拍卖的方法来解决这一问题。提出了一种拍卖树方法,用来解决组合拍卖计算量过大的问题。仿真实验结果表明该方法不仅能够消除多机器人的任务死锁,而且能够在解决死锁问题的同时优化多机器人任务分配结果。
A method based on combinatorial auction is presented to solve the deadlock phenomenon in multi-robot foraging.A method named auction tree is presented to solve the problem of excessive combination strategy computation of combinatorial auction.The simulation results show that the method presented in the paper not only can solve the deadlock of multi-robot task but also can make the multi-robot task allocation optimized.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第4期1-3,共3页
Computer Engineering and Applications
基金
国家高技术研究发展计划(863)(the National High- Tech Research and Development Plan of China under Grant No.2006AA04Z245)
教育部长江学者和创新团队发展计划(No.IRT0423)
关键词
多机器人系统
协作
死锁
组合拍卖
multi-robot systems
cooperation
deadlock
combinatorial auction