The dynamic team forming problem: throughput and delay for unbiased policies

DOI10.1016/J.SYSCONLE.2009.07.001zbMath1181.93059OpenAlexW2153121790MaRDI QIDQ847121

Stephen L. Smith, Bullo, Francesco

Publication date: 12 February 2010

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2009.07.001

zbMATH Keywords

dynamic vehicle routingrobotic networksteam/coalition forming

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stochastic and dynamic routing policy using branching processes with state dependent immigration
• The shortest path and the shortest road through n points
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Topics in Intersection Graph Theory
• A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints
• Monotonic Target Assignment for Robotic Networks
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Combinatorial optimization. Theory and algorithms

This page was built for publication: The dynamic team forming problem: throughput and delay for unbiased policies