ISCAS OpenIR
evolutionary tabu search in task allocation of unmanned aerial vehicles
Yan Ping; Zheng Changwen
2006
Conference NameIMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)
Pages932-938
Conference DateOCT 04-06,
Conference PlaceBeijing, PEOPLES R CHINA
Indexed Typeistp ; ieee
Publish PlaceTSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA
Publisher2006 IMACS: Multiconference on Computational Engineering in Systems Applications, Vols 1 and 2
ISBN978-7-302-13922-5
DepartmentChinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
English AbstractThis paper addresses the problem of task allocation problem for a fleet of unmanned aerial vehicles (AVs). An evolutionary tabu search (TS) algorithm is proposed to search the optimal solution to the task allocation problem. In this algorithm,
KeywordUav Task Allocation Evolutionary Computation Tabu Search
SponsorshipIMACS, IEEE SMC Soc, Tsinghua Univ, Ecole Centrale Lille, Ecole Natl Superieure Arts & Ind Textiles, Natl Nat Sci Fdn China
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/12088
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Yan Ping,Zheng Changwen. evolutionary tabu search in task allocation of unmanned aerial vehicles[C]. TSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA:2006 IMACS: Multiconference on Computational Engineering in Systems Applications, Vols 1 and 2,2006:932-938.
Files in This Item:
File Name/Size DocType Version Access License
04281784.pdf(1920KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yan Ping]'s Articles
[Zheng Changwen]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yan Ping]'s Articles
[Zheng Changwen]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yan Ping]'s Articles
[Zheng Changwen]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.