{"title":"大规模虚拟人群实时路径规划","authors":"Yongqing Ye, Qingge Ji","doi":"10.1109/IIH-MSP.2007.254","DOIUrl":null,"url":null,"abstract":"We present a two-level structure algorithm for real-time path planning of massive crowd. We use the first level algorithm to calculate the global path, and set a provisional target point for each virtual character. Then we use the second level algorithm to calculate the path to the provisional target point for each virtual character. As shown the simulation results, the proposed algorithm can design a collision-free path for every virtual character with a distinct goal in realtime.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"310 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Real-Time Path Planning of Large-scale Virtual Crowd\",\"authors\":\"Yongqing Ye, Qingge Ji\",\"doi\":\"10.1109/IIH-MSP.2007.254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a two-level structure algorithm for real-time path planning of massive crowd. We use the first level algorithm to calculate the global path, and set a provisional target point for each virtual character. Then we use the second level algorithm to calculate the path to the provisional target point for each virtual character. As shown the simulation results, the proposed algorithm can design a collision-free path for every virtual character with a distinct goal in realtime.\",\"PeriodicalId\":385132,\"journal\":{\"name\":\"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)\",\"volume\":\"310 8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIH-MSP.2007.254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIH-MSP.2007.254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Real-Time Path Planning of Large-scale Virtual Crowd
We present a two-level structure algorithm for real-time path planning of massive crowd. We use the first level algorithm to calculate the global path, and set a provisional target point for each virtual character. Then we use the second level algorithm to calculate the path to the provisional target point for each virtual character. As shown the simulation results, the proposed algorithm can design a collision-free path for every virtual character with a distinct goal in realtime.