An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (Q4629959)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles |
scientific article; zbMATH DE number 7044594
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles |
scientific article; zbMATH DE number 7044594 |
Statements
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (English)
0 references
28 March 2019
0 references
motion planning
0 references
approximation
0 references
bicriteria objective
0 references
computational geometry
0 references
