Real-Time Kinematic Control for Redundant Manipulators in a Time-Varying Environment: Multiple-Dynamic Obstacle Avoidance and Fast Tracking of a Moving Object

2020 ◽  
Vol 16 (1) ◽  
pp. 28-41 ◽  
Author(s):  
Hui Zhang ◽  
Hongzhe Jin ◽  
Zhangxing Liu ◽  
Yubin Liu ◽  
Yanhe Zhu ◽  
...  
2006 ◽  
Vol 22 (6) ◽  
pp. 399-414 ◽  
Author(s):  
Pascal Glardon ◽  
Ronan Boulic ◽  
Daniel Thalmann

2017 ◽  
Vol 2 (3) ◽  
pp. 1696-1703 ◽  
Author(s):  
Tobias Nageli ◽  
Javier Alonso-Mora ◽  
Alexander Domahidi ◽  
Daniela Rus ◽  
Otmar Hilliges

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Chuanhu Niu ◽  
Aijuan Li ◽  
Xin Huang ◽  
Wei Li ◽  
Chuanyan Xu

Aiming at the optimal path and planning efficiency of global path planning for intelligent driving, this paper proposes a global dynamic path planning method based on improved A ∗ algorithm. First, this method improves the heuristic function of the traditional A ∗ algorithm to improve the efficiency of global path planning. Second, this method uses a path optimization strategy to make the global path smoother. Third, this method is combined with the dynamic window method to improve the real-time performance of the dynamic obstacle avoidance of the intelligent vehicle. Finally, the global dynamic path planning method of the proposed improved A ∗ algorithm is verified through simulation experiments and real vehicle tests. In the simulation analysis, compared with the modified A ∗ algorithm and the traditional A ∗ algorithm, the method in this paper shortens the path distance by 2.5%∼3.0%, increases the efficiency by 10.3%∼13.6% and generates a smoother path. In the actual vehicle test, the vehicle can avoid dynamic obstacles in real time. Therefore, the method proposed in this paper can be applied on the intelligent vehicle platform. The path planning efficiency is high, and the dynamic obstacle avoidance is good in real time.


Author(s):  
Sam Weckx ◽  
Bastiaan Vandewal ◽  
Erwin Rademakers ◽  
Karel Janssen ◽  
Kurt Geebelen ◽  
...  

1991 ◽  
Vol 10 (3) ◽  
pp. 228-239 ◽  
Author(s):  
Boris Aronov ◽  
Steven Fortune ◽  
Gordon Wilfong

We consider the problem of determining how fast an object must be capable of moving for it to be able to reach a given position at a given time while avoiding moving obstacles. The problem is to plan velocity profile along a given path so that collisions with moving obstacles crossing the path are avoided and the maximum velocity along the path is mini mized. Suppose the time-varying environment is fully speci fied, both in space and in time, by n linear constraints. An algorithm is presented that, given a full description of the environment and the initial configuration of the system (that is, initial position and starting time of the object), answers in O(log n) time queries of the form : "What is the lowest speed limit that the object can obey while still being able to reach the query configuration from the initial configuration without colliding with the obstacles?" The algorithm can also be used to compute a motion from the initial configuration to the query configuration that obeys the speed limit in O (n ) time. The algorithm requires O (n log n) preprocessing time and O (n) space.


Sign in / Sign up

Export Citation Format

Share Document