Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees

In robotics, Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent the spatial topologies of their surrounding area. In this paper we consider the problem of constructing GVDs on discrete environments. Several algorithms that solve this problem exist in the literature, no...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical problems in engineering 2014, Vol.2014 (2014), p.1-14
Hauptverfasser: Yin, Quanjun, Qin, Long, Liu, Xiaocheng, Zha, Yabing
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 14
container_issue 2014
container_start_page 1
container_title Mathematical problems in engineering
container_volume 2014
creator Yin, Quanjun
Qin, Long
Liu, Xiaocheng
Zha, Yabing
description In robotics, Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent the spatial topologies of their surrounding area. In this paper we consider the problem of constructing GVDs on discrete environments. Several algorithms that solve this problem exist in the literature, notably the Brushfire algorithm and its improved versions which possess local repair mechanism. However, when the area to be processed is very large or is of high resolution, the size of the metric matrices used by these algorithms to compute GVDs can be prohibitive. To address this issue, we propose an improvement on the current algorithms, using pointerless quadtrees in place of metric matrices to compute and maintain GVDs. Beyond the construction and reconstruction of a GVD, our algorithm further provides a method to approximate roadmaps in multiple granularities from the quadtree based GVD. Simulation tests in representative scenarios demonstrate that, compared with the current algorithms, our algorithm generally makes an order of magnitude improvement regarding memory cost when the area is larger than 210×210. We also demonstrate the usefulness of the approximated roadmaps for coarse-to-fine pathfinding tasks.
format Article
fullrecord <record><control><sourceid>emarefa</sourceid><recordid>TN_cdi_emarefa_primary_472964</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>472964</sourcerecordid><originalsourceid>FETCH-emarefa_primary_4729643</originalsourceid><addsrcrecordid>eNqFiksKwjAUAIMo-D2CkAsUmjRtdV2_Owsi7kpoXyWSJvJeutDT24V7VzMwM2IzkWZJlAqVjwePpYqETO5TNid6xrEUqdjMWHl2NUIHLmjLC-8oYF8H4x33LT-CA9TWfKDhN4_eecN3Rj9Qd8SH5eKNC4AWiHjZ6yYgAC3ZpNWWYPXjgq0P-2txiqDTCK2uXmgGe1cql9tMJf_6FxDVPZs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees</title><source>Wiley Online Library Open Access</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Yin, Quanjun ; Qin, Long ; Liu, Xiaocheng ; Zha, Yabing</creator><creatorcontrib>Yin, Quanjun ; Qin, Long ; Liu, Xiaocheng ; Zha, Yabing</creatorcontrib><description>In robotics, Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent the spatial topologies of their surrounding area. In this paper we consider the problem of constructing GVDs on discrete environments. Several algorithms that solve this problem exist in the literature, notably the Brushfire algorithm and its improved versions which possess local repair mechanism. However, when the area to be processed is very large or is of high resolution, the size of the metric matrices used by these algorithms to compute GVDs can be prohibitive. To address this issue, we propose an improvement on the current algorithms, using pointerless quadtrees in place of metric matrices to compute and maintain GVDs. Beyond the construction and reconstruction of a GVD, our algorithm further provides a method to approximate roadmaps in multiple granularities from the quadtree based GVD. Simulation tests in representative scenarios demonstrate that, compared with the current algorithms, our algorithm generally makes an order of magnitude improvement regarding memory cost when the area is larger than 210×210. We also demonstrate the usefulness of the approximated roadmaps for coarse-to-fine pathfinding tasks.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Puplishing Corporation</publisher><ispartof>Mathematical problems in engineering, 2014, Vol.2014 (2014), p.1-14</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Yin, Quanjun</creatorcontrib><creatorcontrib>Qin, Long</creatorcontrib><creatorcontrib>Liu, Xiaocheng</creatorcontrib><creatorcontrib>Zha, Yabing</creatorcontrib><title>Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees</title><title>Mathematical problems in engineering</title><description>In robotics, Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent the spatial topologies of their surrounding area. In this paper we consider the problem of constructing GVDs on discrete environments. Several algorithms that solve this problem exist in the literature, notably the Brushfire algorithm and its improved versions which possess local repair mechanism. However, when the area to be processed is very large or is of high resolution, the size of the metric matrices used by these algorithms to compute GVDs can be prohibitive. To address this issue, we propose an improvement on the current algorithms, using pointerless quadtrees in place of metric matrices to compute and maintain GVDs. Beyond the construction and reconstruction of a GVD, our algorithm further provides a method to approximate roadmaps in multiple granularities from the quadtree based GVD. Simulation tests in representative scenarios demonstrate that, compared with the current algorithms, our algorithm generally makes an order of magnitude improvement regarding memory cost when the area is larger than 210×210. We also demonstrate the usefulness of the approximated roadmaps for coarse-to-fine pathfinding tasks.</description><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNqFiksKwjAUAIMo-D2CkAsUmjRtdV2_Owsi7kpoXyWSJvJeutDT24V7VzMwM2IzkWZJlAqVjwePpYqETO5TNid6xrEUqdjMWHl2NUIHLmjLC-8oYF8H4x33LT-CA9TWfKDhN4_eecN3Rj9Qd8SH5eKNC4AWiHjZ6yYgAC3ZpNWWYPXjgq0P-2txiqDTCK2uXmgGe1cql9tMJf_6FxDVPZs</recordid><startdate>2014</startdate><enddate>2014</enddate><creator>Yin, Quanjun</creator><creator>Qin, Long</creator><creator>Liu, Xiaocheng</creator><creator>Zha, Yabing</creator><general>Hindawi Puplishing Corporation</general><scope>ADJCN</scope><scope>AHFXO</scope></search><sort><creationdate>2014</creationdate><title>Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees</title><author>Yin, Quanjun ; Qin, Long ; Liu, Xiaocheng ; Zha, Yabing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-emarefa_primary_4729643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yin, Quanjun</creatorcontrib><creatorcontrib>Qin, Long</creatorcontrib><creatorcontrib>Liu, Xiaocheng</creatorcontrib><creatorcontrib>Zha, Yabing</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yin, Quanjun</au><au>Qin, Long</au><au>Liu, Xiaocheng</au><au>Zha, Yabing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2014</date><risdate>2014</risdate><volume>2014</volume><issue>2014</issue><spage>1</spage><epage>14</epage><pages>1-14</pages><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>In robotics, Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent the spatial topologies of their surrounding area. In this paper we consider the problem of constructing GVDs on discrete environments. Several algorithms that solve this problem exist in the literature, notably the Brushfire algorithm and its improved versions which possess local repair mechanism. However, when the area to be processed is very large or is of high resolution, the size of the metric matrices used by these algorithms to compute GVDs can be prohibitive. To address this issue, we propose an improvement on the current algorithms, using pointerless quadtrees in place of metric matrices to compute and maintain GVDs. Beyond the construction and reconstruction of a GVD, our algorithm further provides a method to approximate roadmaps in multiple granularities from the quadtree based GVD. Simulation tests in representative scenarios demonstrate that, compared with the current algorithms, our algorithm generally makes an order of magnitude improvement regarding memory cost when the area is larger than 210×210. We also demonstrate the usefulness of the approximated roadmaps for coarse-to-fine pathfinding tasks.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Puplishing Corporation</pub><tpages>14</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1024-123X
ispartof Mathematical problems in engineering, 2014, Vol.2014 (2014), p.1-14
issn 1024-123X
1563-5147
language eng
recordid cdi_emarefa_primary_472964
source Wiley Online Library Open Access; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection
title Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T11%3A26%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-emarefa&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Incremental%20Construction%20of%20Generalized%20Voronoi%20Diagrams%20on%20Pointerless%20Quadtrees&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Yin,%20Quanjun&rft.date=2014&rft.volume=2014&rft.issue=2014&rft.spage=1&rft.epage=14&rft.pages=1-14&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/&rft_dat=%3Cemarefa%3E472964%3C/emarefa%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