Safe navigation in adversarial environments
From MaRDI portal
Publication:723641
DOI10.1007/s10472-018-9591-0zbMath1448.68434OpenAlexW2808655336WikidataQ129691289 ScholiaQ129691289MaRDI QIDQ723641
Publication date: 24 July 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-018-9591-0
Applications of game theory (91A80) Positional games (pursuit and evasion, etc.) (91A24) Artificial intelligence for robotics (68T40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A game of cops and robbers
- The expected hitting times for finite Markov chains
- An annotated bibliography on guaranteed graph searching
- Robot motion planning with uncertainty in control and sensing
- Random walks on graphs
- Visibility graphs, dismantlability, and the cops and robbers game
- Vertex-to-vertex pursuit in a graph
- Concurrent reachability games
- Multiagent Systems
- Markov Chains
- Randomized Pursuit-Evasion in Graphs
- On Choosing and Bounding Probability Metrics
- The Complexity of Computing a Nash Equilibrium
- Zero-Visibility Cops and Robber Game on a Graph
- On Search Games That Include Ambush
- Solution of David Gale's lion and man problem
- Markov perfect equilibrium. I: Observable actions
This page was built for publication: Safe navigation in adversarial environments