File Download
 
Links for fulltext
(May Require Subscription)
  • Find via
 
Supplementary

Conference Paper: CVT-based 2D motion planning with maximal clearance
  • Basic View
  • Metadata View
  • XML View
TitleCVT-based 2D motion planning with maximal clearance
 
AuthorsZheng, L
Choi, YK
Liu, X
Wang, WP
 
Issue Date2011
 
PublisherIEEE, Computer Society.
 
CitationThe 2011 IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 9-13 May 2011. In Proceedings of the IEEE-ICRA, 2011, p. 2281-2287 [How to Cite?]
 
AbstractMaximal clearance is an important property that is highly desirable in multi-agent motion planning. However, it is also inherently difficult to attain. We propose a novel approach to achieve maximal clearance by exploiting the ability of evenly distributing a set of points by a centroidal Voronoi tessellation (CVT). We adapt the CVT framework to multi-agent motion planning by adding an extra time dimension and optimize the trajectories of the agents in the augmented domain. As an optimization framework, our method can work naturally on complex regions. We demonstrate the effectiveness of our algorithm in achieving maximal clearance in motion planning with some examples.
 
ISSN1050-4729
2013 SCImago Journal Rankings: 0.628
 
DC FieldValue
dc.contributor.authorZheng, L
 
dc.contributor.authorChoi, YK
 
dc.contributor.authorLiu, X
 
dc.contributor.authorWang, WP
 
dc.date.accessioned2011-09-23T06:04:39Z
 
dc.date.available2011-09-23T06:04:39Z
 
dc.date.issued2011
 
dc.description.abstractMaximal clearance is an important property that is highly desirable in multi-agent motion planning. However, it is also inherently difficult to attain. We propose a novel approach to achieve maximal clearance by exploiting the ability of evenly distributing a set of points by a centroidal Voronoi tessellation (CVT). We adapt the CVT framework to multi-agent motion planning by adding an extra time dimension and optimize the trajectories of the agents in the augmented domain. As an optimization framework, our method can work naturally on complex regions. We demonstrate the effectiveness of our algorithm in achieving maximal clearance in motion planning with some examples.
 
dc.description.naturepublished_or_final_version
 
dc.description.otherThe 2011 IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 9-13 May 2011. In Proceedings of the IEEE-ICRA, 2011, p. 2281-2287
 
dc.identifier.citationThe 2011 IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 9-13 May 2011. In Proceedings of the IEEE-ICRA, 2011, p. 2281-2287 [How to Cite?]
 
dc.identifier.epage2287
 
dc.identifier.hkuros196317
 
dc.identifier.issn1050-4729
2013 SCImago Journal Rankings: 0.628
 
dc.identifier.openurl
 
dc.identifier.spage2281
 
dc.identifier.urihttp://hdl.handle.net/10722/140007
 
dc.languageeng
 
dc.publisherIEEE, Computer Society.
 
dc.relation.ispartofProceedings of the IEEE International Conference on Robotics and Automation
 
dc.rightsIEEE International Conference on Robotics and Automation Proceedings. Copyright © IEEE, Computer Society.
 
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License
 
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
 
dc.titleCVT-based 2D motion planning with maximal clearance
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Zheng, L</contributor.author>
<contributor.author>Choi, YK</contributor.author>
<contributor.author>Liu, X</contributor.author>
<contributor.author>Wang, WP</contributor.author>
<date.accessioned>2011-09-23T06:04:39Z</date.accessioned>
<date.available>2011-09-23T06:04:39Z</date.available>
<date.issued>2011</date.issued>
<identifier.citation>The 2011 IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 9-13 May 2011. In Proceedings of the IEEE-ICRA, 2011, p. 2281-2287</identifier.citation>
<identifier.issn>1050-4729</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/140007</identifier.uri>
<description.abstract>Maximal clearance is an important property that is highly desirable in multi-agent motion planning. However, it is also inherently difficult to attain. We propose a novel approach to achieve maximal clearance by exploiting the ability of evenly distributing a set of points by a centroidal Voronoi tessellation (CVT). We adapt the CVT framework to multi-agent motion planning by adding an extra time dimension and optimize the trajectories of the agents in the augmented domain. As an optimization framework, our method can work naturally on complex regions. We demonstrate the effectiveness of our algorithm in achieving maximal clearance in motion planning with some examples.</description.abstract>
<language>eng</language>
<publisher>IEEE, Computer Society.</publisher>
<relation.ispartof>Proceedings of the IEEE International Conference on Robotics and Automation</relation.ispartof>
<rights>IEEE International Conference on Robotics and Automation Proceedings. Copyright &#169; IEEE, Computer Society.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<rights>&#169;2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</rights>
<title>CVT-based 2D motion planning with maximal clearance</title>
<type>Conference_Paper</type>
<identifier.openurl>http://library.hku.hk:4550/resserv?sid=HKU:IR&amp;issn=1050-4729&amp;volume=&amp;spage=2281&amp;epage=2287&amp;date=2011&amp;atitle=CVT-based+2D+motion+planning+with+maximal+clearance</identifier.openurl>
<description.nature>published_or_final_version</description.nature>
<identifier.hkuros>196317</identifier.hkuros>
<identifier.spage>2281</identifier.spage>
<identifier.epage>2287</identifier.epage>
<description.other>The 2011 IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 9-13 May 2011. In Proceedings of the IEEE-ICRA, 2011, p. 2281-2287</description.other>
<bitstream.url>http://hub.hku.hk/bitstream/10722/140007/1/Content.pdf</bitstream.url>
</item>