Efficient routing of multiple vehicles with no communications

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to International International Journal of Robust and Nonlinear Control, 32 pages

Scientific paper

In this paper we consider a class of dynamic vehicle routing problems, in which a number of mobile agents in the plane must visit target points generated over time by a stochastic process. It is desired to design motion coordination strategies in order to minimize the expected time between the appearance of a target point and the time it is visited by one of the agents. We propose control strategies that, while making minimal or no assumptions on communications between agents, provide the same level of steady-state performance achieved by the best known decentralized strategies. In other words, we demonstrate that inter-agent communication does not improve the efficiency of such systems, but merely affects the rate of convergence to the steady state. Furthermore, the proposed strategies do not rely on the knowledge of the details of the underlying stochastic process. Finally, we show that our proposed strategies provide an efficient, pure Nash equilibrium in a game theoretic formulation of the problem, in which each agent's objective is to maximize the number of targets it visits. Simulation results are presented and discussed.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient routing of multiple vehicles with no communications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient routing of multiple vehicles with no communications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient routing of multiple vehicles with no communications will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-130376

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.