Impoverishment of YOY‐fish assemblages by intense commercial navigation in a large Lowland river

Navigation‐induced physical forces have been suggested to modify the structure of riverine fish assemblages by impeding especially the recruitment of littoral bound species. To investigate the effect of vessel frequency on fish, we compared the composition and seasonal succession of young‐of‐the‐year (YOY) fish assemblages in three similarly degraded river reaches differing in average vessel passages (2, 6 and 41 per day). Fish were caught by electrofishing biweekly between May and September. Multivariate tests were used to analyse differences between YOY‐fish assemblages and hurdle regression models applied to determine abiotic factors predicting fish occurrence and abundance. Roach (Rutilus rutilus) and perch (Perca fluviatilis) densities were compared. Roach larvae remain in the littoral zone while perch larvae shift to the pelagic zone immediately after hatch. YOY‐fish assemblage structure substantially changed along the traffic intensity gradient. In the high traffic intensity reach, species number and total fish density were markedly reduced compared to the other reaches. Roach densities were lowest in the high traffic intensity reach whereas perch densities did not decline along the gradient. Hurdle regressions confirmed a stronger effect of commercial navigation traffic intensity on roach than on perch. The total zooplankton biomass was highest in the high traffic intensity reach. Our results provide empirical evidence that intensive commercial navigation impoverishes fish assemblages in width‐restricted waterways. They underlined that in particular those species that have their first nursery habitats in shoreline areas were more affected by intensive commercial navigation than species whose larvae live predominantly pelagic. The results indicate that the negative effect of intensive navigation on riverine fish results primarily from the navigation‐induced hydraulic disturbances along the banks. Therefore, mitigation of navigation‐induced hydraulic forces is required to prevent degradation of fish communities in waterways. Copyright © 2010 John Wiley & Sons, Ltd.     

水口坝下水位治理工程通航安全评估

简要介绍水口坝下枢纽工程兴建,从工程选址、通航标准、枢纽主要建筑物设计、自然条件对拟建工程的影响、施工期通航条件、安全保障措施等方面进行了分析论证和安全评估.     

视觉导航相关技术发展及其研究分析

为了全面了解航空器应用背景下的视觉导航相关技术的研究与进展,深入分析了视觉导航关键技术。分别对与传感器图像相关的载体姿态提取技术、基于图像匹配算法的定位技术以及基于序列图像的速度测量技术这三种技术进行了全面阐述,重点论述了姿态与参考特征的关系、景像匹配定位的核心算法及速度测量的两类方法,并总结了视觉导航发展过程中的相关难点与发展趋势。     

GPS信号自适应抗干扰系统

针对GPS卫星信号易受干扰,不稳定的问题,提出INS/GPS组合导航抗干扰的方法并用硬件电路进行实现验证。给出了惯性器件的误差模型,采用松散组合方式,设计卡尔曼滤波器,取姿态、速度、位置的误差作为状态变量。提出以INS与GPS输出的东北天向速度误差作为滤波器观测量的方案。通过计算机的仿真和实验验证,对系统的精度进行了分析,证明该方案是可行的,实现实时滤波计算,并能满足导航的精度要求。     

实时自适应导航手机地图服务系统的研究和实现①

通过分析传统手机地图服务系统,设计与实现了导航手机地图服务系统。系统对地图数据进行有效组织,并通过记录与分析用户的交互操作对用户感兴趣对象进行归类,从而提供实时更新和自适应的手机地图。     

双目视觉的新颖实时局部2维地图构建方法

根据轮式机器人移动的特点,提出一种采用双目视觉的新颖实时局部2维栅格地图构建算法。首先,提出虚拟高度线投影成像原理,将场景均匀栅格化,在栅格中引入虚拟高度线,并将其投影到立体视觉系统的立体图对中产生投影线,将求解场景点高度值的问题转化为在投影线上和水平视差搜索范围内寻找具有最大相似测度的对应点问题;然后,提出一种新颖的局部2维地图构建方法,该方法以机器人所能越过的最大高度为阈值,对高于阈值部分的虚拟高度投影线上的场景点由其在图像对中的相似测度确定其是否为障碍物区域。实验结果表明,该方法满足机器人导航所要求的有效性和实时性,并可应用到构建3维地图。     

基于序贯处理的航位推算组合导航算法研究

对由捷联惯导和测速设备所搭建的航位推算系统进行了研究,提出了一种基于航位推算系统的组合导航算法。该算法在传统的航位推算算法的基础上,利用惯组中加速度计组合的输出和航位推算给出的位置与姿态完成了惯导速度更新。将惯导速度与航位推算速度构造的速度量测和由航位推算位置与地标点给出的位置参考构成的位置量测输入卡尔曼滤波器,采用序贯处理完成了对姿态误差的估计。这种方法较好的解决了组合导航系统具有多个输出频率差异很大的量测时信息融合的问题。最后通过半实物仿真对该算法的有效性进行了验证。     

基于球面全景图的空战环境漫游研究

研究鱼眼图像的拼接算法,实现利用两幅鱼眼图像生成球面虚拟空间,然后探讨基于球面虚拟图的多视点漫游问题,利用反投影模板技术有效地提高全景图浏览的速度,采用缩放的方法改进了行进间的浏览效果,从而提高虚拟漫游的沉浸感,具有一定的实用意义。     

视觉导航特征点匹配及误匹配剔除算法

飞行器视觉导航中图像的复杂性对特征点匹配提出了很高的要求。根据图像HSV色彩空间各分量固有的稳定性提出了一种新的特征点不变向量生成方法,以基于欧氏距离的最近邻准则作为特征点的相似度量将该算法提取的特征应用于图像特征点匹配;为了降低特征点描述向量的维数,提高匹配的实时性,采用了主成分分析(PCA)方法。针对误匹配问题,提出了一种利用惯性导航系统的输出信息进行误匹配特征点检测的方法。最后,通过实验证明,所提出的色彩匹配方法可以提高匹配的准确率,并且通过将PCA方法与上述方法结合不仅可以保持匹配的准确性还能降低计算的复杂度;所提出的误匹配检测方法可以较好的剔除误匹配点并能满足实时性的要求,这为视觉导航提供了一种可靠性更高的特征点匹配方法。     

Theory and implementation of path planning by negotiation for decentralized agents

This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collision-free trajectories in real-time. The algorithm is robust with respect to arbitrary delays in the wireless traffic, possible sources being transmission time and error correction. Agents move on reserved areas which are guaranteed not to intersect, therefore ensuring safety. A handshaking procedure guarantees recent information states for the agents. Conflicts between agents are resolved by a cost-based negotiation process. The basic algorithm is augmented by the introduction of waypoints, which increase performance at the cost of additional wireless traffic. An implementation of the algorithm is tested in simulation and successfully applied to a real system of autonomous robots. The results are presented and discussed.