The Task Assignment Solution for Multi-Target Pursuit Problem
文献类型：会议论文
| 作者 | Yang LY(杨丽英) ; Wu CD(吴成东); Han JD(韩建达); Nie YY(聂义勇)
|
| 出版日期 | 2009 |
| 会议名称 | 2009 International Conference on Computational Intelligence and Software Engineering. CiSE 2009 |
| 会议日期 | December 11-13, 2009 |
| 会议地点 | Wuhan, China |
| 页码 | 1-6 |
| 中文摘要 | In this paper task assignment and path planning for multi-target pursuit (MTP) problem are studied. The mixed integer linear programming (MILP) of minimax assignment is formed, and a solution called operations on matrix is presented. The single linear programming obstacle-avoided and the "expansible target size" target pursuit method modeled by linear programming (LP) is proposed to solve the path planning problem. Finally, simulation is given to show the efficiency of the method. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议主办者 | IEEE |
| 会议录 | 2009 International Conference on Computational Intelligence and Software Engineering. CiSE 2009
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | New York |
| 语种 | 英语 |
| 源URL | [http://ir.sia.cn/handle/173321/8919]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Yang LY,Wu CD,Han JD,et al. The Task Assignment Solution for Multi-Target Pursuit Problem[C]. 见:2009 International Conference on Computational Intelligence and Software Engineering. CiSE 2009. Wuhan, China. December 11-13, 2009. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。