Optimal Velocity Planning of Wheeled Mobile Robots on Specific Paths in Static and Dynamic Environments

This paper deals with optimal temporal‐planning of wheeled mobile robots (WMRs) when navigating on predefined spatial paths. A method is proposed to generate a time‐optimal velocity profile for any spatial path in static environments or when mobile obstacles are present. The method generates a feasible trajectory to be tracked by fully exploiting velocity, acceleration and deceleration boundaries of the WMR, and by ensuring the continuity of the velocity and acceleration functions. As an additional benefit for the tracking process the jerk is also bounded. The algorithm is not time consuming, since it mostly uses closed mathematical expressions, nonetheless iteration strategies are presented to solve specific situations. However, such situations are not expected to occur when the spatial paths are planned as smooth curves. The success of the algorithm was tested by experimental and simulation results on the WMR “RAM.” © 2003 Wiley Periodicals, Inc.     

基于Frenet坐标系的自动驾驶轨迹规划与优化算法

针对公路场景下作速度保持的自动驾驶汽车实时轨迹规划问题,提出一种基于Frenet坐标系的优化轨迹规划算法.首先,利用Frenet坐标系将车辆运动解耦,构建无约束横向/纵向独立积分系统;然后,根据初始配置和可内嵌到行为层的目标配置,通过采样生成有限的4次、5次多项式候选轨迹集合;最后,利用以高斯卷积、加速度变化率为核心的安全性和舒适性评价指标构建损失函数,评价轨迹成本,并结合曲率、加速度检查,选择能够最小化损失的最优解.结果表明,该算法能满足公路型场景的规划需求,车辆运动轨迹平滑、舒适、安全性更高.     

多路径段平滑过渡的自适应前瞻位姿插补算法

任务空间多路径段平滑过渡可提高工业机器人的运动速度.在非对称S曲线加减速控制的路径长度约束下,以给定速度不为零的路径衔接点和半径调节参数为基准,根据路径段的长度变化,自适应前瞻规划出路径段间最优衔接速度,并在相邻路径段间采用圆弧进行平滑过渡,路径段全程采用非对称S曲线加减速控制.为提高算法的通用性,根据S曲线加减速区段函数的特点,对加速和减速区段函数进行优化.在6自由度工业机器人实时控制系统平台上进行实验验证,结果表明,与传统加减速控制算法相比,该前瞻算法的作业执行效率可提高22.03%以上,并可实现多路径段间速度的平滑过渡和轨迹的修形.     

A study on a generalized parametric interpolator with real-time jerk-limited acceleration

The impossibility of exact arc length computation for ‘standard’ parametric curves such as Bézier/B-spline curves makes it difficult to generate a feedrate profile with desired accelerations in real-time. This paper presents a new recursive trajectory generation method that estimates an admissible path increment and determines the initiation of the final deceleration stage according to the distance left to travel estimated at every sampling time, resulting in exact feedrate trajectory generation through jerk-limited acceleration profiles for the parametric curves. The proposed approach allows the feedrate profile to be dynamically adjusted according to geometrical path constraints for the curved path. The simulation result has been also provided to illustrate the generation of smooth feedrate profile encompassing a sequence of mixed NC blocks including traditional linear and circular blocks.     

Integration of Path/Maneuver Planning in Complex Environments for Agile Maneuvering UCAVs

In this work, we consider the problem of generating agile maneuver profiles for Unmanned Combat Aerial Vehicles in 3D Complex environments. This problem is complicated by the fact that, generation of the dynamically and geometrically feasible flight trajectories for agile maneuver profiles requires search of nonlinear state space of the aircraft dynamics. This work suggests a two layer feasible trajectory/maneuver generation system. Integrated Path planning (considers geometrical, velocity and acceleration constraints) and maneuver generation (considers saturation envelope and attitude continuity constraints) system enables each layer to solve its own reduced order dimensional feasibility problem, thus simplifies the problem and improves the real time implement ability. In Trajectory Planning layer, to solve the time depended path planning problem of an unmanned combat aerial vehicles, we suggest a two step planner. In the first step, the planner explores the environment through a randomized reachability tree search using an approximate line segment model. The resulting connecting path is converted into flight way points through a line-of-sight segmentation. In the second step, every consecutive way points are connected with B-Spline curves and these curves are repaired probabilistically to obtain a geometrically and dynamically feasible path. This generated feasible path is turned in to time depended trajectory with using time scale factor considering the velocity and acceleration limits of the aircraft. Maneuver planning layer is constructed upon multi modal control framework, where the flight trajectories are decomposed to sequences of maneuver modes and associated parameters. Maneuver generation algorithm, makes use of mode transition rules and agility metric graphs to derive feasible maneuver parameters for each mode and overall sequence. Resulting integrated system; tested on simulations for 3D complex environments, gives satisfactory results and promises successful real time implementation.     

Trajectory planning and yaw rate tracking control for lane changing of intelligent vehicle on curved road

The lateral control for lane changing of intelligent vehicle on curved road in automatic highway systems was studied. Based on trapezoidal acceleration profile, considering the curvature difference between starting lane and target lane, a new virtual trajectory planning method for lane changing on curved road was presented, and the calculating formulas for ideal states of vehicle in the inertial coordinate system during a lane changing maneuver were established. Applying the predetermined trajectory, the re...     

Path planning of wheeled mobile robot with simultaneous free space locating capability

This paper presents a hybrid path planning algorithm for the design of autonomous vehicles such as mobile robots. The hybrid planner is based on Potential Field method and Voronoi Diagram approach and is represented with the ability of concurrent navigation and map building. The system controller (Look-ahead Control) with the Potential Field method guarantees the robot generate a smooth and safe path to an expected position. The Voronoi Diagram approach is adopted for the purpose of helping the mobile robot to avoid being trapped by concave environment while exploring a route to a target. This approach allows the mobile robot to accomplish an autonomous navigation task with only an essential exploration between a start and goal position. Based on the existing topological map the mobile robot is able to construct sub-goals between predefined start and goal, and follows a smooth and safe trajectory in a flexible manner when stationary and moving obstacles co-exist.     

Parametric-based path generation for automated vehicles at roundabouts

Urban environments are becoming more and more complex because several factors as consecutive crossroads or lanes changes. These scenarios demand specific infrastructures—i.e. roundabouts, for improving traffic flow compared with traditional intersections. A roundabout removes timeouts associated with traffic lights at crossroads and trajectory conflicts among drivers. However, it is a challenging scenario for both humans and automated vehicles. This work presents a path planning method for automated vehicle driving at roundabouts. The proposed system achieves a G¹ continuous path, minimizing curvature steps to increase smoothness, dividing the driving process in three stages: entrance maneuver, driving within the roundabout and exit maneuver. Parametric equations are generated to deal with automated roundabout driving. This approach allows a real time planning considering two-lane roundabouts, taking different exits. Tests in simulated environments and on our prototype platform—Cybercar—validate the system on real urban environments, showing the proper behavior of the system.     

挠性卫星姿态机动三段式轨迹规划与滚动跟踪控制

以新颖成像模式对挠性敏捷卫星姿态的快速机动控制为需求,本文针对金字塔构型控制力矩陀螺(CMG)群为执行机构的挠性卫星,提出基于三段式正弦角加速度的姿态路径规划方法及具有滚动优化思想的跟踪算法。在姿态路径规划方法设计中,融合谱分析及非线性优化方法,设计了兼顾卫星姿态机动快速性及抑制挠性附件振动性能的姿态轨迹;为实现对规划姿态轨迹的高精度跟踪,综合加权优化指标及奇异性、执行机构能力等约束,设计了金字塔构型CMG群框架角速度的非线性模型预测(NMPC)跟踪控制律。在转动惯量存在测量误差及空间干扰情况下,多种姿态机动仿真表明,本文提出的控制方法是有效的,且表现出较强的鲁棒性。     

Lateral acceleration potential field function control for rollover safety of multi-wheel military vehicle with in-wheel-motors

This article proposes an automatic longitudinal deceleration based method for multi-wheel vehicle rollover safety in autonomous mode. The information of lateral acceleration and vehicle roll angle is used to generate the longitudinal acceleration at which the vehicle will remain stable to rollover. The lateral and roll dynamics are coupled with longitudinal dynamics using a potential field function for lateral acceleration. This virtual potential field is developed on g-g diagram which represents vehicle portrait of lateral and longitudinal acceleration on abscissa and ordinate respectively. The motion of vehicle is represented by a point moving on this phase portrait of g-g diagram. TruckSim model of multi-wheel military vehicle with in-wheel motors is used with this algorithm which shows that the vehicle is less susceptible to rollover. The safe longitudinal acceleration is achieved by torque control of in-wheel motors fitted in each wheel. Using this method, the vehicle followed the desired trajectory as higher speeds which are safe. This is particularly useful for vehicle autonomous driving with rollover stability.

     

On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles

This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial vehicles with holonomic constraints in environments with obstacles. Our approach uses Pythagorean Hodograph (PH) curves to connect vertices of the tree, which makes it possible to generate paths for which the main kinematic constraints of the vehicle are not violated. These paths are converted into trajectories based on feasible speed profiles of the robot. The smoothness of the acceleration profile of the vehicle is indirectly guaranteed between two vertices of the RRT tree. The proposed algorithm provides fast convergence to the final trajectory. We still utilize the properties of the RRT to avoid collisions with static, environment bound obstacles and dynamic obstacles, such as other vehicles in the multi-vehicle planning scenario. We show results for a set of small unmanned aerial vehicles in environments with different configurations.     

国产MCT8000运动控制器的轨迹规划系统

高速度、高精度、主同效率和高可靠性是现代数控高性能化的四项关键指标。针对国产MCT8000运动控制卡开发了一种集加减速控制、快速插补运算于一体的轨迹规划系统。本文介绍了该系统运动轨迹规划方案和实现方法,并提供了这种方案的应用实例。     

基于MCPDDPG的智能车辆路径规划方法及应用

针对智能车路径规划过程中常存在动态环境感知预估不足的问题,使用基于蒙特卡罗深度策略梯度学习(Monte Carlo prediction deep deterministic policy gradient, MCPDDPG)的智能车辆路径规划方法,设计一种基于环境感知预测、行为决策和控制序列生成的框架,实现实时的决策和规划,并输出连续的车辆控制序列.首先,利用序贯蒙特卡罗预估他车行为状态量;然后,设计基于强化Q学习的行为决策方法,使智能车辆实时预知碰撞风险,采取合理的规避策略;最后,构建深度策略梯度学习网络框架,获取智能车辆规划路径的最优轨迹序列.实验结果表明,所提方法能够缓解环境感知的预估不足问题,提升智能车辆行为决策的快速性,保障路径规划的主动安全,并输出连续的轨迹序列,为智能车辆导航控制提供前提.     

A look-ahead command generator with control over trajectory and chord error for NURBS curve with unknown arc length

There are currently no analytical methods available which determine the exact arc length for NURBS curves and for this reason, a smooth feedrate profile with desired trajectory cannot be achieved. Numerical methods used to calculate the arc length are time-consuming processes which make generating a feedrate profile with desired accelerations difficult in real-time. This paper introduces a look-ahead trajectory generation method which determines the deceleration stage according to the fast estimated arc length and the reverse interpolation of each curve at every sampling time. This results in a feedrate trajectory generation with jerk-limited acceleration profiles for the NURBS curves. The feedrate profile is adjusted dynamically according to the geometrical path constraint determined by chord error for the curved path. A NURBS curve by two different kinematics conditions was used as a means to test the feasibility of the developed interpolation scheme and command generator.     

基于改进RRT^(*)与行驶轨迹优化的智能汽车运动规划EI北大核心CSCD

针对传统快速扩展随机树算法(Rapidly-exploring random tree,RRT)搜索较慢、规划路径曲折、平顺性差等问题,提出了一种结合改进RRT^(*)与贝塞尔曲线控制点优化的智能车辆运动规划方法.该方法通过在给定概率分布下采样,结合基于方向相似性的多步扩展与路径简化,使用贝塞尔曲线拟合生成规划问题初始解,最后使用序列二次规划优化曲线控制点,从而在动态障碍物环境中生成兼具安全性与驾驶舒适性的车辆行驶轨迹.在仿真实验中将本文算法与常规RRT及曲线拟合方法进行了比较,结果显示本文算法在搜索速度、平顺性、安全性等方面有较大提升.     

Optimal Multi-Criteria Waypoint Selection for Autonomous Vehicle Navigation in Structured Environment

This paper deals with autonomous navigation of unmanned ground vehicles (UGV). The UGV has to reach its assigned final configuration in a structured environments (e.g. a warehouse or an urban environment), and to avoid colliding neither with the route boundaries nor any obstructing obstacles. In this paper, vehicle planning/set-points definition is addressed. A new efficient and flexible methodology for vehicle navigation throughout optimal and discrete selected waypoints is proposed. Combining multi-criteria optimization and expanding tree allows safe, smooth and fast vehicle overall navigation. This navigation through way-points permits to avoid any path/trajectory planning which could be time consuming and complex, mainly in cluttered and dynamic environment. To evaluate the flexibility and the efficiency of the proposed methodology based on expanding tree (taking into account the vehicle model and uncertainties), an important part of this paper is dedicated to give an accurate comparison with another proposed optimization based on the commonly used grid map. A set of simulations, comparison with other methods and experiments, using an urban electric vehicle, are presented and demonstrate the reliability of our proposals.     

On the effective tool path planning algorithms for sculptured surface manufacture

This paper describes the cutter path planning and cutter interference (gouging) analysis algorithms developed to generate optimal tool path for manufacturing sculptured surfaces on three axes CNC machine tools. Cutter path planning algorithm approximates the parametric curves on three dimensional surfaces by a sequence of straight line segments and generates optimal tool paths by minimizing the number of interpolation points while keeping the path deviations within the specified tolerances. Cutter interference analysis algorithm checks for the self intersection of an offset surface and determines the self-intersection curve. The tool path is then planned over the cutter contact (CC) surface after removing the CC data that lies inside the self-intersection curve. Finally, the effectiveness of these algorithms is demonstrated by implementing them in CAD/CAM system.     

帝国竞争算法在无人机三维航线规划中的应用研究

针对实际飞行环境中无人机的三维航线规划问题,提出了一种创新启发式优化算法——牛顿帝国主义竞争算法(NICA,Newtonian imperialist competitive algorithm).该算法能够根据无人机的飞行轨迹,从起始位置到任务目标位置生成平滑的航线路径,约束航线规划,使得目标完成任务的时间最小化.该算法也能为无人机在真实地形上的航线提供最佳轨迹路径.最后通过与ICA、GA和PSO算法进行比较,验证了改进算法的有效性.结果表明:改进帝国算法提高了全局最优解的搜索能力,在收敛速度和精度上优于其他3种算法,适合用来解决无人机的三维航线规划问题.     

基于稀疏A*搜索和改进人工势场的无人机动态航迹规划

针对不同属性的障碍物所构成的威胁分布模型, 本文提出了一种基于稀疏A*搜索算法预规划和改进人工势场相结合的无人机动态避障算法. 该算法首先对威胁分布建立栅格化模型; 然后根据静态威胁, 基于稀疏A*搜索算法进行全局航迹规划; 最后结合预规划路径和动态威胁分布, 利用改进人工势场法完成无人机的动态避障. 仿真结果表明, 该方法能够规划出给定威胁指标下的全局最优路径并达到良好的动态规避性能.     

An online collision-free trajectory generation algorithm for human–robot collaboration

The premise of human–robot collaboration is that robots have adaptive trajectory planning strategies in hybrid work cell. The aim of this paper is to propose a new online collision avoidance trajectory planning algorithm for moderate dynamic environments to insure human safety when sharing collaborative tasks. The algorithm contains two parts: trajectory generation and local optimization. Firstly, based on empirical Dirichlet Process Gaussian Mixture Model (DPGMM) distribution learning, a neural network trajectory planner called Collaborative Waypoint Planning network (CWP-net) is proposed to generate all key waypoints required for dynamic obstacle avoidance in joint space according to environmental inputs. These points are used to generate quintic spline smooth motion trajectories with velocity and acceleration constraints. Secondly, we present an improved Stochastic Trajectory Optimization for Motion Planning (STOMP) algorithm which locally optimizes the generated trajectories of CWP-net by constraining the trajectory optimization range and direction through the DPGMM model. Simulations and real experiments from an industrial use case of human–robot collaboration in the field of aircraft assembly testing show that the proposed algorithm can smoothly adjust the nominal path online and effectively avoid collisions during the collaboration.