Route Planning Using Nature-Inspired Algorithms

TL;DR

This paper reviews Nature-Inspired Algorithms (NIAs) and their application to route planning problems, highlighting their advantages over classical methods and providing an overview of their classifications and examples.

Contribution

It offers a comprehensive overview of NIAs, their classifications, and their specific application to route planning in robotics, emphasizing their effectiveness.

Findings

NIAs are effective for route planning in robotics.

They outperform classical algorithms in certain scenarios.

The paper categorizes and exemplifies various NIAs.

Abstract

There are many different heuristic algorithms for solving combinatorial optimization problems that are commonly described as Nature-Inspired Algorithms (NIAs). Generally, they are inspired by some natural phenomenon, and due to their inherent converging and stochastic nature, they are known to give optimal results when compared to classical approaches. There are a large number of applications of NIAs, perhaps the most popular being route planning problems in robotics - problems that require a sequence of translation and rotation steps from the start to the goal in an optimized manner while avoiding obstacles in the environment. In this chapter, we will first give an overview of Nature-Inspired Algorithms, followed by their classification and common examples. We will then discuss how the NIAs have applied to solve the route planning problem.