Loading…

Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms

A multi-objective vehicle path planning method has been proposed to optimize path length, path safety, and path smoothness using the elitist non-dominated sorting genetic algorithm—a well-known soft computing approach. Four different path representation schemes that begin their coding from the start...

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Germany), 2013-07, Vol.17 (7), p.1283-1299
Main Authors: Ahmed, Faez, Deb, Kalyanmoy
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53
cites cdi_FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53
container_end_page 1299
container_issue 7
container_start_page 1283
container_title Soft computing (Berlin, Germany)
container_volume 17
creator Ahmed, Faez
Deb, Kalyanmoy
description A multi-objective vehicle path planning method has been proposed to optimize path length, path safety, and path smoothness using the elitist non-dominated sorting genetic algorithm—a well-known soft computing approach. Four different path representation schemes that begin their coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance and maximization of path safety are considered as objectives of this study while path smoothness is considered as a secondary objective. This study makes an extensive analysis of a number of issues related to the optimization of path planning task-handling of constraints associated with the problem, identifying an efficient path representation scheme, handling single versus multiple objectives, and evaluating the proposed algorithm on large-sized grids and having a dense set of obstacles. The study also compares the performance of the proposed algorithm with an existing GA-based approach. The evaluation of the proposed procedure against extreme conditions having a dense (as high as 91 %) placement of obstacles indicates its robustness and efficiency in solving complex path planning problems. The paper demonstrates the flexibility of evolutionary computing approaches in dealing with large-scale and multi-objective optimization problems.
doi_str_mv 10.1007/s00500-012-0964-8
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918055100</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918055100</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG8Fz9F8tEl6lMUvWPGiNyGkSdrN0k1qkgr-e1srePIyMzDv-w7zAHCJ0TVGiN8khCqEIMIEopqVUByBFS4phbzk9fHPTCBnJT0FZyntESKYV3QF3p_HPjsYmr3V2X3aIgzZHVRfDCrviqFX3jvfFWOaq-1ddikXPnhowsF5la0pUoh53nbW2-x0ofouRJd3h3QOTlrVJ3vx29fg7f7udfMIty8PT5vbLdQUswwtaxutOTJaaC4Yqnlj2pJUGhFqaK2MMtgoLpSiDSPaCsxaWtdtyRgRpKnoGlwtuUMMH6NNWe7DGP10UpIaC1RVE6NJhReVjiGlaFs5xOnV-CUxkjNEuUCUE0Q5Q5Ri8pDFkyat72z8S_7f9A3tkXZX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918055100</pqid></control><display><type>article</type><title>Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms</title><source>Springer Nature</source><creator>Ahmed, Faez ; Deb, Kalyanmoy</creator><creatorcontrib>Ahmed, Faez ; Deb, Kalyanmoy</creatorcontrib><description>A multi-objective vehicle path planning method has been proposed to optimize path length, path safety, and path smoothness using the elitist non-dominated sorting genetic algorithm—a well-known soft computing approach. Four different path representation schemes that begin their coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance and maximization of path safety are considered as objectives of this study while path smoothness is considered as a secondary objective. This study makes an extensive analysis of a number of issues related to the optimization of path planning task-handling of constraints associated with the problem, identifying an efficient path representation scheme, handling single versus multiple objectives, and evaluating the proposed algorithm on large-sized grids and having a dense set of obstacles. The study also compares the performance of the proposed algorithm with an existing GA-based approach. The evaluation of the proposed procedure against extreme conditions having a dense (as high as 91 %) placement of obstacles indicates its robustness and efficiency in solving complex path planning problems. The paper demonstrates the flexibility of evolutionary computing approaches in dealing with large-scale and multi-objective optimization problems.</description><identifier>ISSN: 1432-7643</identifier><identifier>EISSN: 1433-7479</identifier><identifier>DOI: 10.1007/s00500-012-0964-8</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer-Verlag</publisher><subject>Artificial Intelligence ; Barriers ; Computational Intelligence ; Control ; Elitism ; Engineering ; Genes ; Genetic algorithms ; Mathematical Logic and Foundations ; Mechatronics ; Methodologies and Application ; Multiple objective analysis ; Optimization ; Optimization algorithms ; Optimization techniques ; Path planning ; Representations ; Robotics ; Safety ; Smoothness ; Soft computing ; Sorting algorithms</subject><ispartof>Soft computing (Berlin, Germany), 2013-07, Vol.17 (7), p.1283-1299</ispartof><rights>Springer-Verlag Berlin Heidelberg 2012</rights><rights>Springer-Verlag Berlin Heidelberg 2012.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53</citedby><cites>FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Ahmed, Faez</creatorcontrib><creatorcontrib>Deb, Kalyanmoy</creatorcontrib><title>Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms</title><title>Soft computing (Berlin, Germany)</title><addtitle>Soft Comput</addtitle><description>A multi-objective vehicle path planning method has been proposed to optimize path length, path safety, and path smoothness using the elitist non-dominated sorting genetic algorithm—a well-known soft computing approach. Four different path representation schemes that begin their coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance and maximization of path safety are considered as objectives of this study while path smoothness is considered as a secondary objective. This study makes an extensive analysis of a number of issues related to the optimization of path planning task-handling of constraints associated with the problem, identifying an efficient path representation scheme, handling single versus multiple objectives, and evaluating the proposed algorithm on large-sized grids and having a dense set of obstacles. The study also compares the performance of the proposed algorithm with an existing GA-based approach. The evaluation of the proposed procedure against extreme conditions having a dense (as high as 91 %) placement of obstacles indicates its robustness and efficiency in solving complex path planning problems. The paper demonstrates the flexibility of evolutionary computing approaches in dealing with large-scale and multi-objective optimization problems.</description><subject>Artificial Intelligence</subject><subject>Barriers</subject><subject>Computational Intelligence</subject><subject>Control</subject><subject>Elitism</subject><subject>Engineering</subject><subject>Genes</subject><subject>Genetic algorithms</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Methodologies and Application</subject><subject>Multiple objective analysis</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Optimization techniques</subject><subject>Path planning</subject><subject>Representations</subject><subject>Robotics</subject><subject>Safety</subject><subject>Smoothness</subject><subject>Soft computing</subject><subject>Sorting algorithms</subject><issn>1432-7643</issn><issn>1433-7479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp1kE1LxDAQhoMouK7-AG8Fz9F8tEl6lMUvWPGiNyGkSdrN0k1qkgr-e1srePIyMzDv-w7zAHCJ0TVGiN8khCqEIMIEopqVUByBFS4phbzk9fHPTCBnJT0FZyntESKYV3QF3p_HPjsYmr3V2X3aIgzZHVRfDCrviqFX3jvfFWOaq-1ddikXPnhowsF5la0pUoh53nbW2-x0ofouRJd3h3QOTlrVJ3vx29fg7f7udfMIty8PT5vbLdQUswwtaxutOTJaaC4Yqnlj2pJUGhFqaK2MMtgoLpSiDSPaCsxaWtdtyRgRpKnoGlwtuUMMH6NNWe7DGP10UpIaC1RVE6NJhReVjiGlaFs5xOnV-CUxkjNEuUCUE0Q5Q5Ri8pDFkyat72z8S_7f9A3tkXZX</recordid><startdate>20130701</startdate><enddate>20130701</enddate><creator>Ahmed, Faez</creator><creator>Deb, Kalyanmoy</creator><general>Springer-Verlag</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20130701</creationdate><title>Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms</title><author>Ahmed, Faez ; Deb, Kalyanmoy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Artificial Intelligence</topic><topic>Barriers</topic><topic>Computational Intelligence</topic><topic>Control</topic><topic>Elitism</topic><topic>Engineering</topic><topic>Genes</topic><topic>Genetic algorithms</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Methodologies and Application</topic><topic>Multiple objective analysis</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Optimization techniques</topic><topic>Path planning</topic><topic>Representations</topic><topic>Robotics</topic><topic>Safety</topic><topic>Smoothness</topic><topic>Soft computing</topic><topic>Sorting algorithms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ahmed, Faez</creatorcontrib><creatorcontrib>Deb, Kalyanmoy</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Soft computing (Berlin, Germany)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ahmed, Faez</au><au>Deb, Kalyanmoy</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms</atitle><jtitle>Soft computing (Berlin, Germany)</jtitle><stitle>Soft Comput</stitle><date>2013-07-01</date><risdate>2013</risdate><volume>17</volume><issue>7</issue><spage>1283</spage><epage>1299</epage><pages>1283-1299</pages><issn>1432-7643</issn><eissn>1433-7479</eissn><abstract>A multi-objective vehicle path planning method has been proposed to optimize path length, path safety, and path smoothness using the elitist non-dominated sorting genetic algorithm—a well-known soft computing approach. Four different path representation schemes that begin their coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance and maximization of path safety are considered as objectives of this study while path smoothness is considered as a secondary objective. This study makes an extensive analysis of a number of issues related to the optimization of path planning task-handling of constraints associated with the problem, identifying an efficient path representation scheme, handling single versus multiple objectives, and evaluating the proposed algorithm on large-sized grids and having a dense set of obstacles. The study also compares the performance of the proposed algorithm with an existing GA-based approach. The evaluation of the proposed procedure against extreme conditions having a dense (as high as 91 %) placement of obstacles indicates its robustness and efficiency in solving complex path planning problems. The paper demonstrates the flexibility of evolutionary computing approaches in dealing with large-scale and multi-objective optimization problems.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.1007/s00500-012-0964-8</doi><tpages>17</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1432-7643
ispartof Soft computing (Berlin, Germany), 2013-07, Vol.17 (7), p.1283-1299
issn 1432-7643
1433-7479
language eng
recordid cdi_proquest_journals_2918055100
source Springer Nature
subjects Artificial Intelligence
Barriers
Computational Intelligence
Control
Elitism
Engineering
Genes
Genetic algorithms
Mathematical Logic and Foundations
Mechatronics
Methodologies and Application
Multiple objective analysis
Optimization
Optimization algorithms
Optimization techniques
Path planning
Representations
Robotics
Safety
Smoothness
Soft computing
Sorting algorithms
title Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T05%3A27%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multi-objective%20optimal%20path%20planning%20using%20elitist%20non-dominated%20sorting%20genetic%20algorithms&rft.jtitle=Soft%20computing%20(Berlin,%20Germany)&rft.au=Ahmed,%20Faez&rft.date=2013-07-01&rft.volume=17&rft.issue=7&rft.spage=1283&rft.epage=1299&rft.pages=1283-1299&rft.issn=1432-7643&rft.eissn=1433-7479&rft_id=info:doi/10.1007/s00500-012-0964-8&rft_dat=%3Cproquest_cross%3E2918055100%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c316t-e6fbcc70dc8c786097bdf425c023d39adad1da78aa3b62ce816f399f466282b53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2918055100&rft_id=info:pmid/&rfr_iscdi=true