A novel solution with rapid Voronoi-based coverage path planning in irregular environment for robotic mowing systems

This paper presents a novel solution of coverage path planning for robotic mowing applications. The planning algorithm is based on the Boustrophedon motions and the rapid Voronoi diagram. The coordinate conversion and the sweeping vector is defined by minimum bounding box and the Voronoi travel path...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of intelligent robotics and applications Online 2021-12, Vol.5 (4), p.558-575
Hauptverfasser: Huang, Kuo-Chun, Lian, Feng-Li, Chen, Chien-Tung, Wu, Chung-Hou, Chen, Chao-Cheng
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 575
container_issue 4
container_start_page 558
container_title International journal of intelligent robotics and applications Online
container_volume 5
creator Huang, Kuo-Chun
Lian, Feng-Li
Chen, Chien-Tung
Wu, Chung-Hou
Chen, Chao-Cheng
description This paper presents a novel solution of coverage path planning for robotic mowing applications. The planning algorithm is based on the Boustrophedon motions and the rapid Voronoi diagram. The coordinate conversion and the sweeping vector is defined by minimum bounding box and the Voronoi travel paths are designed to reduce the computational cost and execution time compared to conventional heuristic methods. The tracked path is controlled via dynamic feedback in standard lawn mowing robots under robot operating system (ROS). Within ROS, the information exchanging among different tasks of both extensive simulation cases and experimental field tests can be conducted easily. When meeting unknown obstacles, the proposed algorithm can re-plan its paths dynamically. The performance of the proposed algorithm is compared to several conventional coverage algorithms in terms of time efficiency, coverage, repetition, and robustness with respect to both concave and convex shapes. The field tests are conducted to demonstrate that the applicability of the sensor fusion and robustness of the proposed algorithm for the complete coverage tasks by robotic mowers.
doi_str_mv 10.1007/s41315-021-00199-8
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2932254966</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2932254966</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-d06789c6084ca10cf455eef99943a63894baf0848c49188a9cd645cb334f10163</originalsourceid><addsrcrecordid>eNp9kM1KAzEURoMoWLQv4CrgOppMMmmyLMU_KLhRcRcymcyYMk3GZKalb2_qiO5c3Qv3fN-FA8AVwTcE48VtYoSSEuGCIIyJlEicgFlBOUelFO-nv_uCnIN5ShuMcYEZ54zPwLCEPuxsB1PoxsEFD_du-IBR966GbyEGHxyqdLI1NJmLurWw15noO-298y10HroYbTt2OkLrdy5nttYPsAkRxlCFwRm4Dfsjmw5psNt0Cc4a3SU7_5kX4PX-7mX1iNbPD0-r5RoZyumAaswXQhqOBTOaYNOwsrS2kVIyqjkVklW6yUdhmCRCaGlqzkpTUcoaggmnF-B66u1j-BxtGtQmjNHnl6qQtChKJvmRKibKxJBStI3qo9vqeFAEq6NgNQlWWbD6FqxEDtEplDLsWxv_qv9JfQHv839z</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2932254966</pqid></control><display><type>article</type><title>A novel solution with rapid Voronoi-based coverage path planning in irregular environment for robotic mowing systems</title><source>SpringerLink Journals (MCLS)</source><source>ProQuest Central</source><creator>Huang, Kuo-Chun ; Lian, Feng-Li ; Chen, Chien-Tung ; Wu, Chung-Hou ; Chen, Chao-Cheng</creator><creatorcontrib>Huang, Kuo-Chun ; Lian, Feng-Li ; Chen, Chien-Tung ; Wu, Chung-Hou ; Chen, Chao-Cheng</creatorcontrib><description>This paper presents a novel solution of coverage path planning for robotic mowing applications. The planning algorithm is based on the Boustrophedon motions and the rapid Voronoi diagram. The coordinate conversion and the sweeping vector is defined by minimum bounding box and the Voronoi travel paths are designed to reduce the computational cost and execution time compared to conventional heuristic methods. The tracked path is controlled via dynamic feedback in standard lawn mowing robots under robot operating system (ROS). Within ROS, the information exchanging among different tasks of both extensive simulation cases and experimental field tests can be conducted easily. When meeting unknown obstacles, the proposed algorithm can re-plan its paths dynamically. The performance of the proposed algorithm is compared to several conventional coverage algorithms in terms of time efficiency, coverage, repetition, and robustness with respect to both concave and convex shapes. The field tests are conducted to demonstrate that the applicability of the sensor fusion and robustness of the proposed algorithm for the complete coverage tasks by robotic mowers.</description><identifier>ISSN: 2366-5971</identifier><identifier>EISSN: 2366-598X</identifier><identifier>DOI: 10.1007/s41315-021-00199-8</identifier><language>eng</language><publisher>Singapore: Springer Singapore</publisher><subject>Algorithms ; Artificial Intelligence ; Computer Science ; Control ; Electronics and Microelectronics ; Energy consumption ; Field study ; Field tests ; Global positioning systems ; GPS ; Heuristic methods ; Instrumentation ; Kalman filters ; Kinematics ; Localization ; Machines ; Manufacturing ; Mechatronics ; Mowing ; Multisensor fusion ; Path planning ; Planning ; Processes ; Regular Paper ; Robotics ; Robots ; Robustness ; Sensors ; User Interfaces and Human Computer Interaction ; Voronoi graphs ; Wire</subject><ispartof>International journal of intelligent robotics and applications Online, 2021-12, Vol.5 (4), p.558-575</ispartof><rights>The Author(s) 2021</rights><rights>The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-d06789c6084ca10cf455eef99943a63894baf0848c49188a9cd645cb334f10163</citedby><cites>FETCH-LOGICAL-c363t-d06789c6084ca10cf455eef99943a63894baf0848c49188a9cd645cb334f10163</cites><orcidid>0000-0002-1260-4894</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s41315-021-00199-8$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2932254966?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,21367,27901,27902,33721,41464,42533,43781,51294</link.rule.ids></links><search><creatorcontrib>Huang, Kuo-Chun</creatorcontrib><creatorcontrib>Lian, Feng-Li</creatorcontrib><creatorcontrib>Chen, Chien-Tung</creatorcontrib><creatorcontrib>Wu, Chung-Hou</creatorcontrib><creatorcontrib>Chen, Chao-Cheng</creatorcontrib><title>A novel solution with rapid Voronoi-based coverage path planning in irregular environment for robotic mowing systems</title><title>International journal of intelligent robotics and applications Online</title><addtitle>Int J Intell Robot Appl</addtitle><description>This paper presents a novel solution of coverage path planning for robotic mowing applications. The planning algorithm is based on the Boustrophedon motions and the rapid Voronoi diagram. The coordinate conversion and the sweeping vector is defined by minimum bounding box and the Voronoi travel paths are designed to reduce the computational cost and execution time compared to conventional heuristic methods. The tracked path is controlled via dynamic feedback in standard lawn mowing robots under robot operating system (ROS). Within ROS, the information exchanging among different tasks of both extensive simulation cases and experimental field tests can be conducted easily. When meeting unknown obstacles, the proposed algorithm can re-plan its paths dynamically. The performance of the proposed algorithm is compared to several conventional coverage algorithms in terms of time efficiency, coverage, repetition, and robustness with respect to both concave and convex shapes. The field tests are conducted to demonstrate that the applicability of the sensor fusion and robustness of the proposed algorithm for the complete coverage tasks by robotic mowers.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Computer Science</subject><subject>Control</subject><subject>Electronics and Microelectronics</subject><subject>Energy consumption</subject><subject>Field study</subject><subject>Field tests</subject><subject>Global positioning systems</subject><subject>GPS</subject><subject>Heuristic methods</subject><subject>Instrumentation</subject><subject>Kalman filters</subject><subject>Kinematics</subject><subject>Localization</subject><subject>Machines</subject><subject>Manufacturing</subject><subject>Mechatronics</subject><subject>Mowing</subject><subject>Multisensor fusion</subject><subject>Path planning</subject><subject>Planning</subject><subject>Processes</subject><subject>Regular Paper</subject><subject>Robotics</subject><subject>Robots</subject><subject>Robustness</subject><subject>Sensors</subject><subject>User Interfaces and Human Computer Interaction</subject><subject>Voronoi graphs</subject><subject>Wire</subject><issn>2366-5971</issn><issn>2366-598X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>BENPR</sourceid><recordid>eNp9kM1KAzEURoMoWLQv4CrgOppMMmmyLMU_KLhRcRcymcyYMk3GZKalb2_qiO5c3Qv3fN-FA8AVwTcE48VtYoSSEuGCIIyJlEicgFlBOUelFO-nv_uCnIN5ShuMcYEZ54zPwLCEPuxsB1PoxsEFD_du-IBR966GbyEGHxyqdLI1NJmLurWw15noO-298y10HroYbTt2OkLrdy5nttYPsAkRxlCFwRm4Dfsjmw5psNt0Cc4a3SU7_5kX4PX-7mX1iNbPD0-r5RoZyumAaswXQhqOBTOaYNOwsrS2kVIyqjkVklW6yUdhmCRCaGlqzkpTUcoaggmnF-B66u1j-BxtGtQmjNHnl6qQtChKJvmRKibKxJBStI3qo9vqeFAEq6NgNQlWWbD6FqxEDtEplDLsWxv_qv9JfQHv839z</recordid><startdate>20211201</startdate><enddate>20211201</enddate><creator>Huang, Kuo-Chun</creator><creator>Lian, Feng-Li</creator><creator>Chen, Chien-Tung</creator><creator>Wu, Chung-Hou</creator><creator>Chen, Chao-Cheng</creator><general>Springer Singapore</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</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>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0002-1260-4894</orcidid></search><sort><creationdate>20211201</creationdate><title>A novel solution with rapid Voronoi-based coverage path planning in irregular environment for robotic mowing systems</title><author>Huang, Kuo-Chun ; Lian, Feng-Li ; Chen, Chien-Tung ; Wu, Chung-Hou ; Chen, Chao-Cheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-d06789c6084ca10cf455eef99943a63894baf0848c49188a9cd645cb334f10163</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Computer Science</topic><topic>Control</topic><topic>Electronics and Microelectronics</topic><topic>Energy consumption</topic><topic>Field study</topic><topic>Field tests</topic><topic>Global positioning systems</topic><topic>GPS</topic><topic>Heuristic methods</topic><topic>Instrumentation</topic><topic>Kalman filters</topic><topic>Kinematics</topic><topic>Localization</topic><topic>Machines</topic><topic>Manufacturing</topic><topic>Mechatronics</topic><topic>Mowing</topic><topic>Multisensor fusion</topic><topic>Path planning</topic><topic>Planning</topic><topic>Processes</topic><topic>Regular Paper</topic><topic>Robotics</topic><topic>Robots</topic><topic>Robustness</topic><topic>Sensors</topic><topic>User Interfaces and Human Computer Interaction</topic><topic>Voronoi graphs</topic><topic>Wire</topic><toplevel>online_resources</toplevel><creatorcontrib>Huang, Kuo-Chun</creatorcontrib><creatorcontrib>Lian, Feng-Li</creatorcontrib><creatorcontrib>Chen, Chien-Tung</creatorcontrib><creatorcontrib>Wu, Chung-Hou</creatorcontrib><creatorcontrib>Chen, Chao-Cheng</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</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>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering 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><collection>Engineering Collection</collection><jtitle>International journal of intelligent robotics and applications Online</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huang, Kuo-Chun</au><au>Lian, Feng-Li</au><au>Chen, Chien-Tung</au><au>Wu, Chung-Hou</au><au>Chen, Chao-Cheng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A novel solution with rapid Voronoi-based coverage path planning in irregular environment for robotic mowing systems</atitle><jtitle>International journal of intelligent robotics and applications Online</jtitle><stitle>Int J Intell Robot Appl</stitle><date>2021-12-01</date><risdate>2021</risdate><volume>5</volume><issue>4</issue><spage>558</spage><epage>575</epage><pages>558-575</pages><issn>2366-5971</issn><eissn>2366-598X</eissn><abstract>This paper presents a novel solution of coverage path planning for robotic mowing applications. The planning algorithm is based on the Boustrophedon motions and the rapid Voronoi diagram. The coordinate conversion and the sweeping vector is defined by minimum bounding box and the Voronoi travel paths are designed to reduce the computational cost and execution time compared to conventional heuristic methods. The tracked path is controlled via dynamic feedback in standard lawn mowing robots under robot operating system (ROS). Within ROS, the information exchanging among different tasks of both extensive simulation cases and experimental field tests can be conducted easily. When meeting unknown obstacles, the proposed algorithm can re-plan its paths dynamically. The performance of the proposed algorithm is compared to several conventional coverage algorithms in terms of time efficiency, coverage, repetition, and robustness with respect to both concave and convex shapes. The field tests are conducted to demonstrate that the applicability of the sensor fusion and robustness of the proposed algorithm for the complete coverage tasks by robotic mowers.</abstract><cop>Singapore</cop><pub>Springer Singapore</pub><doi>10.1007/s41315-021-00199-8</doi><tpages>18</tpages><orcidid>https://orcid.org/0000-0002-1260-4894</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2366-5971
ispartof International journal of intelligent robotics and applications Online, 2021-12, Vol.5 (4), p.558-575
issn 2366-5971
2366-598X
language eng
recordid cdi_proquest_journals_2932254966
source SpringerLink Journals (MCLS); ProQuest Central
subjects Algorithms
Artificial Intelligence
Computer Science
Control
Electronics and Microelectronics
Energy consumption
Field study
Field tests
Global positioning systems
GPS
Heuristic methods
Instrumentation
Kalman filters
Kinematics
Localization
Machines
Manufacturing
Mechatronics
Mowing
Multisensor fusion
Path planning
Planning
Processes
Regular Paper
Robotics
Robots
Robustness
Sensors
User Interfaces and Human Computer Interaction
Voronoi graphs
Wire
title A novel solution with rapid Voronoi-based coverage path planning in irregular environment for robotic mowing systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T03%3A28%3A37IST&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=A%20novel%20solution%20with%20rapid%20Voronoi-based%20coverage%20path%20planning%20in%20irregular%20environment%20for%20robotic%20mowing%20systems&rft.jtitle=International%20journal%20of%20intelligent%20robotics%20and%20applications%20Online&rft.au=Huang,%20Kuo-Chun&rft.date=2021-12-01&rft.volume=5&rft.issue=4&rft.spage=558&rft.epage=575&rft.pages=558-575&rft.issn=2366-5971&rft.eissn=2366-598X&rft_id=info:doi/10.1007/s41315-021-00199-8&rft_dat=%3Cproquest_cross%3E2932254966%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2932254966&rft_id=info:pmid/&rfr_iscdi=true