可行三维航迹个体的生成算法

在遗传算法中,初始种群中个体的质量对遗传算法的收敛速度影响较大.本文在分析航迹规划约束条件的基础上,设计了一种初始航迹个体的生成算法,产生的三维航迹个体满足飞行器性能约束,并能避免撞山危险,比传统的随机生成算法产生的航迹个体具有较大的适应度.使遗传算法能有效避免冗余搜索,从而提高航迹规划的收敛速度.     

遥感技术在上海立体绿化调查与规划中的优点与局限分析

由于立体绿化对于改善城市环境具有明显效应,上海近些年来正在大力推广立体绿化。然而,立体绿化在调查与规划上面临着难以掌握现状和潜在资源的难题。在上海的应用中,使用高分辨率航空遥感影像有效解决了上述难题。实践结果表明,遥感技术具有较多优点,同时也存在一些局限性。对此进行了分析,并针对局限性提出了相关对策。     

可再生能源系统的不确定性优化模型及求解

结合新提出的满意度方法和混合整数规划方法,给出了多态不确定性环境下可再生能源规划模型.该模型综合描述了多地区、多时期、多品种、多部门之间的可再生能源管理系统的复杂性、系统性、动态性和不确定性.最后的实例求解结果说明该模型能很好地反映能源安全性、系统可靠性与系统成本之间的关系,并能给出不同系统违反水平下的能源配置方式及增容计划,为决策者提供决策参考.     

“仓店一体化”模式下订单拣选与配送集成调度优化

针对“仓店一体化”模式下提供限时送达服务的新零售仓店,研究多拣货员、多客户、配送方式为带限时送达约束的路径优化分批配送情形下的订单拣选与配送集成调度问题。以最小化订单最大履行时间和配送成本为目标,构建了混合整数非线性规划模型,并设计两阶段启发式算法(H-2)进行求解,最后通过数值实验对算法进行验证与分析。数值实验结果表明,H-2具有较高的求解质量;相较于传统调度算法(TS)在效率提升、资源节约以及客户满意度提高方面具有更优的表现,进而为新零售仓店管理者提供决策支持。     

A Novel Integrated Path Planning Algorithm for Warehouse AGVs

We propose an integrated path planning method for multiple automated guided vehicles performing logistics delivery within a real-world warehouse environ-ment considering obstacles. By applying it on each vehicle, this proposed method enables the vehicle the vehicles have the capabilities for autonomous path planning. The path planning consists of three parts, K-means algorithm based task points clustering, genetic algorithm based task points ordering, and the probabilistic road map based best path search. Vehicle conflict resolution is depending on implementing the probabilistic road map construction considering the realistic map with obstacles. The simulations result validate that the clustering and ordering are necessary for the path planning, both the path planning time and the Automated guided vehicles (AGVs) running time can be dramatically reduced.     

内容计费及其技术路线

基于传统语音业务利润率下降的现实,阐述了内容服务价值链的形成原因和组成,并提出建设一套能够为电信运营商所用、所管、所利的内容计费平台的必要性.最后,概要说明了内容计费平台的建设原则和两种技术方案与适用条件.     

江西电信NGN建设浅析

迫于移动及IP业务的分流压力,中国电信提出了企业转型。新建NGN网络作为网络转型的重要部分,2005年已经正式启动,现在正在紧张建设之中。中国电信为何要建设NGN,如此庞大的全国性的网络是如何架构的,NGN在当前充当了何种角色,其话务疏通原则、计费是怎样的,NGN与PSTN有何种关系,本文对这些问题作了一定的分析和介绍。     

基于遗传算法的变电站巡检机器人任务路径规划方法研究

近年来,随着变电站巡检机器人在变电站中的广泛使用,巡检机器人路径规划问题越来越成为亟待解决的问题。巡检机器人在已知的拓扑地图中标记了待执行巡检任务的停靠点,不同任务需要从初始点出发经过不同的一系列停靠点再返回初始点,如何规划路径是机器人面临的问题。首先分析了路径规划面临的问题,然后通过分析拓扑地图的特征,对地图进行等价简化,再对问题进行建模使用遗传算法求解巡检任务路径规划的近似最优解。通过仿真实验证明,提出的基于遗传算法的路径规划方法是可行有效的,为变电站巡检机器人任务路径规划提供了一种有效方法。     

The acquisition of new technology and its impact on a firm's competitive position

The strategic decision concerning the optimal and dynamic acquisition of new technology is examined. The model focuses on a profit maximizing firm that optimally derives its price, level of output, and its level and composition of productive capacity over time. The acquisition of new technology and reduction of existing capacity may occur simultaneously, so that the composition of the firm's productive resources may be upgraded over time. It is assumed that the acquisition of new technology causes a reduction in production costs and a direct increase in the firm's demand. The demand experienced by the firm may be directly increased as a result of acquiring new technology due to benefits such as expanded product-mix or volume capabilities, improved quality of output, or improved customer service (shorter production lead time). In addition, it is shown that demand is indirectly increased due to the reduced production costs that enable the firm to charge a lower price. Therefore, the strategic impact of acquiring new technology is captured, since its effect on future demand and the firm's ability to meet the demand are considered. The importance of capturing the increased demand potential offered by the new technology is demonstrated through the analysis of numerical examples. In addition, the effect on the optimal solution caused by a variety of environmental conditions is examined. For example, the impact of technological innovation is observed by defining (i) the cost of acquiring technology as a decreasing function of time, and (ii) the effectiveness of new technology on reducing operating costs as an increasing function of time.     

Walking an unknown street with bounded detour

A polygon with two distinguished vertices, s and g, is called a street if the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision system we describe a strategy for finding a short path from s to g in a street not known in advance, and prove that the length of the path created does not exceed 1 + π times the length of the shortest path from s to g. Experiments suggest that our strategy is much better than this, as no ratio bigger than 1.8 has yet been observed. This is complemented by a lower bound of 1.41 for the relative detour each strategy can be forced to generate.