The robot routing problem for collecting aggregate stochastic rewards

Dimitrova, R., Gavran, I., Majumdar, R. et al. (2 more authors) (2017) The robot routing problem for collecting aggregate stochastic rewards. In: Meyer, R. and Nestmann, U., (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017). 28th International Conference on Concurrency Theory, 04-09 Sep 2017, Berlin, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik , 13:1-13:17. ISBN 9783959770484

Abstract

Metadata

Authors/Creators:
  • Dimitrova, R.
  • Gavran, I.
  • Majumdar, R.
  • Prabhu, V.S.
  • Soudjani, S.E.Z.
Copyright, Publisher and Additional Information: © 2017 The Author(s). This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords: Path Planning; Graph Games; Quantitative Objectives; Discounting
Dates:
  • Published: 5 September 2017
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 04 Feb 2020 14:03
Last Modified: 05 Feb 2020 05:44
Status: Published
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.CONCUR.2017.13

Share / Export

Statistics