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

@article{Smith2009TheDT,
  title={The dynamic team forming problem: Throughput and delay for unbiased policies},
  author={Stephen L. Smith and Francesco Bullo},
  journal={Systems & Control Letters},
  year={2009},
  volume={58},
  pages={709-715}
}
The dynamic team forming problem (DTFP) for a heterogeneous group of robots is described as follows. Each robot is capable of providing a specific service. Tasks arrive sequentially over time, assume random locations in the environment, and require several different services. A task is completed when a team of robots travels to the task location and provides the required services. The goal is to minimize the expected delay between a task’s arrival and its completion. We restrict our attention… CONTINUE READING
BETA
Tweets
This paper has been referenced on Twitter 2 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Similar Papers

Loading similar papers…