检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《交通标准化》2009年第23期25-27,共3页Communications Standardization
摘 要:复杂二维场景中的行人路径规划是行人仿真研究体系中微观仿真服务的关键性问题之一。针对该问题提出基于离散势能场的路径规划算法,给出总体算法的流程,并针对离散势能场的生成算法、离散路径的合理化方法等关键环节进行详细论述,最后经算例证明该算法具有一定的有效性,同时存在一定的局限性。Path planning for pedestrian in complex 2D scenario is important technique serving for microscopic simulation. A path planning algorithm is provided based on discrete potential field. The whole execute flow of mentioned algorithm is given, and several key techniques such as the generation algorithm for discrete potential field and the polish method for discrete path are explained in detail. Finally, numerical examples are given to demonstrate the feasibility of the developed algorithm and its objective limitation for application is pointed out.
分 类 号:U491.226[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117