Institutional Repository
| a multipath planner for uav based on pareto optimization | |
| Zhu Hongguo; Hai Xin; Zheng Changwen | |
| 2011 | |
| Conference Name | 2011 International Conference on Information Technology for Manufacturing Systems, ITMS 2011 |
| Source | Applied Mechanics and Materials |
| Pages | 2356-2359 |
| Conference Date | May 7, 201 |
| Conference Place | Shanghai, China |
| Indexed Type | EI |
| ISSN | 1660-9336 |
| ISBN | 9783037851494 |
| Department | (1) National University of Defense Technology Changsha Hunan 410073 China; (2) Institute of Software Chinese Academy of Science Beijing 100090 China |
| English Abstract | A multipath planner for UAV based on Pareto optimization is proposed to overcome the disadvantage of planners existed. Multipath planning is modeled as a constrained multiobject optimization problem. A Pareto solution of multipath for UAV is generated by optimizing several object functions at the same time. The simulation results demonstrated the feasibility of the approach. © (2011) Trans Tech Publications, Switzerland.; A multipath planner for UAV based on Pareto optimization is proposed to overcome the disadvantage of planners existed. Multipath planning is modeled as a constrained multiobject optimization problem. A Pareto solution of multipath for UAV is generated by optimizing several object functions at the same time. The simulation results demonstrated the feasibility of the approach. © (2011) Trans Tech Publications, Switzerland. |
| Keyword | Information Technology Manufacture Pareto Principle |
| Sponsorship | University of Adelaide; Huazhong University of Science and Technology |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16188 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhu Hongguo,Hai Xin,Zheng Changwen. a multipath planner for uav based on pareto optimization[C],2011:2356-2359. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment