摘要
采用网格技术,并结合标签设定路由机制,提出一种搜索目标穿越轨迹的数值近似优化算法。该算法可使智能目标在起点至终点的轨迹长度不大于约束阈值的前提下实现近似最优穿越。分析和试验结果表明,算法能有效的搜索到满足约束条件的近似最佳轨迹,同时可以通过增加网格阶数来提高轨迹精确度。
Utilizing grid and label setting routing mechanism, an approximate optimization approach was proposed for finding traversal trajectory of target. The algorithm can calculate the approximate optimal trajectory of intelligent target with a constraint on the trajectory length, where the trajectory length from start to destination is less than special thresh- old. Theoretical analysis and extensive experiments results show that the proposed scheme is able to find the approximate minimal exposure trajectory with constraints and improve accuracy of the trajectory by increase order of grid.
出处
《通信学报》
EI
CSCD
北大核心
2011年第6期67-77,共11页
Journal on Communications
基金
国家自然科学基金资助项目(60973031)
国家教育部博士点基金资助项目(20100161110025)~~
关键词
暴露度
网格
穿越轨迹
约束最小暴露轨迹
标签设定算法
exposure
grid
travel trajectory
minimal exposure trajectory with constraint
label setting algorithm