Robot motion planning: A game-theoretic foundation (Q1974464): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004539910020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047901468 / rank | |||
Normal rank | |||
Latest revision as of 20:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robot motion planning: A game-theoretic foundation |
scientific article |
Statements
Robot motion planning: A game-theoretic foundation (English)
0 references
19 September 2002
0 references
In robot path and motion planning, several types of uncertainties have to be taken into account. First, some models are introduced for describing uncertainty in configuration predictability and uncertainty in configuration sensing, environmental uncertainties, coordination of multiple robots, etc. By applying game-theoretical concepts, such as worst case principles (game against nature), Pareto optimality principles, etc., the motion planning problem under uncertainty is converted again into a motion planning problem with given fixed data.
0 references
game theory
0 references
robot path planning
0 references
uncertainty
0 references
configuration predictability
0 references
configuration sensing
0 references
coordination
0 references
worst case principles
0 references
motion planning
0 references
