English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The Robot Routing Problem for Collecting Aggregate Stochastic Rewards

MPS-Authors
/persons/resource/persons44322

Dimitrova,  Rayna
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144761

Gavran,  Ivan
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144534

Majumdar,  Rupak
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144936

Prabhu,  Vinayak
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144805

Soudjani,  Sadegh
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2017/7792/
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dimitrova, R., Gavran, I., Majumdar, R., Prabhu, V., & Soudjani, S. (2017). The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. In R. Meyer, & U. Nestmann (Eds.), 28th International Conference on Concurrency Theory (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.CONCUR.2017.13.


Cite as: https://hdl.handle.net/21.11116/0000-0000-EA7C-E
Abstract
There is no abstract available