大规模虚拟人群实时路径规划

Yongqing Ye, Qingge Ji
{"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}
引用次数: 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信