欢迎来到天天文库
浏览记录
ID:33927372
大小:1.85 MB
页数:31页
时间:2019-02-28
《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)SIZCdatastructuresuchthatthedl4、dm0(1)hme.Thealgorithmcandsobcusedtocomputeshortestpathsforthemovementofadisk(sothatoptimalmovementforarbltra~objectscanbecomputedtotheaccuracyofenclosingthemwiththesmallestpossibled]sk).CatcgcmesandSubjectDescriptors:F.2.2[AnalysisofAlgorithmsandProblemComplexity]:NonnumcrudAlgorithmsandProblems5、GeneralTerms:Algorithms,PerformanceAdditionalKeyWordsandPhrases:Euclldeimplane,mmimalmovementproblem,motionplanning,mover’sproblem.polygonalobstacles,robotics,shortestpath1.IntroductionTheclassicalrnoler’sproblcr~lis:Givenasourcepointandadestinationpoi?ltalongwithasetofpolyhedralobstaclesintwoort6、hreedimensionalEuclideanThisptipcrwascompletedinApr]l19S5[RelfandStorer,1985]andwassubmittedtothisjournalmJune1985;atthattimeandduringtheprecedingyearwhentheresearchwasundertaken,J.StorerwaspdrtiallysupportedbyNSFgruntnumberDCR84-03244andJ.Rclfwaspart]allysupportedbytheOfficeofNtwalRestxirchgrant7、numberNOOO-14-80-C-0647,whilevisitingtheLaboratoryforComputerScienceatMITAuthors’~ddrcsses,J.A,Storer,ComputerScienceDepartment,CentcxforComplexSystems,BrarrdclsUnivcrs]ty.Waltharn,MA02254.J.HReif,ComputerScienceDepart
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
此文档下载收益归作者所有