Loading…

Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots

This article is focused on the problematics of path planning, which means finding the optimal path between two points in a known environment with obstacles. The proposed path-planning method uses the wavefront algorithm, and two modifications are implemented and verified. The first modification is t...

Full description

Saved in:
Bibliographic Details
Published in:Robotics (Basel) 2023-02, Vol.12 (1), p.25
Main Authors: Psotka, Martin, Duchoň, František, Roman, Mykhailyshyn, Michal, Tölgyessy, Michal, Dobiš
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-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3
cites cdi_FETCH-LOGICAL-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3
container_end_page
container_issue 1
container_start_page 25
container_title Robotics (Basel)
container_volume 12
creator Psotka, Martin
Duchoň, František
Roman, Mykhailyshyn
Michal, Tölgyessy
Michal, Dobiš
description This article is focused on the problematics of path planning, which means finding the optimal path between two points in a known environment with obstacles. The proposed path-planning method uses the wavefront algorithm, and two modifications are implemented and verified. The first modification is the removal of redundant waypoints. The first modification is applied because the wavefront algorithm generates redundant waypoints. These waypoints cause unnecessary changes in the direction of movement. The second one is smoothing the generated trajectory using B-spline curves. The reason for applying the second modification is that trajectory generated by the wavefront algorithm is in the form of the polyline, which is inadequate in terms of the smoothness of the robot’s motion. The verification of the proposed method is performed in environments with different densities of obstacles compared with standard Dijkstra’s and A* algorithms.
doi_str_mv 10.3390/robotics12010025
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_7abc1c178fee48b782aee8a32cd8105e</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_7abc1c178fee48b782aee8a32cd8105e</doaj_id><sourcerecordid>2779626743</sourcerecordid><originalsourceid>FETCH-LOGICAL-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3</originalsourceid><addsrcrecordid>eNpdUU1rGzEQXUoDDYnvOQp6dqoPr6Q9pqZxDTE1pSFHMSuNbJnNTirJhf77bOoQSuYyH7x585jXNFeCXyvV8S-ZeqrJFyG54Fy2H5pzKYWd69aKj__Vn5pZKQc-RSeU1eK82a0G6mFgW6h7th1gHNO4YxusewrsKxQMjEYGbEMhxeShpqmlyOoe2QP8wZhprOxm2FFOdf_IImW2ynQcw7TSpwHZzxdt5bI5izAUnL3mi-b-9tuv5ff53Y_VenlzN_fKdHWuWhRKgQUJOhitda949BDkom_7RRe9EQa09Ua1wC12UoUQhETfKSMniLpo1ifeQHBwTzk9Qv7rCJL7N6C8c5CnVw3oDPReeGFsRFzY3lgJiBaU9MEK3uLE9fnE9ZTp9xFLdQc65nGS76QxnZbaLNSE4ieUz1RKxvh2VXD34o577456BlvGhFs</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2779626743</pqid></control><display><type>article</type><title>Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots</title><source>Publicly Available Content Database</source><creator>Psotka, Martin ; Duchoň, František ; Roman, Mykhailyshyn ; Michal, Tölgyessy ; Michal, Dobiš</creator><creatorcontrib>Psotka, Martin ; Duchoň, František ; Roman, Mykhailyshyn ; Michal, Tölgyessy ; Michal, Dobiš</creatorcontrib><description>This article is focused on the problematics of path planning, which means finding the optimal path between two points in a known environment with obstacles. The proposed path-planning method uses the wavefront algorithm, and two modifications are implemented and verified. The first modification is the removal of redundant waypoints. The first modification is applied because the wavefront algorithm generates redundant waypoints. These waypoints cause unnecessary changes in the direction of movement. The second one is smoothing the generated trajectory using B-spline curves. The reason for applying the second modification is that trajectory generated by the wavefront algorithm is in the form of the polyline, which is inadequate in terms of the smoothness of the robot’s motion. The verification of the proposed method is performed in environments with different densities of obstacles compared with standard Dijkstra’s and A* algorithms.</description><identifier>ISSN: 2218-6581</identifier><identifier>EISSN: 2218-6581</identifier><identifier>DOI: 10.3390/robotics12010025</identifier><language>eng</language><publisher>Basel: MDPI AG</publisher><subject>Accuracy ; Algorithms ; B spline functions ; B-spline curves ; Barriers ; Costs ; Energy consumption ; Genetic algorithms ; global path planning ; ground mobile robot ; Localization ; Robot dynamics ; Robots ; ROS ; Sensors ; Smoothness ; Trajectory planning ; Wave fronts ; wavefront algorithm ; Waypoints</subject><ispartof>Robotics (Basel), 2023-02, Vol.12 (1), p.25</ispartof><rights>2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3</citedby><cites>FETCH-LOGICAL-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3</cites><orcidid>0000-0003-4140-9737 ; 0000-0003-1697-1197 ; 0000-0002-1203-3446 ; 0000-0001-8676-0681 ; 0000-0002-2453-212X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2779626743/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2779626743?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590,75126</link.rule.ids></links><search><creatorcontrib>Psotka, Martin</creatorcontrib><creatorcontrib>Duchoň, František</creatorcontrib><creatorcontrib>Roman, Mykhailyshyn</creatorcontrib><creatorcontrib>Michal, Tölgyessy</creatorcontrib><creatorcontrib>Michal, Dobiš</creatorcontrib><title>Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots</title><title>Robotics (Basel)</title><description>This article is focused on the problematics of path planning, which means finding the optimal path between two points in a known environment with obstacles. The proposed path-planning method uses the wavefront algorithm, and two modifications are implemented and verified. The first modification is the removal of redundant waypoints. The first modification is applied because the wavefront algorithm generates redundant waypoints. These waypoints cause unnecessary changes in the direction of movement. The second one is smoothing the generated trajectory using B-spline curves. The reason for applying the second modification is that trajectory generated by the wavefront algorithm is in the form of the polyline, which is inadequate in terms of the smoothness of the robot’s motion. The verification of the proposed method is performed in environments with different densities of obstacles compared with standard Dijkstra’s and A* algorithms.</description><subject>Accuracy</subject><subject>Algorithms</subject><subject>B spline functions</subject><subject>B-spline curves</subject><subject>Barriers</subject><subject>Costs</subject><subject>Energy consumption</subject><subject>Genetic algorithms</subject><subject>global path planning</subject><subject>ground mobile robot</subject><subject>Localization</subject><subject>Robot dynamics</subject><subject>Robots</subject><subject>ROS</subject><subject>Sensors</subject><subject>Smoothness</subject><subject>Trajectory planning</subject><subject>Wave fronts</subject><subject>wavefront algorithm</subject><subject>Waypoints</subject><issn>2218-6581</issn><issn>2218-6581</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNpdUU1rGzEQXUoDDYnvOQp6dqoPr6Q9pqZxDTE1pSFHMSuNbJnNTirJhf77bOoQSuYyH7x585jXNFeCXyvV8S-ZeqrJFyG54Fy2H5pzKYWd69aKj__Vn5pZKQc-RSeU1eK82a0G6mFgW6h7th1gHNO4YxusewrsKxQMjEYGbEMhxeShpqmlyOoe2QP8wZhprOxm2FFOdf_IImW2ynQcw7TSpwHZzxdt5bI5izAUnL3mi-b-9tuv5ff53Y_VenlzN_fKdHWuWhRKgQUJOhitda949BDkom_7RRe9EQa09Ua1wC12UoUQhETfKSMniLpo1ifeQHBwTzk9Qv7rCJL7N6C8c5CnVw3oDPReeGFsRFzY3lgJiBaU9MEK3uLE9fnE9ZTp9xFLdQc65nGS76QxnZbaLNSE4ieUz1RKxvh2VXD34o577456BlvGhFs</recordid><startdate>20230201</startdate><enddate>20230201</enddate><creator>Psotka, Martin</creator><creator>Duchoň, František</creator><creator>Roman, Mykhailyshyn</creator><creator>Michal, Tölgyessy</creator><creator>Michal, Dobiš</creator><general>MDPI AG</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7QF</scope><scope>7QQ</scope><scope>7SC</scope><scope>7SE</scope><scope>7SP</scope><scope>7SR</scope><scope>7TA</scope><scope>7TB</scope><scope>7U5</scope><scope>7XB</scope><scope>8AL</scope><scope>8BQ</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>F28</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>H8D</scope><scope>H8G</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-4140-9737</orcidid><orcidid>https://orcid.org/0000-0003-1697-1197</orcidid><orcidid>https://orcid.org/0000-0002-1203-3446</orcidid><orcidid>https://orcid.org/0000-0001-8676-0681</orcidid><orcidid>https://orcid.org/0000-0002-2453-212X</orcidid></search><sort><creationdate>20230201</creationdate><title>Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots</title><author>Psotka, Martin ; Duchoň, František ; Roman, Mykhailyshyn ; Michal, Tölgyessy ; Michal, Dobiš</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Accuracy</topic><topic>Algorithms</topic><topic>B spline functions</topic><topic>B-spline curves</topic><topic>Barriers</topic><topic>Costs</topic><topic>Energy consumption</topic><topic>Genetic algorithms</topic><topic>global path planning</topic><topic>ground mobile robot</topic><topic>Localization</topic><topic>Robot dynamics</topic><topic>Robots</topic><topic>ROS</topic><topic>Sensors</topic><topic>Smoothness</topic><topic>Trajectory planning</topic><topic>Wave fronts</topic><topic>wavefront algorithm</topic><topic>Waypoints</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Psotka, Martin</creatorcontrib><creatorcontrib>Duchoň, František</creatorcontrib><creatorcontrib>Roman, Mykhailyshyn</creatorcontrib><creatorcontrib>Michal, Tölgyessy</creatorcontrib><creatorcontrib>Michal, Dobiš</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Aluminium Industry Abstracts</collection><collection>Ceramic Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Corrosion Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>Aerospace Database</collection><collection>Copper Technical Reference Library</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Robotics (Basel)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Psotka, Martin</au><au>Duchoň, František</au><au>Roman, Mykhailyshyn</au><au>Michal, Tölgyessy</au><au>Michal, Dobiš</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots</atitle><jtitle>Robotics (Basel)</jtitle><date>2023-02-01</date><risdate>2023</risdate><volume>12</volume><issue>1</issue><spage>25</spage><pages>25-</pages><issn>2218-6581</issn><eissn>2218-6581</eissn><abstract>This article is focused on the problematics of path planning, which means finding the optimal path between two points in a known environment with obstacles. The proposed path-planning method uses the wavefront algorithm, and two modifications are implemented and verified. The first modification is the removal of redundant waypoints. The first modification is applied because the wavefront algorithm generates redundant waypoints. These waypoints cause unnecessary changes in the direction of movement. The second one is smoothing the generated trajectory using B-spline curves. The reason for applying the second modification is that trajectory generated by the wavefront algorithm is in the form of the polyline, which is inadequate in terms of the smoothness of the robot’s motion. The verification of the proposed method is performed in environments with different densities of obstacles compared with standard Dijkstra’s and A* algorithms.</abstract><cop>Basel</cop><pub>MDPI AG</pub><doi>10.3390/robotics12010025</doi><orcidid>https://orcid.org/0000-0003-4140-9737</orcidid><orcidid>https://orcid.org/0000-0003-1697-1197</orcidid><orcidid>https://orcid.org/0000-0002-1203-3446</orcidid><orcidid>https://orcid.org/0000-0001-8676-0681</orcidid><orcidid>https://orcid.org/0000-0002-2453-212X</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2218-6581
ispartof Robotics (Basel), 2023-02, Vol.12 (1), p.25
issn 2218-6581
2218-6581
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_7abc1c178fee48b782aee8a32cd8105e
source Publicly Available Content Database
subjects Accuracy
Algorithms
B spline functions
B-spline curves
Barriers
Costs
Energy consumption
Genetic algorithms
global path planning
ground mobile robot
Localization
Robot dynamics
Robots
ROS
Sensors
Smoothness
Trajectory planning
Wave fronts
wavefront algorithm
Waypoints
title Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T10%3A20%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Global%20Path%20Planning%20Method%20Based%20on%20a%20Modification%20of%20the%20Wavefront%20Algorithm%20for%20Ground%20Mobile%20Robots&rft.jtitle=Robotics%20(Basel)&rft.au=Psotka,%20Martin&rft.date=2023-02-01&rft.volume=12&rft.issue=1&rft.spage=25&rft.pages=25-&rft.issn=2218-6581&rft.eissn=2218-6581&rft_id=info:doi/10.3390/robotics12010025&rft_dat=%3Cproquest_doaj_%3E2779626743%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c379t-35e133a8a2a6d7666b30fcad24b5b49fc717a68c735a08e923ddd12ec9372b5b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2779626743&rft_id=info:pmid/&rfr_iscdi=true