Constructing optimal cyclic tours for planar exploration and obstacle avoidance : A graph theory approach (Q3564116)
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 5715415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing optimal cyclic tours for planar exploration and obstacle avoidance : A graph theory approach |
scientific article; zbMATH DE number 5715415 |
Statements
Constructing Optimal Cyclic Tours for Planar Exploration and Obstacle Avoidance : A Graph Theory Approach (English)
0 references
2 June 2010
0 references
planar autonomous exploration
0 references
Peano-Cesaro triangular tiling
0 references
edge adjacency dual graph
0 references
tiling pattern
0 references
obstacles
0 references
Hamiltonian cycles
0 references
obstacle configuration
0 references
algorithms
0 references
0.676100492477417
0 references
0.6738910675048828
0 references
0.6738910675048828
0 references
