A Solution of Mixed Integer Linear Programming for Obstacle-Avoided Pursuit Problem
文献类型：会议论文
| 作者 | Yang LY(杨丽英) ; Han JD(韩建达); Wu CD(吴成东); Nie YY(聂义勇)
|
| 出版日期 | 2008 |
| 会议名称 | International Joint Conference on Neural Networks |
| 会议日期 | June 1-8, 2008 |
| 会议地点 | Hong Kong, China |
| 页码 | 110-116 |
| 通讯作者 | 杨丽英 |
| 中文摘要 | In this paper the path planning for obstacle-avoided pursuit problem (OAP) is studied. The OAP models based on the mixed integer linear programming (MILP) is presented. In the OAP models, the dynamic equation of mass point with linear damping is taken as the state equation of vehicle's motion. Integer variables are used to describe the relative position of vehicle and obstacles. "Expansible Target Size" is proposed to describe the pursuit process for target step-by-step. "Pursuit Direction" of vehicle is defined. The Isometric Plane Method selected integer variables is used to solve MILP pursuit problem. How to select the integer variables of inner point is also given. Finally, simulations are given to show the efficiency of the method. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议主办者 | IEEE |
| 会议录 | 2008 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-8
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | NEW YORK |
| 语种 | 英语 |
| ISSN号 | 1098-7576 |
| ISBN号 | 978-1-4244-1820-6 |
| WOS记录号 | WOS:000263827200018 |
| 源URL | [http://ir.sia.cn/handle/173321/8521]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Yang LY,Han JD,Wu CD,et al. A Solution of Mixed Integer Linear Programming for Obstacle-Avoided Pursuit Problem[C]. 见:International Joint Conference on Neural Networks. Hong Kong, China. June 1-8, 2008. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。