Efficient routing of multiple vehicles with no communication

  title={Efficient routing of multiple vehicles with no communication},
  author={Alessandro Arsie and Emilio Frazzoli},
  journal={2007 American Control Conference},
In this paper we present 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… 

Figures from this paper

Efficient routing of multiple vehicles with no explicit communications

It is demonstrated that inter-agent communication does not improve the efficiency of dynamic vehicle routing systems, but merely affects the rate of convergence to the steady state.

Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience

Borders are derived on the minimum number of agents required to ensure a given performance level, and decentralized motion coordination algorithms that approximate the optimal strategy are presented.

Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles

Three algorithms are presented and it is shown that the optimal routing policy depends on problem parameters such as the workload per vehicle and the vehicle density in the environment, and a dimensionless parameter is identified which completely captures this phase transition.

Fully non-cooperative optimal placement of mobile vehicles

This paper has introduced an appropriate utility function and require the vehicles to negotiate their choice of targets via regret matching and presents simulations that illustrate that vehicles choose the targets optimally and converge to CVTs.

Self-triggered coordination of robotic networks for optimal deployment

Sharing the load

In this article, we discussed the use of various spatial tessellations to determine, in the framework of partitioning policies, optimal workload share in a mobile robotic network. We also proposed

Inverse Agreement Protocols With Application to Distributed Multi-Agent Dispersion

A distributed inverse agreement control law for multiple kinematic agents that forces the team members to disperse in the workspace is proposed and it is proved that this lower bound coincides with the agents' sensing radius.

Optimal workload sharing for mobile robotic networks in dynamic environments

This paper takes the viewpoint that the agents can be interpreted as resources to be allocated to customers in surveillance and exploration missions, and a possible architecture for networks of autonomous agents performing distributed sensing.

An inverse agreement control strategy with application to swarm dispersion

An inverse agreement control strategy for multiple kinematic agents that forces the team members to disperse in the workspace in a distributed manner is proposed and it is proved that this lower bound coincides with the agents' sensing radius.



Decentralized algorithms for vehicle routing in a stochastic time-varying environment

  • Emilio FrazzoliF. Bullo
  • Computer Science
    2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
  • 2004
A new class of algorithms for the m-DTRP problem are presented that are spatially distributed, scalable to large networks, and adaptive to network changes, and are provably locally optimal in the light load case.

Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles

This paper analyzes the problem of m identical vehicles with unlimited capacity and shows that in heavy traffic the system time is reduced by a factor of 1/m2 over the single-server case and considers the case in which each vehicle can serve at most q customers before returning to a depot.

A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane

The model is motivated by applications in which the objective is to minimize the wait for service in a stochastic and dynamically changing environment, a departure from classical vehicle routing problems where one seeks to minimize total travel time in a static, deterministic environment.

Stochastic and dynamic vehicle routing with general demand and interarrival time distributions

This paper improves significantly the best known lower bounds for this class of problems and construct policies that are provably within a small constant factor relative to the optimal solution and shows an interesting dependence of the system performance on the demand distribution.


Two methods are compared for solving the optimization that combines task assignment, subjected to UAV capability constraints, and path planning, subjectedto dynamics, avoidance and timing constraints.

A Cooperative receding horizon controller for multivehicle uncertain environments

Conditions under which this stationarity property holds in settings that are analytically tractable are established, quantifies the cooperative properties of the controller, and includes a number of illustrative simulation examples.

Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation

We consider an autonomous vehicle-target assignment problem where a group of vehicles are expected to optimally assign themselves to a set of targets. We introduce a game-theoretical formulation of

Coverage control for mobile sensing networks

This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.

Task allocation for wide area search munitions with variable path length

This paper addresses the problem of task allocation for wide area search munitions by periodically resolving the overall optimization problem as new targets are discovered results in coordinated action by the search munitions.

Distributed Balancing of AAVs for Uniform Surveillance Coverage

  • B. MooreK. Passino
  • Computer Science
    Proceedings of the 44th IEEE Conference on Decision and Control
  • 2005
A distributed cooperative control algorithm is developed that continuously reassigns AAVs to these subtasks based on only local information in order to achieve the most balanced distribution of A AVs possible within a finite time interval of known bound.