The Robot Routing Problem for Collecting Aggregate Stochastic Rewards
From MaRDI portal
Publication:5111626
DOI10.4230/LIPIcs.CONCUR.2017.13zbMath1442.68237arXiv1704.05303OpenAlexW2606115451MaRDI QIDQ5111626
Ivan Gavran, Sadegh Esmaeil Zadeh Soudjani, Rayna Dimitrova, Rupak Majumdar, Vinayak S. Prabhu
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1704.05303
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Unnamed Item
- Near-optimal continuous patrolling with teams of mobile information gathering agents
- The orienteering problem: a survey
- A characterization of the minimum cycle mean in a digraph
- The complexity of mean payoff games on graphs
- Adaptive and Sequential Gridding Procedures for the Abstraction and Verification of Stochastic Processes
- Quantitative Temporal Simulation and Refinement Distances for Timed Systems
- Bounding Average-Energy Games
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Vehicle Routing with Time Windows
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- On the synthesis of strategies in infinite games
- The Robot Routing Problem for Collecting Aggregate Stochastic Rewards
- Controller Synthesis for Reward Collecting Markov Processes in Continuous Space
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Depth-First Search and Linear Graph Algorithms
