摘要： 针对动态路网中最短路径求解算法复杂度高、计算量大、响应不及时等问题，提出基于Agent的分布式求解方法。用kd-tree将整个路网分区，每个区域由一个RMA Agent进行管理，利用多个Agent协作求解最短路径。实验表明，在路网节点较多且变化频繁时，该方法具备优势。

关键词: 最短路径, 多Agent, Dijkstra算法, 运输问题

Abstract: The shortest path algorithm in dynamic traffic network is complex and has no timely response. The problem raises Agent-Based distributed solving method. This paper divides the entire network into sub-regions with kd-tree and each region is managed by RMA Agent. The problem is solved by collaboration. Experiments show that when the nodes are numerous and have more frequent changes, this method performs better.

Key words: shortest path, multi Agent, Dijkstra algorithm, transporting problem

中图分类号: 

• TP393