Robotic Wireless Networks in a Narrow Alley: A Game Theoretic Approach
This addresses coordination challenges for autonomous vehicles in constrained environments, but it is incremental as it applies game theory to a specific scenario.
The paper tackles the problem of autonomous vehicle groups competing in a narrow alley, aiming to minimize travel distance while avoiding blockage, and investigates how wireless communications can lead to near-Pareto optimum solutions, with implementation on a vehicular test-bed using networked robots with sensors and ZigBee modules.
There are many situations where vehicles may compete with each other to maximize their respective utilities.We consider a narrow alley where two groups, eastbound and westbound, of autonomous vehicles are heading toward each of their destination to minimize their travel distance. However, if the two groups approach the road simultaneously, it will be blocked. The main goal of this paper is to investigate how wireless communications among the vehicles can lead the solution near to Pareto optimum. In addition, we implemented such a vehicular test-bed, composed of networked robots that have an infrared sensor, a DC motor, and a wireless communication module: ZigBee (IEEE 802.15.4).