Solution of Shortest Path in Dynamic Traffic Network Based on Agent

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.