改进 Ｄ∗ｌｉｔｅ 和时间弹性带法的移动机器人路径规划

为解决D*lite算法在进行路径规划时搜索效率低,易受运动物体影响及路径贴近障碍物的问题,提出了一种结合改进D*lite算法和时间弹性带法的融合算法。首先,将改进的跳点搜索引入到D*lite算法中,让算法只对跳点进行访问,实现了规划时间和路径长度的双优化。之后,融合改进的时间弹性带法进行局部路径规划,提高算法动态规划能力的同时保证了规划路径的安全性。仿真结果表明,改进的D*lite算法比原始D*lite算法在路径长度、规划时长及路径节点数上分别平均优化了6.40％、49.13％和73.70％。在实际表现中,融合算法在动态情况下比原始D*lite算法可减少11.04％的路径长度、67.10％的规划时长及11.99％的运动时间,并且保证了机器人和障碍物间的最小距离。     

基于改进A*算法和lattice算法的路径规划方法

针对A*算法缺乏动态性、不够平滑、计算量大,且不满足具体的非完整约束等问题,提出一种融合改进A*算法和lattice算法的路径规划方法.一方面消除传统A*算法中的冗余点,同时考虑物体的方向属性和实际运动约束,优化启发式函数最终生成全局路径.另一方面lattice根据改进A*算法生成的全局路径作为参考线,采样并结合障碍物信息和其他代价信息选出平滑的、无障碍的包含位置、移动速度、移动加速度等信息的局部轨迹.使用栅格地图进行车辆路径规划的实验仿真,该算法能够兼顾全局与局部,快速规划出一条平滑且满足车辆非完整性约束的运动路径.     

无人机三维航迹规划方法研究

航迹规划算法是无人机关键技术之一,同时也是任务规划系统（Mission Planning System）核心之一。针对固定目标规划问题,提出一种voronoi图改进算法和动态稀疏A*算法融合的三维航迹规划方法。该方法针对固定威胁目标,通过改进voronoi图规划算法快速求解二维航迹路径,然后在该路径参考下,用动态稀疏A*算法求解符合无人机飞行动力学约束的三维航迹。试验表明,该算法比动态稀疏A*算法规划速度快,并保证了航迹最优性。     

一种能量收集嵌入式系统自适应调度算法

能量收集嵌入式系统(energy harvesting embedded system,简称EHES)的任务调度算法需要考虑能量收集单元的能量输出、能量存储单元的能量水平和能量消耗单元的能耗.实时任务在满足能量约束的条件下,才可能满足时间约束.在这个背景下,传统固定优先级调度算法不再适用于EHES.提出一种基于分组的自适应任务调度算法,它能根据能量收集单元由于能量输出的不确定性而造成的非能量约束情况和能量约束情况,自适应地选择任务调度算法.在非能量约束的情况下,减少任务抢占次数,增强任务的可调度性;在能量约束情况下,减少电池模式切换次数,提高能量存储单元的平均能量水平,从而降低系统能量约束.在一个可进行大范围任务集合仿真的实验环境下对提出的算法进行验证,并将基于分组的自适应调度算法与现有的两个经典算法进行了对比.     

基于能量约束的自主水下航行器任务规划算法

多水下自主航行器（AUV）任务规划是影响集群智能水平的关键技术。针对现有任务规划模型只考虑同构AUV集群和单潜次任务规划的问题,提出了适用于AUV异构集群的多潜次任务规划模型。首先,该模型考虑了AUV的能量约束、AUV多次往返母船充电的工程代价、异构集群个体间的效能差异、任务多样性等关键因素;然后,为提高问题模型的求解效率,提出了一种基于离散粒子群的优化算法,该算法引入用于描述粒子速度、位置的矩阵编码和用于评估粒子质量的任务损耗模型,改进粒子更新过程,实现了高效的目标寻优。仿真实验表明,该算法不仅解决了异构AUV集群的多潜次任务规划问题,而且与采用遗传算法的任务规划模型相比较,任务损耗降低了11%。     

煤矿履带式定向钻机路径规划算法

煤矿履带式定向钻机路径规划过程中存在机身体积约束和实际场景下的行驶效率需求,而常用的A*算法搜索速度慢、冗余节点多,且规划路径贴近障碍物、平滑性较差。提出一种以改进A*算法规划全局路径、融合动态窗口法（DWA）规划局部路径的煤矿履带式定向钻机路径规划算法。考虑定向钻机尺寸影响,在传统A*算法中引入安全扩展策略,即在定向钻机和巷道壁、障碍物之间加入安全距离约束,以提高规划路径的安全性;对传统A*算法的启发函数进行自适应权重优化,同时将父节点的影响加入到启发函数中,以提高全局路径搜索效率;利用障碍物检测原理对经上述改进后的A*算法规划路径剔除冗余节点,并使用分段三次Hermite插值进行二次平滑处理,得到全局最优路径。将改进A*算法与DWA融合,进行煤矿井下定向钻机路径规划。利用Matlab对不同工况环境下定向钻机路径规划算法进行仿真对比分析,结果表明：与Dijkstra算法和传统A*算法相比,改进A*算法在保证安全距离的前提下,加快了搜索速度,搜索时间分别平均减少88.5%和63.2%,且在一定程度上缩短了规划路径的长度,路径更加平滑;改进A*算法与DWA融合算法可有效躲避改进A*算法规...     

基于改进Ａ∗＋ＲＤＰ算法的无人艇回坞路径规划方法

针对无人艇（Unmanned Surface Vessel, USV）自动回坞时高效路径规划等任务需求,本文提出了一种基于改进A*算法的无人艇回坞路径规划方法。在传统A*搜索算法基础上增加船艏角度偏差因素和碰撞避免等约束条件,结合拉默-道格拉斯-普克（Ramer-Douglas-Peucker, RDP）算法规划出优化的全局路径。建立航迹最短和推力变化率（Snap）最小的多约束优化模型,推导Snap最优时Bezier曲线构造方法,以满足回坞曲线连续性和运动约束。仿真实验结果表明,相比于传统A*和RRT（Rapidly-exploring Random Tree）算法,本文提出的改进A*+RDP算法规划的路径长度平均缩短了约4%~9%,而且路径规划计算量较低。曲线插值的平滑轨迹满足无人艇的运动学约束,适用于无人艇自动的回坞路径规划任务。     

基于多目标全局约束的任务分配和调度算法

针对嵌入式系统中大多数任务执行算法不考虑目标成本问题,提出了一种基于多目标全局约束的任务分配和调度算法。算法使用约束逻辑编程来对任务执行资源如处理单元、通信设备以及代码和数据存储量的使用进行多目标全局约束。算法假设ROM和RAM分别用于代码存储和数据存储,算法还考虑数据在数据存储器中的位置。实验结果表明,尽管在多个约束条件下,提出的任务分配和调度算法无论在代码存储和数据存储量使用方面,还是在对任务有效求解方面都能取得比普遍采用的贪婪调度算法更好的结果。     

未知环境下基于椭圆约束的机器人路径规划

针对未知环境下机器人路径规划问题,提出一种基于椭圆约束的路径规划方法。借助椭圆约束规划路径,将路径规划问题转化为椭圆参数优化问题。通过建立椭圆约束优化模型,引入障碍物和目标位置的约束,考虑机器人运动步长及运动方向的影响,实现复杂未知环境下机器人路径规划。基于不同算法的仿真实验结果表明,该方法有效解决了未知环境下机器人路径规划问题,在大量障碍物存在的未知环境,也能快速有效地进行无碰撞路径规划。     

基于定向A*算法的多无人机同时集结分步策略

设计一种基于定向A*算法的多无人机同时集结分步策略.首先,提出一种定向A*算法,将无人机最大俯仰角与偏航角作为A*算法搜索约束,从而缩小节点扩展区域,并通过循环寻优规避“死区”点,进而产生平滑可飞的预规划航迹;其次,论述了补偿航程差的变步长多点搜索、三维盘旋机动、虚拟威胁等分步再规划算法,使得多无人机同时集结于目标点附近.仿真结果表明,所提出的算法能够有效完成多无人机同时集结任务.     

月球车路径规划三维仿真平台设计与实现

研究了开发月球车路径规划三维仿真平台遇到的问题。提出了包括月球车三维建模、障碍物提取、路经规划和三维渲染在内地整套建立月球车路径规划三维仿真平台的方案，并使用它来验证行为控制月球车的虚拟主体避障算法。仿真结果表明，此月球车三维仿真平台解决了月球车三维显示和人机交互问题。     

基于自主行为智能体的月球车运动规划与控制

研究基于自主行为智能体的月球车运动规划与控制方法．在基于自主行为智能体的月球车系统结构基础上,首先设计了月球车运动规划与控制的一组基本行为,对其原理进行证明．通过行为状态机对行为进行选择,如果不能保障月球车安全性能,则由运动规划智能体学习其行为参数,并由神经网络记忆．将月球车运动规划与控制分解为行为设计与学习两个过程,使月球车控制系统易于加入先验知识．同时,月球车运动规划能够满足其机动性与地形传送性约束,保证工程开发的结构化与可实现性．该方法不仅具有实时性,而且对未知环境具有较强的适应能力．仿真研究与实验证明了该方法的有效性．     

一个基于结构化特征匹配的月面三维重建方法

基于图像建立三维月面地图对于月球车任务规划、导航控制具有重要意义。本文提出一种基于参数化轮廓结构特征匹配的月面三维重建方法，该方法从月面立体图像中提取特 征物的轮廓特征，通过参数化轮廓特征匹配恢复特征物的三维信息，从而建立三维月面地图。本文以Apollo 15登月计划的着陆区域为例，建立了一个三维月面地图。     

六圆锥轮式月球车运动控制系统的设计研究

六圆锥轮式月球车是一种混合适应型移动机器人车，具有地形适应能力优越，越障能力强的特点。针对该款月球车，本文提出并设计了一套基于TCP/IP通讯，具有一定自主能力的遥操作运动控制系统。遥操作计算机提供月球车路径规划服务，监控月球车运行。基于实时Linux和PC104总线计算机的车载计算机运动控制系统，解析遥操作运动指令，驱动控制月球车运动。运动控制系统在六圆锥轮式月球车样机上调试，模拟现场运行验证了所设计的运动控制系统是可行的。     

行为控制月球车路径规划技术

提出了一种新的路径规划方法即自主行为路径规划方法.该方法能够自动构造大范围 自然环境下与路径规划任务相关的一类拓扑结构,从而大大地提高自然环境下月球车路径规划 速度.该方法在Tangent-Bug切线法基础上引入一组自适应行为来构造切线拓扑图,它是人工 路径规划行为的模仿,克服了计算几何路径规划方法非线性计算时间的不足.文中给出了相关 定义、定理、算法及真实环境下的仿真结果.     

基于立体视觉的月球探测器路径规划算法

以实现月球探测器的避障路径规划为目标,采用立体视觉技术感知车前环境,设计一套基于特征匹配的车前障碍物检测算法。构造极坐标直方图描述环境空间,提出一种基于视觉感知的直方图Bug路径规划算法。通过朝目标移动和沿障碍物边界滑动2种行为的切换来保证算法全局收敛。实景重构与仿真实验验证了算法的有效性。     

Improved Rover State Estimation in Challenging Terrain

Given ambitious mission objectives and long delay times between command-uplink/data-downlink sessions, increased autonomy is required for planetary rovers. Specifically, NASA's planned 2003 and 2005 Mars rover missions must incorporate increased autonomy if their desired mission goals are to be realized. Increased autonomy, including autonomous path planning and navigation to user designated goals, relies on good quality estimates of the rover's state, e.g., its position and orientation relative to some initial reference frame. The challenging terrain over which the rover will necessarily traverse tends to seriously degrade a dead-reckoned state estimate, given severe wheel slip and/or interaction with obstacles. In this paper, we present the implementation of a complete rover navigation system. First, the system is able to adaptively construct semi-sparse terrain maps based on the current ground texture and distances to possible nearby obstacles. Second, the rover is able to match successively constructed terrain maps to obtain a vision-based state estimate which can then be fused with wheel odometry to obtain a much improved state estimate. Finally the rover makes use of this state estimate to perform autonomous real-time path planning and navigation to user designated goals. Reactive obstacle avoidance is also implemented for roaming in an environment in the absence of a user designated goal. The system is demonstrated in soft soil and relatively dense rock fields, achieving state estimates that are significantly improved with respect to dead reckoning alone (e.g., 0.38 m mean absolute error vs. 1.34 m), and successfully navigating in multiple trials to user designated goals.     

Fast approximate clearance evaluation for rovers with articulated suspension systems

We present a light‐weight body‐terrain clearance evaluation algorithm for the automated path planning of NASA's Mars 2020 rover. Extraterrestrial path planning is challenging due to the combination of terrain roughness and severe limitation in computational resources. Path planning on cluttered and/or uneven terrains requires repeated safety checks on all the candidate paths at a small interval. Predicting the future rover state requires simulating the vehicle settling on the terrain, which involves an inverse‐kinematics problem with iterative nonlinear optimization under geometric constraints. However, such expensive computation is intractable for slow spacecraft computers, such as RAD750, which is used by the Curiosity Mars rover and upcoming Mars 2020 rover. We propose the approximate clearance evaluation (ACE) algorithm, which obtains conservative bounds on vehicle clearance, attitude, and suspension angles without iterative computation. It obtains those bounds by estimating the lowest and highest heights that each wheel may reach given the underlying terrain, and calculating the worst‐case vehicle configuration associated with those extreme wheel heights. The bounds are guaranteed to be conservative, hence ensuring vehicle safety during autonomous navigation. ACE is planned to be used as part of the new onboard path planner of the Mars 2020 rover. This paper describes the algorithm in detail and validates our claim of conservatism and fast computation through experiments.     

Navigation with constraints for an autonomous mobile robot

This paper describes a navigation planning algorithm for a robot capable of autonomous navigation in a structured, partially known and dynamic environment. This algorithm is applied to a discrete workspace composed of a network of places and roads. The environment specification associates temporal constraints with any element of the network, and recharge or relocalisation possibilities with places. A mission specification associates several constraints with each navigation task (energy, time, position uncertainty and distance).

The algorithm computes an optimal path for each navigation task according to the optimization criterion and constraints. We introduce the notion of efficient path applied to a new best first search algorithm solving a multiple constraints problem. The path determination relies on a state representation adapted to deal with environment constraints. We then prove that the complexity chracteristics of our algorithm are similar to those of the A* algorithm.

The planner described in this paper has been implemented on a Spare station for a Robuter mobile platform equipped with ultra-sonic range sensors and an active stereo vision system. It was developed for the MITHRA family of autonomous surveillance robots as part of project EUREKA EU 110.     

A new autonomous celestial navigation method for the lunar rover

A secure and autonomous navigation system is needed for the lunar rover in future lunar missions in case of emergencies. Celestial navigation is a very attractive solution for long distance navigation on the Moon without the need of ground navigation aids. It only uses star altitudes, which are measured by a high accuracy star sensor and inertial measurement unit (IMU) to estimate the position of the rover. The navigational accuracy of this method depends largely on the accuracy of measurements, so the measurement errors have a great impact on the navigational performance. A new autonomous celestial navigation method for the lunar rover is presented in this paper, which uses the augmented state unscented particle filter (ASUPF) to deal with the systematic error and random error in the measurements. The validity and feasibility of this new method is tested and examined by the hardware-in-loop test. A position estimation error within 60 m is obtained. Compared to the conventional method, this method shows better navigation performance and higher adaptability to these measurement errors.