scholarly journals An energy-efficient parallel algorithm for real-time near-optimal UAV path planning

Author(s):  
Daniele Palossi ◽  
Michele Furci ◽  
Roberto Naldi ◽  
Andrea Marongiu ◽  
Lorenzo Marconi ◽  
...  
Author(s):  
Amir Sadrpour ◽  
Jionghua (Judy) Jin ◽  
A. Galip Ulsoy

Surveillance missions that involve unmanned ground vehicles (UGVs) include situations where a UGV has to choose between alternative paths to complete its mission. Currently, UGV missions are often limited by the available on-board energy. Thus, we propose a dynamic most energy-efficient path planning algorithm that integrates mission prior knowledge with real-time sensory information to identify the mission’s most energy-efficient path. Our proposed approach predicts and updates the distribution of energy requirement of alternative paths using recursive Bayesian estimation through two stages: (1) exploration — road segments are explored to reduce their energy prediction uncertainty; (2) exploitation — the most energy-efficient path is selected using the collected information in the exploration stage and is traversed. Our simulation results show that the proposed approach outperforms offline methods, as well as a method that only relies on exploitation to identify the most energy-efficient path.


Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 642
Author(s):  
Luis Miguel González de Santos ◽  
Ernesto Frías Nores ◽  
Joaquín Martínez Sánchez ◽  
Higinio González Jorge

Nowadays, unmanned aerial vehicles (UAVs) are extensively used for multiple purposes, such as infrastructure inspections or surveillance. This paper presents a real-time path planning algorithm in indoor environments designed to perform contact inspection tasks using UAVs. The only input used by this algorithm is the point cloud of the building where the UAV is going to navigate. The algorithm is divided into two main parts. The first one is the pre-processing algorithm that processes the point cloud, segmenting it into rooms and discretizing each room. The second part is the path planning algorithm that has to be executed in real time. In this way, all the computational load is in the first step, which is pre-processed, making the path calculation algorithm faster. The method has been tested in different buildings, measuring the execution time for different paths calculations. As can be seen in the results section, the developed algorithm is able to calculate a new path in 8–9 milliseconds. The developed algorithm fulfils the execution time restrictions, and it has proven to be reliable for route calculation.


Author(s):  
Zeinab Askari ◽  
Jamshid Abouei ◽  
Muhammad Jaseemuddin ◽  
Alagan Anpalagan
Keyword(s):  

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Mohammed Baziyad ◽  
Mohamed Saad ◽  
Raouf Fareh ◽  
Tamer Rabie ◽  
Ibrahim Kamel

Sign in / Sign up

Export Citation Format

Share Document