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

DOI10.1016/J.SYSCONLE.2009.07.001zbMATH Open1181.93059OpenAlexW2153121790MaRDI QIDQ847121FDOQ847121

Authors: Stephen Smith, Francesco Bullo 

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

Recommendations

• Dynamic policies for uncertain time‐critical tasking problems
• A geometric assignment problem for robotic networks
• New policies for the dynamic traveling salesman problem
• Team assembling problem for asynchronous heterogeneous mobile robots
• Deterministic and stochastic scheduling with teamwork tasks

zbMATH Keywords

dynamic vehicle routingrobotic networksteam/coalition forming

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Topics in Intersection Graph Theory
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Title not available (Why is that?)
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• A stochastic and dynamic routing policy using branching processes with state dependent immigration
• Title not available (Why is that?)
• The shortest path and the shortest road through n points
• Combinatorial optimization. Theory and algorithms
• Optimal throughput-delay scaling in wireless networks. I: The fluid model
• A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints
• Monotonic Target Assignment for Robotic Networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847121)