Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles.
Selcuk AslanPublished in: Computing (2024)
Keyphrases
- greedy algorithm
- path planning
- unmanned aerial vehicles
- mobile robot
- search and rescue
- collision avoidance
- greedy algorithms
- dynamic environments
- path planning algorithm
- multi robot
- worst case
- autonomous systems
- dynamic programming
- aerial vehicles
- path finding
- motion planning
- obstacle avoidance
- potential field
- optimal path
- knapsack problem
- multiple robots
- degrees of freedom
- greedy strategy
- autonomous vehicles
- objective function
- dynamic and uncertain environments
- autonomous navigation
- mathematical model
- robot path planning