Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications

DOI10.1080/00207179.2016.1144237zbMath1353.93105OpenAlexW2279398293MaRDI QIDQ2954069

Antonio Pietrabissa

Publication date: 11 January 2017

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179.2016.1144237

zbMATH Keywords

distributed controlmulti-vehicle routingVoronoi partitioning

Mathematics Subject Classification ID

Related Items (1)

Cooperative receding horizon strategies for the multivehicle routing problem

Cites Work

• Self-triggered coordination of robotic networks for optimal deployment
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations
• A review of dynamic vehicle routing problems
• Linear temporal logic vehicle routing with applications to multi-UAV mission planning
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
• Awareness Coverage Control Over Large-Scale Domains With Intermittent Communications
• Cooperative Minimum Time Surveillance With Multiple Ground Vehicles
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment
• Bayesian‐Based Domain Search Using Multiple Autonomous Vehicles with Intermittent Information Sharing

This page was built for publication: Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications