Shortest length paths for a differential drive robot keeping a set of landmarks in sight (Q444762): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T40 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 93C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6071051 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
motion planning | |||
| Property / zbMATH Keywords: motion planning / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
landmark-based navigation | |||
| Property / zbMATH Keywords: landmark-based navigation / rank | |||
Normal rank | |||
Revision as of 02:53, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest length paths for a differential drive robot keeping a set of landmarks in sight |
scientific article |
Statements
Shortest length paths for a differential drive robot keeping a set of landmarks in sight (English)
0 references
23 August 2012
0 references
motion planning
0 references
landmark-based navigation
0 references
