{"title":"基于可见性修复的混合进化路径规划","authors":"G. Dozier, A. Esterline, A. Homaifar, M. Bikdash","doi":"10.1145/2817460.2817468","DOIUrl":null,"url":null,"abstract":"This paper introduces a hybrid evolutionary system for globel path planning within unstructured environments. This hybrid system combines a novel representation for obstacles within an environment, the concept of evolutionary search and a new concept we refer to as visibility-based repair to form a hybrid which quickly transforms infeasible paths into feasible ones. Our hybrid evolutionary system differs from other evolutionary path planners in that (1) more emphasis is placed on repairing infeasible paths to develop feasible paths rather than using simulated evolution exclusively as a means of discovering feasible paths and (2) a continuous map of the environment is used rather than a discretized map. In this paper, we demonstrate the effectiveness of this new hybrid system by using three challenging path planning problems.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Hybrid evolutionary path planning via visibility-based repair\",\"authors\":\"G. Dozier, A. Esterline, A. Homaifar, M. Bikdash\",\"doi\":\"10.1145/2817460.2817468\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a hybrid evolutionary system for globel path planning within unstructured environments. This hybrid system combines a novel representation for obstacles within an environment, the concept of evolutionary search and a new concept we refer to as visibility-based repair to form a hybrid which quickly transforms infeasible paths into feasible ones. Our hybrid evolutionary system differs from other evolutionary path planners in that (1) more emphasis is placed on repairing infeasible paths to develop feasible paths rather than using simulated evolution exclusively as a means of discovering feasible paths and (2) a continuous map of the environment is used rather than a discretized map. In this paper, we demonstrate the effectiveness of this new hybrid system by using three challenging path planning problems.\",\"PeriodicalId\":274966,\"journal\":{\"name\":\"ACM-SE 35\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 35\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2817460.2817468\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 35","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2817460.2817468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hybrid evolutionary path planning via visibility-based repair
This paper introduces a hybrid evolutionary system for globel path planning within unstructured environments. This hybrid system combines a novel representation for obstacles within an environment, the concept of evolutionary search and a new concept we refer to as visibility-based repair to form a hybrid which quickly transforms infeasible paths into feasible ones. Our hybrid evolutionary system differs from other evolutionary path planners in that (1) more emphasis is placed on repairing infeasible paths to develop feasible paths rather than using simulated evolution exclusively as a means of discovering feasible paths and (2) a continuous map of the environment is used rather than a discretized map. In this paper, we demonstrate the effectiveness of this new hybrid system by using three challenging path planning problems.