Robot motion planning: A game-theoretic foundation
From MaRDI portal
Publication:1974464
DOI10.1007/s004539910020zbMath0993.93028OpenAlexW2047901468MaRDI QIDQ1974464
Publication date: 19 September 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910020
uncertaintygame theorymotion planningcoordinationrobot path planningconfiguration predictabilityconfiguration sensingworst case principles
Applications of game theory (91A80) Automated systems (robots, etc.) in control theory (93C85) Artificial intelligence for robotics (68T40)
Related Items (8)
Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Optimistic and topological value iteration for simple stochastic games ⋮ Altruistic agents in uncertain dynamic games ⋮ On the accessibility/controllability of fuzzy control systems ⋮ Auto-regressive moving-average discrete-time dynamical systems and autocorrelation functions on real-valued Riemannian matrix manifolds ⋮ Motion planning in uncertain environments with vision-like sensors ⋮ A graph search algorithm for indoor pursuit/evasion ⋮ A frequentist approach to mapping under uncertainty
This page was built for publication: Robot motion planning: A game-theoretic foundation
