Starting from the problems of nowadays' urban traffic (congestions, imperfect timing of traffic lights, high impact of lane changes) we investigate the feasibility of a cooperative intelligent agent based solution as an overall control scheme governing the car flow in congested urban intersections.The proposed complex solution features both the intelligent traffic control and the car platooning. In order to test and verify the merits of the proposed solution in urban intersection of a widely variable topology, but also to support our future research aims, a simulation platform, extending the basic functionalities of SUMO with the options of intelligent communication and cooperative co-acting, was designed and developed.
With the rapid evolution of Internet-of-Things (IoT) devices and the emergence of Autonomous Vehicles (AVs), machine learning processes pose a growing privacy issue. Federated learning (FL) and current cryptography can mitigate this problem; however, these solutions might not be efficient enough during the decades-long lifespans of such gadgets.
In this paper, a generalization of FL schemes, incorporating sharing a part of raw data, is presented with a proof-of-concept experiment. Besides anonymization, the exchanged data portion can also directly support real-time decision-making. In contrast with cryptographical approaches, the proposed FL scheme can guarantee a certain level of privacy during the whole lifetime of IoT devices or AVs.
Autonomous vehicles, communicating with each other and with the urban infrastructure as well, open opportunity to introduce new, complex and effective behaviours to the intelligent traffic systems. Such systems can be perceived quite naturally as hierarchically built intelligent multi-agent systems, with the decision making based upon well-defined and profoundly tested mathematical algorithms, borrowed e.g. from the field of information technology. In this article, two examples of how to adapt such algorithms to the intelligent urban traffic are presented. Since the optimal and fair timing of the traffic lights is crucial in the traffic control, we show how a simple Round-Robin scheduler and Minimal Destination Distance First scheduling (adaptation of the theoretically optimal Shortest Job First scheduler) were implemented and tested for traffic light control. Another example is the mitigation of the congested traffic using the analogy of the Explicit Congestion Notification (ECN) protocol of the computer networks. We show that the optimal scheduling based traffic light control can handle roughly the same complexity of the traffic as the traditional light programs in the nominal case. However, in extraordinary and especially fastly evolving situations, the intelligent solutions can clearly outperform the traditional ones. The ECN based method can successfully limit the traffic flowing through bounded areas. That way the number of passing-through vehicles in e.g. residential areas may be reduced, making them more comfortable congestion-free zones in a city.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.