Route Planning Using Nature-Inspired Algorithms
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...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Saxena, Priyansh Gupta, Raahat Maheshwari, Akshat |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.2307.12133 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2307_12133</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2307_12133</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-71b7cbc34e4e727b8be0491c999c871fb6ca0cb9027216a2f78d39d699aea8083</originalsourceid><addsrcrecordid>eNotzskOgjAUheFuXBj1AVzJC4AdkNsuiXFKjBqDa3JbCjZBNAWNvr1x2Jx_d_IRMmY0iuVsRqfon-4RcUEhYpwJ0SfT4_Xe2eBQY9O4pgpO7Wd32N29DTdNe3PeFkFaV1fvuvOlHZJeiXVrR_8OSLZcZPN1uN2vNvN0G2ICIgSmwWgjYhtb4KCltjRWzCiljARW6sQgNVpRDpwlyEuQhVBFohRalFSKAZn8br_i_ObdBf0r_8jzr1y8AeSAPXo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Route Planning Using Nature-Inspired Algorithms</title><source>arXiv.org</source><creator>Saxena, Priyansh ; Gupta, Raahat ; Maheshwari, Akshat</creator><creatorcontrib>Saxena, Priyansh ; Gupta, Raahat ; Maheshwari, Akshat</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2307.12133</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence</subject><creationdate>2023-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2307.12133$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2307.12133$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Saxena, Priyansh</creatorcontrib><creatorcontrib>Gupta, Raahat</creatorcontrib><creatorcontrib>Maheshwari, Akshat</creatorcontrib><title>Route Planning Using Nature-Inspired Algorithms</title><description>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.</description><subject>Computer Science - Artificial Intelligence</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzskOgjAUheFuXBj1AVzJC4AdkNsuiXFKjBqDa3JbCjZBNAWNvr1x2Jx_d_IRMmY0iuVsRqfon-4RcUEhYpwJ0SfT4_Xe2eBQY9O4pgpO7Wd32N29DTdNe3PeFkFaV1fvuvOlHZJeiXVrR_8OSLZcZPN1uN2vNvN0G2ICIgSmwWgjYhtb4KCltjRWzCiljARW6sQgNVpRDpwlyEuQhVBFohRalFSKAZn8br_i_ObdBf0r_8jzr1y8AeSAPXo</recordid><startdate>20230722</startdate><enddate>20230722</enddate><creator>Saxena, Priyansh</creator><creator>Gupta, Raahat</creator><creator>Maheshwari, Akshat</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230722</creationdate><title>Route Planning Using Nature-Inspired Algorithms</title><author>Saxena, Priyansh ; Gupta, Raahat ; Maheshwari, Akshat</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-71b7cbc34e4e727b8be0491c999c871fb6ca0cb9027216a2f78d39d699aea8083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Artificial Intelligence</topic><toplevel>online_resources</toplevel><creatorcontrib>Saxena, Priyansh</creatorcontrib><creatorcontrib>Gupta, Raahat</creatorcontrib><creatorcontrib>Maheshwari, Akshat</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Saxena, Priyansh</au><au>Gupta, Raahat</au><au>Maheshwari, Akshat</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Route Planning Using Nature-Inspired Algorithms</atitle><date>2023-07-22</date><risdate>2023</risdate><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.</abstract><doi>10.48550/arxiv.2307.12133</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2307.12133 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2307_12133 |
| source | arXiv.org |
| subjects | Computer Science - Artificial Intelligence |
| title | Route Planning Using Nature-Inspired Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T16%3A27%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Route%20Planning%20Using%20Nature-Inspired%20Algorithms&rft.au=Saxena,%20Priyansh&rft.date=2023-07-22&rft_id=info:doi/10.48550/arxiv.2307.12133&rft_dat=%3Carxiv_GOX%3E2307_12133%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |