区域目标搜索中基于改进RRT的UAV实时航迹规划

在线自主航迹规划是无人机(Unmanned Aerial Vehicles,UAV)执行区域目标搜索任务的有效保证.针对UAV区域搜索中航迹规划的实时性要求,提出了一种固定搜索模式和动态搜索模式相结合的UAV自主航迹规划框架.在快速扩展随机树(RRT)方法的基础上,通过改进随机扩展树的节点选择和引入启发式信息,提出了基于改进RRT的UAV实时搜索航迹规划算法,该算法能够有效降低在线航迹规划的时间代价和扩展节点数.仿真实验结果验证了本文方法的有效性.     

当前社区消防工作存在问题及解决对策

首先介绍社区消防工作的现状及搞好社区消防工作的重要性;然后从规划设计不健全、总体布局不合理,政府干预严重、消防设施缺乏,管理混乱、制度不健全,管理标准不一、要求不严,社区内安全疏散系统不完善五个方面分析了社区消防工作存在的突出问题;最后有针对性地从搞好消防规划,严把建筑工程审核验收关,提高居民消防安全意识,定期开展消防安全检查、及时消除火灾隐患,建章立制、狠抓落实五个方面提出解决的方法。     

基于几何算法的水下航行器路径规划

在分析水下航行器路径规划影响因素及主要障碍物特点的基础上,提出了一种基于几何算法的水下航行器路径规划算法,并采用该算法对障碍物进行建模和路径规划研究,解决了水下航行器航经多障碍物海区的路径规划问题.最后,通过仿真试验验证了该算法的准确性与可行性.     

复杂约束下的导弹作战任务规划模型和算法研究*

导弹作战任务规划是一个涉及时间、资源、质量和其他关系约束的复杂问题.首先通过定叉约束满足效用对基本约束满足模型进行了扩展,建立了导弹任务规划的约束满足优化模型.在此基础上,研究了任务规划模型求解的时间和效用传播算法,提出了基于综合效用的优化求解框架.该模型和求解框架易于解决具有多种约束因素的复杂问题,具有较好的通用性.通过定义软、硬约束效用,使得实际任务规划问题求解具有更好的灵活性.     

Disaster management in case of CBRNe events: an innovative methodology to improve the safety knowledge of advisors and first responders

Nowadays, Chemical-Biological-Radiological-Nuclear-explosive (CBRNe) risks are one of the world's main safety concerns. The radiological disasters of Fukushima and Chernobyl, the chemical events of Seveso or the release of Sarin in the Tokyo Subway, the biological emergencies such as the H1N1 flu or the recent Ebola outbreak, and recent news about the availability of non-conventional weapons acquired by fundamentalist organisations represent evidence of potential future threats. CBRNe risks are a real and global threat. The University of Rome, Tor Vergata, in collaboration with the most important Italian and international bodies working in the field of CBRNe safety and security, and supported by the North Atlantic Treaty Organisation and the Organisation for the Prohibition of Chemical Weapons, organises International Masters Courses on the Protection against CBRNe events. Within this framework, a Table-Top Exercise was planned, in collaboration with the Italian Ministry of Interior and Ministry of Defence. The scenario, the logistic organisation, on-going adjustments during the exercise and the outcomes are presented here and analysed.     

基于势场启发蚁群算法的远程水中兵器航路规划

针对航行误差较大的远程水中兵器航路规划问题,采用栅格化方法建立海洋环境模型,为使兵器在航行过程中能有效规避障碍并导向目标,提出一种人工势场力为启发因子的改进蚁群算法,利用该方法搜索远程水中兵器从起始点至目标点的最佳路径,算法解决了经典蚁群算法容易陷入局部最优及收敛速度慢的问题。仿真结果表明该规划算法虽有少量的路径损失,但可以有效避免由于误差引起的航行安全问题,是一种有效的远程水中兵器航路规划方法。     

对数据后处理雷达的多参数协同相关干扰

基于DRFM转发或者重复转发的干扰信号,虽然在功率上能达到干扰要求,但是产生的虚假目标与真实目标缺乏相关性,数据后处理雷达能根据该特性实现对欺骗干扰信号的检测和抑制。针对数据后处理雷达在抑制非相关干扰信号的优越表现,根据不同特征域干扰信号的相关性要求,提出了在幅度域上具有起伏特性,时频域协同一致,方位上具有相关性的干扰信号模型,以保证对数据后处理雷达干扰的有效性。最后在与非相关干扰信号比较中,验证了该干扰方式的有效性。     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

基于改进快速扩展随机树的机械臂路径规划

针对机械臂路径规划问题,提出一种基于改进RRT算法的路径规划方法。改进RRT结合了目标偏置策略和贪婪生长策略的优点,在随机采样时,以一定概率使采样点偏置为目标节点,降低随机采样的盲目性,在目标节点方向上采用贪婪式扩展策略,增加随机树局部方向上的生长速度。RRT法规划路径结果并非最优,提出改进GPP法删除多余路径节点,优化机械臂运动路径。通过与Biased-RRT和Greedy-RRT数值仿真结果对比,证明了改进RRT在计算时间、迭代次数、扩展节点数上均优于以上方法。在机械臂两种典型工作环境中的仿真结果表明,使用该方法可以较好解决排爆机械臂避障路径规划问题。     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003