scholarly journals Obstacle Avoidance Strategy using Onboard Stereo Vision on a Flapping Wing MAV

2017 ◽  
Vol 33 (4) ◽  
pp. 858-874 ◽  
Author(s):  
Sjoerd Tijmons ◽  
Guido C. H. E. de Croon ◽  
Bart D. W. Remes ◽  
Christophe De Wagter ◽  
Max Mulder
Author(s):  
Sjoerd Tijmons ◽  
Guido de Croon ◽  
Bart Remes ◽  
Christophe De Wagter ◽  
Rick Ruijsink ◽  
...  

Author(s):  
Tasher Ali Sheikh ◽  
Swacheta Dutta ◽  
Smriti Baruah ◽  
Pooja Sharma ◽  
Sahadev Roy

The concept of path planning and collision avoidance are two of the most common theories applied for designing and developing in advanced autonomous robotics applications. NI LabView makes it possible to implement real-time processor for obstacle avoidance. The obstacle avoidance strategy ensures that the robot whenever senses the obstacle stops without being collided and moves freely when path is free, but sometimes there exists a probability that once the path is found free and the robot starts moving, then within a fraction of milliseconds, the robot again sense the obstacle and it stops. This continuous swing of stop and run within a very small period of time may cause heavy burden on the system leading to malfunctioning of the components of the system. This paper deals with overcoming this drawback in a way that even after the robot calculates the path is free then also it will wait for a specific amount of time before running it. So as to confirm that if again the sensor detects the obstacle within that specified period then robot don’t need to transit its state suddenly thus avoiding continuous transition of run and stop. Thus it reduces the heavy burden on the system.


2020 ◽  
Vol 5 (2) ◽  
pp. 3251-3258 ◽  
Author(s):  
Manuel Boldrer ◽  
Marco Andreetto ◽  
Stefano Divan ◽  
Luigi Palopoli ◽  
Daniele Fontanelli

Author(s):  
Jiaxiong Xu ◽  
Baotong Lu ◽  
Ergang Ma ◽  
Ruina Jin ◽  
Xueheng Cui ◽  
...  

2020 ◽  
Vol 17 (3) ◽  
pp. 172988141989897 ◽  
Author(s):  
Shinan Zhu ◽  
Weiyi Zhu ◽  
Xueqin Zhang ◽  
Tao Cao

Path planning of lunar robots is the guarantee that lunar robots can complete tasks safely and accurately. Aiming at the shortest path and the least energy consumption, an adaptive potential field ant colony algorithm suitable for path planning of lunar robot is proposed to solve the problems of slow convergence speed and easy to fall into local optimum of ant colony algorithm. This algorithm combines the artificial potential field method with ant colony algorithm, introduces the inducement heuristic factor, and adjusts the state transition rule of the ant colony algorithm dynamically, so that the algorithm has higher global search ability and faster convergence speed. After getting the planned path, a dynamic obstacle avoidance strategy is designed according to the predictable and unpredictable obstacles. Especially a geometric method based on moving route is used to detect the unpredictable obstacles and realize the avoidance of dynamic obstacles. The experimental results show that the improved adaptive potential field ant colony algorithm has higher global search ability and faster convergence speed. The designed obstacle avoidance strategy can effectively judge whether there will be collision and take obstacle avoidance measures.


2019 ◽  
Vol 50 (3) ◽  
pp. 239-260 ◽  
Author(s):  
V. S. Kalogeiton ◽  
K. Ioannidis ◽  
G. Ch. Sirakoulis ◽  
E. B. Kosmatopoulos

Sign in / Sign up

Export Citation Format

Share Document