{"title":"Evaluation of real-time search algorithms in dynamic worlds (summary of results)","authors":"S. Shekhar, B. Hamidzadeh","doi":"10.1109/TAI.1992.246379","DOIUrl":null,"url":null,"abstract":"A classification of different dynamic worlds is presented. A detailed model of a dynamic world where changes occur in edge costs around a zero mean is provided. A formal analysis of the model suggests that the static rank ordering of solution paths is preserved in the model. Two real-time search algorithms, DYNORAII and RTA*, for the real-time path planning problem are analyzed. Results on the path planning problem using the proposed dynamic model of graphs are given. The ability of DYNORAII and RTA* to minimize response times in dynamic environments has been evaluated experimentally. It is found that DYNORAII outperforms RTA* in minimizing response times.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246379","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
A classification of different dynamic worlds is presented. A detailed model of a dynamic world where changes occur in edge costs around a zero mean is provided. A formal analysis of the model suggests that the static rank ordering of solution paths is preserved in the model. Two real-time search algorithms, DYNORAII and RTA*, for the real-time path planning problem are analyzed. Results on the path planning problem using the proposed dynamic model of graphs are given. The ability of DYNORAII and RTA* to minimize response times in dynamic environments has been evaluated experimentally. It is found that DYNORAII outperforms RTA* in minimizing response times.<>