Online collision avoidance trajectory planning for spacecraft proximity operations with uncertain obstacle

2021 ◽  
pp. 095441002110561
Author(s):  
Run-de Zhang ◽  
Wei-wei Cai ◽  
Le-ping Yang ◽  
Cheng Si
Keyword(s):  
Collision Avoidance ◽  
Predictive Control ◽  
Trajectory Planning ◽  
Three Dimensional ◽  
Performance Criteria ◽  
Proximity Operations ◽  
Online Planning ◽  
Planning Framework ◽  
Planning Methods ◽  
Avoidance Problem

The spacecraft relative motion trajectory planning is one of the enabling techniques for autonomous proximity operations, especially in the increasingly complicated mission environments. Most traditional trajectory planning methods focus on improving the performance criteria in the deterministic conditions, whereas various uncertain elements in practice would significantly degrade the trajectory performance. Considering the uncertainties underlying the collision avoidance constraints, this paper suggests a model predictive control based online trajectory planning framework in which the obstacle information in higher-precision would be consistently updated by the onboard sensor. To improve the computational efficiency of the online planning framework, the rotating hyperplane (RH) technique is utilized to transform the nonlinear ellipsoidal keep-out zone constraints into convex formulations. And the concept of rotation window is introduced to eliminate the unexpected mismatch between the spacecraft motion and hyperplane rotation in the conventional RH method, which in sequence improves the RH method’s capability for multiple obstacle avoidance problem. Moreover, a three-dimensional (3-D) extension strategy is proposed to simplify the computation procedure when applying the RH method for a 3-D collision avoidance problem. Numerical simulations are carried out to validate the performance of the proposed online trajectory planning framework in addressing the uncertain collision avoidance constraints.

Optimized artificial potential field algorithm to multi-unmanned aerial vehicle coordinated trajectory planning and collision avoidance in three-dimensional environment

2019 ◽  
Vol 233 (16) ◽  
pp. 6032-6043 ◽  
Author(s):  
Jun Tang ◽  
Jiayi Sun ◽  
Cong Lu ◽  
Songyang Lao
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Collision Avoidance ◽  
Unmanned Aerial Vehicle ◽  
Trajectory Planning ◽  
Potential Field ◽  
Three Dimensional ◽  
Artificial Potential Field ◽  
Aerial Vehicles ◽  
Aerial Vehicle ◽  
Vehicle Trajectory

Multi-unmanned aerial vehicle trajectory planning is one of the most complex global optimum problems in multi-unmanned aerial vehicle coordinated control. Results of recent research works on trajectory planning reveal persisting theoretical and practical problems. To mitigate them, this paper proposes a novel optimized artificial potential field algorithm for multi-unmanned aerial vehicle operations in a three-dimensional dynamic space. For all purposes, this study considers the unmanned aerial vehicles and obstacles as spheres and cylinders with negative electricity, respectively, while the targets are considered spheres with positive electricity. However, the conventional artificial potential field algorithm is restricted to a single unmanned aerial vehicle trajectory planning in two-dimensional space and usually fails to ensure collision avoidance. To deal with this challenge, we propose a method with a distance factor and jump strategy to resolve common problems such as unreachable targets and ensure that the unmanned aerial vehicle does not collide into the obstacles. The method takes companion unmanned aerial vehicles as the dynamic obstacles to realize collaborative trajectory planning. Besides, the method solves jitter problems using the dynamic step adjustment method and climb strategy. It is validated in quantitative test simulation models and reasonable results are generated for a three-dimensional simulated urban environment.

scholarly journals HMCTS-OP: Hierarchical MCTS Based Online Planning in the Asymmetric Adversarial Environment

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 719
Author(s):  
Lina Lu ◽  
Wanpeng Zhang ◽  
Xueqiang Gu ◽  
Xiang Ji ◽  
Jing Chen
Keyword(s):  
Computational Complexity ◽  
State Space ◽  
Planning Horizon ◽  
Search Space ◽  
Monte Carlo Tree Search ◽  
Practical Applications ◽  
Online Planning ◽  
Planning Framework ◽  
Planning Methods ◽  
Planning Problems

The Monte Carlo Tree Search (MCTS) has demonstrated excellent performance in solving many planning problems. However, the state space and the branching factors are huge, and the planning horizon is long in many practical applications, especially in the adversarial environment. It is computationally expensive to cover a sufficient number of rewarded states that are far away from the root in the flat non-hierarchical MCTS. Therefore, the flat non-hierarchical MCTS is inefficient for dealing with planning problems with a long planning horizon, huge state space, and branching factors. In this work, we propose a novel hierarchical MCTS-based online planning method named the HMCTS-OP to tackle this issue. The HMCTS-OP integrates the MAXQ-based task hierarchies and the hierarchical MCTS algorithms into the online planning framework. Specifically, the MAXQ-based task hierarchies reduce the search space and guide the search process. Therefore, the computational complexity is significantly reduced. Moreover, the reduction in the computational complexity enables the MCTS to perform a deeper search to find better action in a limited time. We evaluate the performance of the HMCTS-OP in the domain of online planning in the asymmetric adversarial environment. The experiment results show that the HMCTS-OP outperforms other online planning methods in this domain.

Collision avoidance for mobile robots based on artificial potential field and obstacle envelope modelling

2016 ◽  
Vol 36 (3) ◽  
pp. 318-332 ◽  
Author(s):  
Zhenyu Wu ◽  
Guang Hu ◽  
Lin Feng ◽  
Jiping Wu ◽  
Shenglan Liu
Keyword(s):  
Mobile Robot ◽  
Collision Avoidance ◽  
Potential Field ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Artificial Potential Field ◽  
Content Type ◽  
Negative Pole ◽  
Avoidance Problem ◽  
Three Dimensional Space

Purpose This paper aims to investigate the collision avoidance problem for a mobile robot by constructing an artificial potential field (APF) based on geometrically modelling the obstacles with a new method named the obstacle envelope modelling (OEM). Design/methodology/approach The obstacles of arbitrary shapes are enveloped in OEM using the primitive, which is an ellipse in a two-dimensional plane or an ellipsoid in a three-dimensional space. As the surface details of obstacles are neglected elegantly in OEM, the workspace of a mobile robot is made simpler so as to increase the capability of APF in a clustered environment. Findings Further, a dipole is applied to the construction of APF produced by each obstacle, among which the positive pole pushes the robot away and the negative pole pulls the robot close. Originality/value As a whole, the dipole leads the robot to make a derivation around the obstacle smoothly, which greatly reduces the local minima and trajectory oscillations. Computer simulations are conducted to demonstrate the effectiveness of the proposed approach.

scholarly journals Point-to-Point Collision-Free Trajectory Planning for Mobile Manipulators

2016 ◽  
Vol 85 (3-4) ◽  
pp. 523-538 ◽  
Author(s):  
Grzegorz Pajak ◽  
Iwona Pajak
Keyword(s):  
Collision Avoidance ◽  
Trajectory Planning ◽  
Three Dimensional ◽  
Nonholonomic Constraints ◽  
Inequality Constraints ◽  
Mobile Manipulator ◽  
Local Perturbation ◽  
Mobile Manipulators ◽  
State Variables ◽  
Mechanical Constraints

AbstractThe collision-free trajectory planning method subject to control constraints for mobile manipulators is presented. The robot task is to move from the current configuration to a given final position in the workspace. The motions are planned in order to maximise an instantaneous manipulability measure to avoid manipulator singularities. Inequality constraints on state variables i.e. collision avoidance conditions and mechanical constraints are taken into consideration. The collision avoidance is accomplished by local perturbation of the mobile manipulator motion in the obstacles neighbourhood. The fulfilment of mechanical constraints is ensured by using a penalty function approach. The proposed method guarantees satisfying control limitations resulting from capabilities of robot actuators by applying the trajectory scaling approach. Nonholonomic constraints in a Pfaffian form are explicitly incorporated into the control algorithm. A computer example involving a mobile manipulator consisting of nonholonomic platform (2,0) class and 3DOF RPR type holonomic manipulator operating in a three-dimensional task space is also presented.

scholarly journals Analysis of Obstacle Avoidance Strategy for Dual-Arm Robot Based on Speed Field with Improved Artificial Potential Field Algorithm

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1850
Author(s):  
Hui Zhang ◽  
Yongfei Zhu ◽  
Xuefei Liu ◽  
Xiangrong Xu
Keyword(s):  
Path Planning ◽  
Collision Avoidance ◽  
Obstacle Avoidance ◽  
Potential Field ◽  
Artificial Potential Field ◽  
Planning Methods ◽  
Avoidance Strategy ◽  
Dual Arm Robot ◽  
Dual Arm ◽  
Avoidance Problem

In recent years, dual-arm robots have been favored in various industries due to their excellent coordinated operability. One of the focused areas of study on dual-arm robots is obstacle avoidance, namely path planning. Among the existing path planning methods, the artificial potential field (APF) algorithm is widely applied in obstacle avoidance for its simplicity, practicability, and good real-time performance over other planning methods. However, APF is firstly proposed to solve the obstacle avoidance problem of mobile robot in plane, and thus has some limitations such as being prone to fall into local minimum, not being applicable when dynamic obstacles are encountered. Therefore, an obstacle avoidance strategy for a dual-arm robot based on speed field with improved artificial potential field algorithm is proposed. In our method, the APF algorithm is used to establish the attraction and repulsion functions of the robotic manipulator, and then the concepts of attraction and repulsion speed are introduced. The attraction and repulsion functions are converted into the attraction and repulsion speed functions, which mapped to the joint space. By using the Jacobian matrix and its inverse to establish the differential velocity function of joint motion, as well as comparing it with the set collision distance threshold between two robotic manipulators of robot, the collision avoidance can be solved. Meanwhile, after introducing a new repulsion function and adding virtual constraint points to eliminate existing limitations, APF is also improved. The correctness and effectiveness of the proposed method in the self-collision avoidance problem of a dual-arm robot are validated in MATLAB and Adams simulation environment.

Trajectory planning for coordinately operating robots

1990 ◽  
Vol 4 (3) ◽  
pp. 165-177 ◽  
Author(s):  
Y. P. Chien ◽  
Qing Xue
Keyword(s):  
Trajectory Planning ◽  
Three Dimensional ◽  
Initial Position ◽  
Minimum Time ◽  
Future Research ◽  
Rigid Object ◽  
Redundant Robots ◽  
Planning Algorithm ◽  
The Common ◽  
Joint Velocity

An efficient locally minimum-time trajectory planning algorithm for coordinately operating multiple robots is introduced. The task of the robots is to carry a common rigid object from an initial position to a final position along a given path in three-dimensional workspace in minimum time. The number of robots in the system is arbitrary. In the proposed algorithm, the desired motion of the common object carried by the robots is used as the key to planning of the trajectories of all the non-redundant robots involved. The search method is used in the trajectory planning. The planned robot trajectories satisfy the joint velocity, acceleration and torque constraints as well as the path constraints. The other constraints such as collision-free constraints, can be easily incorporated into the trajectory planning in future research.

Sign in / Sign up

Export Citation Format

Share Document