Energy Efficient Cubical layered Path Planning Algorithm (EECPPA) for acoustic UWSNs

Author(s):  
Muhammad Aslam ◽  
Fan Wang ◽  
Zefeng Lv ◽  
Muhammad Asad ◽  
Samra Zafar ◽  
...  
2018 ◽  
Vol 161 ◽  
pp. 308-321 ◽  
Author(s):  
Hanlin Niu ◽  
Yu Lu ◽  
Al Savvaris ◽  
Antonios Tsourdos

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Zahoor Ahmad ◽  
Farman Ullah ◽  
Cong Tran ◽  
Sungchang Lee

This paper presents the flight path planning algorithm in a 3-dimensional environment with fixed obstacles for small unmanned aerial vehicles (SUAVs). The emergence of SUAVs for commercial uses with low-altitude flight necessitates efficient flight path planning concerning economical energy consumption. We propose the visibility roadmap based on the visibility graph approach to deal with this uprising problem. The objective is to approximate the collision-free and energy-efficient flight path of SUAVs for flight missions in a considerable time complexity. Stepwise, we describe the construction of the proposed pathfinding algorithm in a convex static obstacle environment. The theoretical analysis and simulation results prove the effectiveness of our method.


2021 ◽  
Vol 11 (15) ◽  
pp. 6939
Author(s):  
Mohamed Saad ◽  
Ahmed I. Salameh ◽  
Saeed Abdallah ◽  
Ali El-Moursy ◽  
Chi-Tsun Cheng

This paper explores the problem of energy-efficient shortest path planning on off-road, natural, real-life terrain for unmanned ground vehicles (UGVs). We present a greedy path planning algorithm based on a composite metric routing approach that combines the energy consumption and distance of the path. In our work, we consider the Terramechanics between the UGV and the terrain soil to account for the wheel sinkage effect, in addition to the terrain slope and soil deformation limitations in the development of the path planning algorithm. As benchmarks for comparison, we use a recent energy-cost minimization approach, in addition to an ant colony optimization (ACO) implementation. Our results indicate that the proposed composite metric routing approach outperforms the state-of-the-art energy-cost minimization method in terms of the resulting path distance, with a negligible increase in energy consumption. Moreover, our results indicate also that the proposed greedy algorithm strongly outperforms the ACO implementation in terms of the quality of the paths obtained and the algorithm running time. In fact, the running time of our proposed algorithm indicates its suitability for large natural terrain graphs with thousands of nodes and tens of thousands of links.


Sign in / Sign up

Export Citation Format

Share Document