Skip to main content
SpringerLink
Log in

Distributed Planning for Serving Cooperative Tasks with Time Windows: A Game Theoretic Approach

  • Regular paper
  • Published:
Journal of Intelligent & Robotic Systems Aims and scope Submit manuscript

Abstract

We study distributed planning for multi-robot systems to provide optimal service to cooperative tasks that are distributed over space and time. Each task requires service by sufficiently many robots at the specified location within the specified time window. Tasks arrive over episodes and the robots try to maximize the total value of service in each episode by planning their own trajectories based on the specifications of incoming tasks. Robots are required to start and end each episode at their assigned stations in the environment. We present a game theoretic solution to this problem by mapping it to a game, where the action of each robot is its trajectory in an episode, and using a suitable learning algorithm to obtain optimal joint plans in a distributed manner. We present a systematic way to design minimal action sets (subsets of feasible trajectories) for robots based on the specifications of incoming tasks to facilitate fast learning. We then provide the performance guarantees for the cases where all the robots follow a best response or noisy best response algorithm to iteratively plan their trajectories. While the best response algorithm leads to a Nash equilibrium, the noisy best response algorithm leads to globally optimal joint plans with high probability. We show that the proposed game can in general have arbitrarily poor Nash equilibria, which makes the noisy best response algorithm preferable unless the task specifications are known to have some special structure. We also describe a family of special cases where all the equilibria are guaranteed to have bounded suboptimality. Simulations and experimental results are provided to demonstrate the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aksaray, D., Vasile, C.I., Belta, C.: Dynamic Routing of Energy-Aware Vehicles with Temporal Logic Constraints. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 3141–3146 (2016)

  2. Andersson, B., Tovar, E.: Multiprocessor Scheduling with Few Preemptions. In: IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 322–334. IEEE (2006)

  3. Arsie, A., Savla, K., Frazzoli, E.: Efficient routing algorithms for multiple vehicles with no explicit communications. IEEE Trans. Autom. Control 54(10), 2302–2317 (2009)

    Article  MathSciNet  Google Scholar 

  4. Arslan, G., Marden, J., Shamma, J.S.: Autonomous vehicle-target assignment: a game theoretical formulation. ASME J. Dyn. Syst. Measur. Control, 584–596 (2007)

  5. Asadpour, A., Saberi, A.: On the Inefficiency Ratio of Stable Equilibria in Congestion Games. In: International Workshop on Internet and Network Economics, pp. 545–552. Springer (2009)

  6. Babichenko, Y., Tamuz, O.: Graphical potential games. J. Econ. Theory 163, 889–899 (2016)

    Article  MathSciNet  Google Scholar 

  7. Bennewitz, M., Burgard, W., Thrun, S.: Optimizing Schedules for Prioritized Path Planning of Multi-Robot Systems. In: IEEE International Conference on Robotics and Automation, vol. 1, pp. 271–276 (2001)

  8. Bhat, R., Yazıcıoġlu, Y., Aksaray, D.: Distributed path planning for executing cooperative tasks with time windows. IFAC-PapersOnLine 52(20), 187–192 (2019)

    Article  Google Scholar 

  9. Bhattacharya, S., Likhachev, M., Kumar, V.: Multi-Agent Path Planning with Multiple Tasks and Distance Constraints. In: IEEE International Conference on Robotics and Automation, pp. 953–959 (2010)

  10. Blume, L.E.: The statistical mechanics of strategic interaction. Games Econ. Behav. 5(3), 387–424 (1993)

    Article  MathSciNet  Google Scholar 

  11. Borowski, H., Marden, J.R.: Fast convergence in semianonymous potential games. IEEE Trans. Control Netw. Syst. 4(2), 246–258 (2015)

    Article  MathSciNet  Google Scholar 

  12. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006)

    Article  MathSciNet  Google Scholar 

  13. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends®; Mach. Learn. 3(1), 1–122 (2011)

    MATH  Google Scholar 

  14. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transport. Sci. 39(1), 104–118 (2005)

    Article  Google Scholar 

  15. Bu, L., Babu, R., De Schutter, B., et al.: A comprehensive survey of multiagent reinforcement learning. IEEE Trans. Syst. Man Cybern. Part C (Appl Rev.) 38(2), 156–172 (2008)

    Article  Google Scholar 

  16. Bullo, F., Frazzoli, E., Pavone, M., Savla, K., Smith, S.L.: Dynamic vehicle routing for robotic systems. Proc. IEEE 99(9), 1482–1504 (2011)

    Article  Google Scholar 

  17. Buyukkocak, A.T., Aksaray, D., Yazıcıoġlu, Y.: Planning of heterogeneous multi-agent systems under signal temporal logic specifications with integral predicates. IEEE Robot. Autom. Lett. 6(2), 1375–1382 (2021)

    Article  Google Scholar 

  18. Claes, D., Oliehoek, F., Baier, H., Tuyls, K., et al.: Decentralised Online Planning for Multi-Robot Warehouse Commissioning. In: International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 492–500 (2017)

  19. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8), 928–936 (2001)

    Article  Google Scholar 

  20. Dai, W., Lu, H., Xiao, J., Zheng, Z.: Task allocation without communication based on incomplete information game theory for multi-robot systems. J. Intell. Robot. Syst. 94(3-4), 841–856 (2019)

    Article  Google Scholar 

  21. Durand, S., Gaujal, B.: Complexity and Optimality of the Best Response Algorithm in Random Potential Games. In: International Symposium on Algorithmic Game Theory, pp. 40–51. Springer (2016)

  22. Ellison, G.: Learning, local interaction, and coordination. Econometrica: J. Econ. Soc., 1047–1071 (1993)

  23. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: International Colloquium on Automata, Languages, and Programming, pp. 502–513. Springer (2003)

  24. Gombolay, M.C., Wilcox, R.J., Shah, J.A.: Fast scheduling of robot teams performing tasks with temporospatial constraints. IEEE Trans. Robot. 34(1), 220–239 (2018)

    Article  Google Scholar 

  25. Guo, Y., Parker, L.E.: A Distributed and Optimal Motion Planning Approach for Multiple Mobile Robots. In: IEEE International Conference on Robotics and Automation, vol. 3, pp. 2612–2619 (2002)

  26. Kapoutsis, A.C., Chatzichristofis, S.A., Kosmatopoulos, E.B.: Darp: divide areas algorithm for optimal multi-robot coverage path planning. J. Intell. Robot. Syst. 86(3-4), 663–680 (2017)

    Article  Google Scholar 

  27. Kreindler, G.E., Young, H.P.: Fast convergence in evolutionary equilibrium selection. Games Econ. Behav. 80, 39–67 (2013)

    Article  MathSciNet  Google Scholar 

  28. Kress-Gazit, H., Fainekos, G.E., Pappas, G.J.: Temporal-logic-based reactive mission and motion planning. IEEE Trans. Tobotics 25(6), 1370–1381 (2009)

    Article  Google Scholar 

  29. Li, B., Moridian, B., Kamal, A., Patankar, S., Mahmoudian, N.: Multi-robot mission planning with static energy replenishment. J. Intell. Robot. Syst. 95(2), 745–759 (2019)

    Article  Google Scholar 

  30. Marden, J.R., Arslan, G., Shamma, J.S.: Cooperative control and potential games. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 39(6), 1393–1407 (2009)

    Article  Google Scholar 

  31. Michael, N., Zavlanos, M.M., Kumar, V., Pappas, G.J.: Distributed Multi-Robot Task Assignment and Formation Control. In: IEEE International Conference on Robotics and Automation, pp. 128–133 (2008)

  32. Nunes, E., Manner, M., Mitiche, H., Gini, M.: A taxonomy for task allocation problems with temporal and ordering constraints. Robot. Auton. Syst. 90, 55–70 (2017)

    Article  Google Scholar 

  33. Peasgood, M., Clark, C.M., McPhee, J.: A complete and scalable strategy for coordinating multiple robots within roadmaps. IEEE Trans. Robot. 24(2), 283–292 (2008)

    Article  Google Scholar 

  34. Peterson, R., Buyukkocak, A.T., Aksaray, D., Yazıcıoġlu, Y.: Decentralized Safe Reactive Planning under TWTL Specifications. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (2020)

  35. Preiss, J.A., Honig, W., Sukhatme, G.S., Ayanian, N.: Crazyswarm: a Large Nano-Quadcopter Swarm. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 3299–3304 (2017)

  36. Gonzalez-de Santos, P., Ribeiro, A., Fernandez-Quintanilla, C., Lopez-Granados, F., Brandstoetter, M., Tomic, S., Pedrazzi, S., Peruzzi, A., Pajares, G., Kaplanis, G., et al.: Fleets of robots for environmentally-safe pest control in agriculture. Precis. Agric. 18(4), 574–614 (2017)

    Article  Google Scholar 

  37. Seyedi, S., Yazıcıoġlu, Y., Aksaray, D.: Persistent surveillance with energy-constrained uavs and mobile charging stations. IFAC-PapersOnLine 52(20), 193–198 (2019)

    Article  Google Scholar 

  38. Shah, D., Shin, J.: Dynamics in congestion games. ACM SIGMETRICS Perform. Eval. Rev. 38(1), 107–118 (2010)

    Article  Google Scholar 

  39. Thakur, D., Likhachev, M., Keller, J., Kumar, V., Dobrokhodov, V., Jones, K., Wurz, J., Kaminer, I.: Planning for Opportunistic Surveillance with Multiple Robots. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5750–5757 (2013)

  40. Tumer, K., Wolpert, D.H.: Collectives and the design of complex systems. Springer Science & Business Media (2004)

  41. Ulusoy, A., Smith, S.L., Ding, X.C., Belta, C., Rus, D.: Optimality and robustness in multi-robot path planning with temporal logic constraints. Int. J. Robot. Res. 32(8), 889–911 (2013)

    Article  Google Scholar 

  42. Wang, H., Chen, W., Wang, J.: Coupled task scheduling for heterogeneous multi-robot system of two robot types performing complex-schedule order fulfillment tasks. Robot. Auton. Syst., 103560 (2020)

  43. Yazıcıoġlu, A.Y, Egerstedt, M., Shamma, J.S.: A game theoretic approach to distributed coverage of graphs by heterogeneous mobile agents. IFAC Proc. 46(27), 309–315 (2013)

    Article  Google Scholar 

  44. Yazıcıoġlu, A.Y., Egerstedt, M., Shamma, J.S.: Communication-free distributed coverage for networked systems. IEEE Trans. Control Netw. Syst. 4(3), 499–510 (2017)

    Article  MathSciNet  Google Scholar 

  45. Young, H.P.: Strategic learning and its limits. Oxford University Press (2004)

  46. Yu, J., LaValle, S.M.: Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics. IEEE Trans. Robot. 32(5), 1163–1177 (2016)

    Article  Google Scholar 

  47. Zhu, M., Martínez, S.: Distributed coverage games for energy-aware mobile sensor networks. SIAM J. Control. Optim. 51(1), 1–27 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Yasin Yazıcıoğlu & Raghavendra Bhat

  2. Department of Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN, 55455, USA

    Derya Aksaray

Authors
  1. Yasin Yazıcıoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raghavendra Bhat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Derya Aksaray
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yasin Yazıcıoğlu.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(MP4 8.31 MB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yazıcıoğlu, Y., Bhat, R. & Aksaray, D. Distributed Planning for Serving Cooperative Tasks with Time Windows: A Game Theoretic Approach. J Intell Robot Syst 103, 27 (2021). https://doi.org/10.1007/s10846-021-01477-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10846-021-01477-0

Keywords

Search

Navigation