{"title":"虚拟复杂室内场景中的自动导航算法","authors":"Zeng Hong, Zhang Jundong, Jiang Ruizheng, Feng Jinhong","doi":"10.1109/ICVRV.2011.29","DOIUrl":null,"url":null,"abstract":"To meet the demand for efficient automatic navigation in virtual complex indoor scenes, this paper presents an automatic navigation algorithm. The algorithm uses Dijkstra algorithm for path planning on complex indoor scenes graph, and uses the adaptive vector length algorithm for Bezier curve control point to smooth the path. The paper indicates that path planning in indoor scene is a weighted and non oriented graph's shortest path problem. The paper gives the shortest path searching step by Dijkstra algorithm. In order to eliminate the vision dither phenomenon and enhance the immersed feeling during navigation, the paper uses Bezier curve to smooth path. According to the path included angle and distance between nodes, the paper proposes an adaptive vector length algorithm for curve control point. Finally, an example about marine engine room virtual scene navigation system was given. The algorithm given in this paper was demonstrated to be significant in complex indoor scene navigation.","PeriodicalId":239933,"journal":{"name":"2011 International Conference on Virtual Reality and Visualization","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automatic Navigation Algorithm in Virtual Complex Indoor Scenes\",\"authors\":\"Zeng Hong, Zhang Jundong, Jiang Ruizheng, Feng Jinhong\",\"doi\":\"10.1109/ICVRV.2011.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To meet the demand for efficient automatic navigation in virtual complex indoor scenes, this paper presents an automatic navigation algorithm. The algorithm uses Dijkstra algorithm for path planning on complex indoor scenes graph, and uses the adaptive vector length algorithm for Bezier curve control point to smooth the path. The paper indicates that path planning in indoor scene is a weighted and non oriented graph's shortest path problem. The paper gives the shortest path searching step by Dijkstra algorithm. In order to eliminate the vision dither phenomenon and enhance the immersed feeling during navigation, the paper uses Bezier curve to smooth path. According to the path included angle and distance between nodes, the paper proposes an adaptive vector length algorithm for curve control point. Finally, an example about marine engine room virtual scene navigation system was given. The algorithm given in this paper was demonstrated to be significant in complex indoor scene navigation.\",\"PeriodicalId\":239933,\"journal\":{\"name\":\"2011 International Conference on Virtual Reality and Visualization\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Virtual Reality and Visualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICVRV.2011.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Virtual Reality and Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVRV.2011.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic Navigation Algorithm in Virtual Complex Indoor Scenes
To meet the demand for efficient automatic navigation in virtual complex indoor scenes, this paper presents an automatic navigation algorithm. The algorithm uses Dijkstra algorithm for path planning on complex indoor scenes graph, and uses the adaptive vector length algorithm for Bezier curve control point to smooth the path. The paper indicates that path planning in indoor scene is a weighted and non oriented graph's shortest path problem. The paper gives the shortest path searching step by Dijkstra algorithm. In order to eliminate the vision dither phenomenon and enhance the immersed feeling during navigation, the paper uses Bezier curve to smooth path. According to the path included angle and distance between nodes, the paper proposes an adaptive vector length algorithm for curve control point. Finally, an example about marine engine room virtual scene navigation system was given. The algorithm given in this paper was demonstrated to be significant in complex indoor scene navigation.