Motion planning with dynamic constraints for manipulators in the presence of moving obstacles

Author(s):  
Yun-Hui Liu
Author(s):  
Xiaoyuan Zhu ◽  
Jian Chen ◽  
Yan Ma ◽  
Jianqiang Deng ◽  
Yuexuan Wang

Abstract In this paper, we propose an MPC-based motion planning algorithm, including a decision-making module, an obstacle-constraints generating module, and an MPC-based planning module. The designed decision module effectively distinguishes between structured and unstructured roads and processes them separately, so that the algorithm is more robust in different environments. Besides, the movement of obstacles is considered in the decision-making and obstacle constraints generating module. By processing obstacles with lateral and longitudinal speed separately, obstacle avoidance can be done in scenarios with moving obstacles, including moving obstacles crossing the road. Instead of treating the vehicle as a mass point, we explicitly consider the geometric constraints by modeling the vehicle as three intersecting circles when generating obstacle constraints. This ensures that the vehicle is collision-free in motion planning, especially when the vehicle turns. For non-convex obstacle constraints, we propose an algorithm that generates up to two alternative linear constraints to convexify the obstacle constraints for improving computational efficiency. In MPC, we consider the vehicle kino-dynamic constraints and two generated linear constraints. Therefore, the proposed method can achieve better real-time performance and can be applied to more complicated traffic scenarios with moving obstacles. Simulation results in three different scenarios show that motion planning can achieve satisfactory performance in both structured and unstructured roads with moving obstacles.


2019 ◽  
Vol 13 (04) ◽  
pp. 541-563
Author(s):  
Ali Demir ◽  
Volkan Sezer

In this study, a unified motion planner with low level controller for continuous control of a differential drive mobile robot under variable payload values is presented. The deep reinforcement agent takes 11-dimensional state vector as input and calculates each wheel’s torque value as a 2-dimensional output vector. These torque values are fed into the dynamic model of the robot, and lastly steering commands are gathered. In previous studies, intersection navigation solutions that uses deep-RL methods, have not been considered with variable payloads. This study is focused specifically on service robotic applications where payload is subject to change. In this study, deep-RL-based motion planning is performed by considering both kinematic and dynamic constraints. According to the simulations in a dynamic environment, the agent successfully navigates to target with 98.2% success rate in test time with unseen payload masses during training. Another agent is also trained without payload randomization for comparison. Results show that our agent outperforms the other agent, that is not aware of its own payload, with more than 40% gap. Our agent is also compared with the Time-to-Collision (TTC) algorithm. It is observed that our agent uses far less time than TTC to accomplish the mission while success rates of two methods are same. Lastly, the proposed method is applied on a real robot in order to show the real-time applicability of the approach.


2018 ◽  
Vol 30 (3) ◽  
pp. 485-492
Author(s):  
Satoshi Hoshino ◽  
◽  
Tomoki Yoshikawa

Motion planning of mobile robots for occluded obstacles is a challenge in dynamic environments. The occlusion problem states that if an obstacle suddenly appears from the occluded area, the robot might collide with the obstacle. To overcome this, we propose a novel motion planner, the Velocity Obstacle for occlusion (VOO). The VOO is based on a previous motion planner, the Velocity Obstacle (VO), which is effective for moving obstacles. In the proposed motion planner, information uncertainties about occluded obstacles, such as position, velocity, and moving direction, are quantitatively addressed. Thus, the robot based on the VOO is able to move not only among observed obstacles, but also among the occluded ones. Through simulation experiments, the effectiveness of the VOO for the occlusion problem is demonstrated by comparison with the VO.


2002 ◽  
Vol 21 (3) ◽  
pp. 233-255 ◽  
Author(s):  
David Hsu ◽  
Robert Kindel ◽  
Jean-Claude Latombe ◽  
Stephen Rock

2018 ◽  
Vol 10 (3) ◽  
Author(s):  
Audelia G. Dharmawan ◽  
Shaohui Foong ◽  
Gim Song Soh

Real-time motion planning of robots in a dynamic environment requires a continuous evaluation of the determined trajectory so as to avoid moving obstacles. This is even more challenging when the robot also needs to perform a task optimally while avoiding the obstacles due to the limited time available for generating a new collision-free path. In this paper, we propose the sequential expanded Lagrangian homotopy (SELH) approach, which is capable of determining the globally optimal robot's motion sequentially while satisfying the task constraints. Through numerical simulations, we demonstrate the capabilities of the approach by planning an optimal motion of a redundant mobile manipulator performing a complex trajectory. Comparison against existing optimal motion planning approaches, such as genetic algorithm (GA) and neural network (NN), shows that SELH is able to perform the planning at a faster rate. The considerably short computational time opens up an opportunity to apply this method in real time; and since the robot's motion is planned sequentially, it can also be adjusted to accommodate for dynamically changing constraints such as moving obstacles.


Author(s):  
Mostafa Mahmoodi ◽  
Khalil Alipour ◽  
Hadi Beik Mohammadi

Purpose – The purpose of this paper is to propose an efficient method, called kinodynamic velocity obstacle (KidVO), for motion planning of omnimobile robots considering kinematic and dynamic constraints (KDCs). Design/methodology/approach – The suggested method improves generalized velocity obstacle (GVO) approach by a systematic selection of proper time horizon. Selection procedure of the time horizon is based on kinematical and dynamical restrictions of the robot. Toward this aim, an omnimobile robot with a general geometry is taken into account, and the admissible velocity and acceleration cones reflecting KDCs are derived, respectively. To prove the advantages of the suggested planning method, its performance is compared with GVOs, the so-called Hamilton-Jacobi-Bellman equation and the rapidly exploring random tree. Findings – The obtained results of the presented scenarios which contain both computer and real-world experiments for complicated crowded environments indicate the merits of the suggested methodology in terms of its near-optimal behavior, successful obstacle avoidance both in static and dynamic environments and reaching to the goal pose. Originality/value – This paper proposes a novel method for online motion planning of omnimobile robots in dynamic environments while considering the real capabilities of the robot.


Sign in / Sign up

Export Citation Format

Share Document