Ant Colony Optimization
Transportation Science
A Framework for Dynamic Car and Taxi Pools with the Use of Positioning Systems
COMPUTATIONWORLD '09 Proceedings of the 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns
A review of the applications of agent technology in traffic and transportation systems
IEEE Transactions on Intelligent Transportation Systems
A Decentralized Approach for Anticipatory Vehicle Routing Using Delegate Multiagent Systems
IEEE Transactions on Intelligent Transportation Systems
Coordinated look-ahead scheduling for real-time traffic signal control
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
Hi-index | 0.00 |
In this paper, we propose an anticipatory stigmergy model for decentralized traffic congestion management. Managing traffic congestion is one of the main issues for smart cities, and many works have been trying to address it from the IT and Transportation research perspectives. Recently, dynamic coordination methods are becoming possible using the more short-term traffic information that can be provided by probe-vehicle information or smart phones. Some approaches have been trying to handle short-term traffic information in which a stigmergy-based approach is employed as an indirect communication method for cooperation among distributed agents and for managing traffic congestion. One drawback of these approaches is that handling near-future congestion remains problematic because stigmergies are essentially based on past information. In this paper, we propose anticipatory stigmergy for sharing information on near-future traffic and allocating drivers adequately. In this model, all vehicles submit their near-future intention as anticipatory stigmergy to research their routes. Our preliminary results demonstrate that anticipatory stigmergy with allocation strategy works well.