Route Planning Using Nature-Inspired Algorithms
- URL: http://arxiv.org/abs/2307.12133v1
- Date: Sat, 22 Jul 2023 17:37:43 GMT
- Title: Route Planning Using Nature-Inspired Algorithms
- Authors: Priyansh Saxena, Raahat Gupta, Akshat Maheshwari
- Abstract summary: There are many different algorithms for solving optimization problems that are commonly described as Nature-Inspired Algorithms (NIAs)
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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP)
We generalize the SDP-inspired quantum algorithm to sum-of-squares.
Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
arXiv Detail & Related papers (2024-08-14T19:04:13Z) - Nature-Inspired Algorithms in Optimization: Introduction, Hybridization
and Insights [1.6589012298747952]
Benchmarking is important in evaluating the performance of optimization algorithms.
This chapter focuses on the overview of optimization, nature-inspired algorithms and the role of hybridization.
arXiv Detail & Related papers (2023-08-30T11:33:22Z) - Accelerating Cutting-Plane Algorithms via Reinforcement Learning
Surrogates [49.84541884653309]
A current standard approach to solving convex discrete optimization problems is the use of cutting-plane algorithms.
Despite the existence of a number of general-purpose cut-generating algorithms, large-scale discrete optimization problems continue to suffer from intractability.
We propose a method for accelerating cutting-plane algorithms via reinforcement learning.
arXiv Detail & Related papers (2023-07-17T20:11:56Z) - Socio-cognitive Optimization of Time-delay Control Problems using
Evolutionary Metaheuristics [89.24951036534168]
Metaheuristics are universal optimization algorithms which should be used for solving difficult problems, unsolvable by classic approaches.
In this paper we aim at constructing novel socio-cognitive metaheuristic based on castes, and apply several versions of this algorithm to optimization of time-delay system model.
arXiv Detail & Related papers (2022-10-23T22:21:10Z) - Neural Combinatorial Optimization: a New Player in the Field [69.23334811890919]
This paper presents a critical analysis on the incorporation of algorithms based on neural networks into the classical optimization framework.
A comprehensive study is carried out to analyse the fundamental aspects of such algorithms, including performance, transferability, computational cost and to larger-sized instances.
arXiv Detail & Related papers (2022-05-03T07:54:56Z) - A Unified View of Algorithms for Path Planning Using Probabilistic
Inference on Factor Graphs [2.4874504720536317]
This work looks at the specific recursions that arise from various cost functions that, although they may appear similar in scope, bear differences, at least when applied to typical path planning problems.
We show how this unified approach, presented both in probability space and in log space, provides a very general framework that includes the Sum-product, the Max-product, Dynamic programming and mixed Reward/Entropy criteria-based algorithms.
arXiv Detail & Related papers (2021-06-19T07:13:15Z) - Nature-Inspired Optimization Algorithms: Research Direction and Survey [0.0]
Nature-inspired algorithms are commonly used for solving the various optimization problems.
We classify nature-inspired algorithms as natural evolution based, swarm intelligence based, biological based, science based and others.
The purpose of this review is to present an exhaustive analysis of various nature-inspired algorithms based on its source of inspiration, basic operators, control parameters, features, variants and area of application where these algorithms have been successfully applied.
arXiv Detail & Related papers (2021-02-08T06:03:36Z) - Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
This paper investigates the classical integer least-squares problem which estimates signals integer from linear models.
The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning.
We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
arXiv Detail & Related papers (2021-01-07T08:00:02Z) - Mapping of Real World Problems to Nature Inspired Algorithm using Goal
based Classification and TRIZ [0.0]
A novel method based on TRIZ to map the real-world problems to nature problems is explained here.
For this framework to work, a novel classification of NIA based on the end goal that nature is trying to achieve is devised.
arXiv Detail & Related papers (2020-10-08T06:55:31Z) - Accelerated Message Passing for Entropy-Regularized MAP Inference [89.15658822319928]
Maximum a posteriori (MAP) inference in discrete-valued random fields is a fundamental problem in machine learning.
Due to the difficulty of this problem, linear programming (LP) relaxations are commonly used to derive specialized message passing algorithms.
We present randomized methods for accelerating these algorithms by leveraging techniques that underlie classical accelerated gradient.
arXiv Detail & Related papers (2020-07-01T18:43:32Z) - Nature-Inspired Optimization Algorithms: Challenges and Open Problems [3.7692411550925673]
Problems in science and engineering can be formulated as optimization problems, subject to complex nonlinear constraints.
The solutions of highly nonlinear problems usually require sophisticated optimization algorithms, and traditional algorithms may struggle to deal with such problems.
A current trend is to use nature-inspired algorithms due to their flexibility and effectiveness.
arXiv Detail & Related papers (2020-03-08T13:00:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.