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

DOI10.1016/J.SYSCONLE.2009.07.001MaRDI QIDQ847121zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic vehicle routingrobotic networksteam/coalition forming

Mathematics Subject Classification ID

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

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

Cites work

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

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)