Escaping Local Minima in Path Planning Using a Robust Bacterial Foraging Algorithm
The bacterial foraging optimization (BFO) algorithm successfully searches for an optimal path from start to finish in the presence of obstacles over a flat surface map. However, the algorithm suffers from getting stuck in the local minima whenever non-circular obstacles are encountered. The retrieva...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-11-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/10/21/7905 |