The algorithm design to get the shortest path of city traffic using multi agent

The complexion of the road in the city changed with the time, the shortest path will be changed when the vehicle is running. The paper analyses the shortcomings of traditional shortest path algorithm, then provides a model of real-time shortest path under the dynamic environment based on multi agent cooperation. Single agent state information and a multi agent negotiation algorithm are designed in the model. It can be adapt to changes in real-time traffic environment. It can be concluded from the simulation of Dalian partial sections that the algorithm is more adjustable and timely when the network node is changed.