The auction technique for the sensor based navigation planning of an autonomous mobile robot (Q1383989)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1139806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The auction technique for the sensor based navigation planning of an autonomous mobile robot |
scientific article; zbMATH DE number 1139806 |
Statements
The auction technique for the sensor based navigation planning of an autonomous mobile robot (English)
0 references
25 May 1998
0 references
An algorithm for motion planning on a completely unknown work space is presented. The main features of the method are: 1. an iterative solution of the shortest path problem which alternates with the acquisition of new knowledge by a sensor system; 2. the use of an auction technique to solve the optimization problem quickly; 3. the updating of the weights in a scheme similar to artificial potential methods. The proposed method combines the advantages of both graph optimization and the artificial potential method, avoiding the high complexity of the former and the possibility of local minima of the latter.
0 references
automated systems
0 references
robots
0 references
motion planning
0 references
unknown work space
0 references
shortest path problem
0 references
artificial potential method
0 references
0.7241654396057129
0 references
0.7191927433013916
0 references
0.7136983871459961
0 references
