MbrlCatalogueTitleDetail

Do you wish to reserve the book?
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles
Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles
Journal Article

Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles

2024
Request Book From Autostore and Choose the Collection Method
Overview
The autonomous task success of an unmanned aerial vehiclel (UAV) or its military specialization called the unmanned combat aerial vehicle (UCAV) has a direct relationship with the planned path. However, planning a path for a UAV or UCAV system requires solving a challenging problem optimally by considering the different objectives about the enemy threats protecting the battlefield, fuel consumption or battery usage and kinematic constraints on the turning maneuvers. Because of the increasing demands to the UAV systems and game-changing roles played by them, developing new and versatile path planning algorithms become more critical and urgent. In this study, a greedy algorithm named as the Back-and-Forth (BaF) was designed and introduced for solving the path planning problem. The BaF algorithm gets its name from the main strategy where a heuristic approach is responsible to generate two predecessor paths, one of which is calculated from the start point to the target point, while the other is calculated in the reverse direction, and combines the generated paths for utilizing their advantageous line segments when obtaining more safe, short and maneuverable path candidates. The performance of the BaF was investigated over three battlefield scenarios and twelve test cases belonging to them. Moreover, the BaF was integrated into the workflow of a well-known meta-heuristic, artificial bee colony (ABC) algorithm, and detailed experiments were also carried out for evaluating the possible contribution of the BaF on the path planning capabilities of another technique. The results of the experiments showed that the BaF algorithm is able to plan at least promising or generally better paths with the exact consistency than other tested meta-heuristic techniques and runs nine or more times faster as validated through the comparison between the BaF and ABC algorithms. The results of the experiments further proved that the integration of the BaF boosts the performance of the ABC and helps it to outperform all of fifteen competitors for nine of twelve test cases.