shortest paths in the plane with polygonal obstacles

shortest paths in the plane with polygonal obstacles

ID:33927372

大小:1.85 MB

页数:31页

时间:2019-02-28

shortest paths in the plane with polygonal obstacles_第1页
shortest paths in the plane with polygonal obstacles_第2页
shortest paths in the plane with polygonal obstacles_第3页
shortest paths in the plane with polygonal obstacles_第4页
shortest paths in the plane with polygonal obstacles_第5页
资源描述:

《shortest paths in the plane with polygonal obstacles》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、ShortestPathsinthePlanewithPolygonalObstaclesJAMESA.STORERBrwuksUniLwslty,Htiltham,MassachusettsANDJOHNH.REIFDakeUnl[er,slty,Dnrham,NorthCarolinaAbstmctWepresentapracticalalgorithmforfindingmimmum-lengthpathsbetweenpointsintheEuclideanplanewith(notnecessarilyconvex)polygonalobstacles.Pr]ortothisw

2、ork,thebestknownalgorithmforfindingtheshortestpathbetweentwopointsintheplanerequiredfl(n~logjt)t]mcand0(n~)space,where;Zdenotesthenumberofobstacleedges.AssummgthatatriangulationoraVoronoiLl]agramfortheobstaclespaceisprowdedwiththeinput(ifisnot,eitheronecanbeprecomputcdinO(nlogn)time),wepresentan(

3、Xkn)t]mealgorithm,whereIidenotesthenumberof“Aands”(connectedcomponents)]ntheobstaclespace.Thealgorithmusesonly0(/Z)spaceand,gwcnasourcepoints,producesan0(n)SIZCdatastructuresuchthatthedl

4、dm0(1)hme.Thealgorithmcandsobcusedtocomputeshortestpathsforthemovementofadisk(sothatoptimalmovementforarbltra~objectscanbecomputedtotheaccuracyofenclosingthemwiththesmallestpossibled]sk).CatcgcmesandSubjectDescriptors:F.2.2[AnalysisofAlgorithmsandProblemComplexity]:NonnumcrudAlgorithmsandProblems

5、GeneralTerms:Algorithms,PerformanceAdditionalKeyWordsandPhrases:Euclldeimplane,mmimalmovementproblem,motionplanning,mover’sproblem.polygonalobstacles,robotics,shortestpath1.IntroductionTheclassicalrnoler’sproblcr~lis:Givenasourcepointandadestinationpoi?ltalongwithasetofpolyhedralobstaclesintwoort

6、hreedimensionalEuclideanThisptipcrwascompletedinApr]l19S5[RelfandStorer,1985]andwassubmittedtothisjournalmJune1985;atthattimeandduringtheprecedingyearwhentheresearchwasundertaken,J.StorerwaspdrtiallysupportedbyNSFgruntnumberDCR84-03244andJ.Rclfwaspart]allysupportedbytheOfficeofNtwalRestxirchgrant

7、numberNOOO-14-80-C-0647,whilevisitingtheLaboratoryforComputerScienceatMITAuthors’~ddrcsses,J.A,Storer,ComputerScienceDepartment,CentcxforComplexSystems,BrarrdclsUnivcrs]ty.Waltharn,MA02254.J.HReif,ComputerScienceDepart

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。