基于LPN-DE与适应度拍卖的多机器人路径规划  

Multi-robot path planning based on LPN-DE and fitness auction

作　　者：王锐[1] 芮延年[1] 张飞[1] 查焱[1] 

机构地区：[1]苏州大学机电工程学院,江苏苏州215021

出　　处：《电子技术应用》2009年第2期139-142,共4页Application of Electronic Technique

摘　　要：在RoboCup环境下,针对多机器人的路径规划和任务分配,将LPN-DE方法和组合拍卖法有效结合,综合考虑多机器人的避障、路径规划和角色分配,提出了完整的实现方法和动态模型,并在RoboCup中型组机器人上验证了该方法的实用性和有效性。For the multi-robot path planning and task allocation in the RoboCup environment,combining LPN-DE and combinational auction method,we proposed a complete accomplishing method and dynamic model based on detailed considering of multi-robot obstacle aviodenc,path planning and role allocation.Then we confirmed the practicability and effectiveness of the method in RoboCup middle-size robots.

关 键 词：LPN-DE 适应度 组合拍卖 路径规划 

分 类 号：TP242.3[自动化与计算机技术—检测技术与自动化装置]