Fully non-cooperative optimal placement of mobile vehicles

In this paper, we consider optimal placement of autonomous mobile vehicles such that a cost function involving all the vehicles and possible locations of targets is minimized. This cost is proportional to the distance between the targets and vehicles. The optimal locations correspond to the vehicles being at the centroids of their own Voronoi cell which correspond to Centroidal Voronoi Tessellations (CVTs). We have adopted a game theoretical formulation to initially consider vehicle target assignment where a set of mobile vehicles choose their own targets. The movement of the vehicles towards the optimal locations is based on MacQueenpsilas algorithm. But an important step of MacQueen's algorithm requires the knowledge of the nearest neighbour to be determined from a sample that is drawn from a fixed but unknown probability distribution. This calculation seems to be implicit in reported algorithms and brings in a hidden centralized process. We have used game theory as a framework to get around this problem and modelled the vehicles such that they are capable of making their own decisions and interested in optimizing their own utilities. Specifically, we have introduced an appropriate utility function and require the vehicles to negotiate their choice of targets via regret matching. We present simulations that illustrate that vehicles choose the targets optimally and converge to CVTs.

[1]  Samuel Matlin,et al.  A Review of the Literature on the Missile-Allocation Problem , 1970, Oper. Res..

[2]  Andreu Mas-Colell,et al.  A General Class of Adaptive Strategies , 1999, J. Econ. Theory.

[3]  Atsuo Suzuki,et al.  Locational optimization problems solved through Voronoi diagrams , 1997 .

[4]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[5]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[6]  Timothy W. McLain,et al.  Coordinated target assignment and intercept for unmanned air vehicles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[7]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[8]  A. Arsie,et al.  Efficient routing of multiple vehicles with no communication , 2007, 2007 American Control Conference.

[9]  Panos M. Pardalos,et al.  Nonlinear assignment problems : algorithms and applications , 2000 .

[10]  F. Bullo,et al.  Decentralized algorithms for vehicle routing in a stochastic time-varying environment , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[11]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[12]  Kevin M. Passino,et al.  Cooperative scheduling of tasks for networked uninhabited autonomous vehicles , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[13]  Robert Murphey,et al.  Target-Based Weapon Target Assignment Problems , 2000 .

[14]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[15]  Chou-Yuan Lee,et al.  Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[16]  S. Hart,et al.  A general class of adaptative strategies , 1999 .

[17]  Drew Fudenberg,et al.  Game theory (3. pr.) , 1991 .

[18]  Jason R. Marden,et al.  Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation , 2007 .

[19]  Manuela Veloso,et al.  An Analysis of Stochastic Game Theory for Multiagent Reinforcement Learning , 2000 .

[20]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[21]  Sergiu Hart,et al.  Regret-based continuous-time dynamics , 2003, Games Econ. Behav..

[22]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[23]  S. Hart,et al.  A simple adaptive procedure leading to correlated equilibrium , 2000 .

[24]  Qiang Du,et al.  Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations , 2002, Parallel Comput..

[25]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..