A maximal distance result of interest in robotic simulation (Q1091955)
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: A maximal distance result of interest in robotic simulation |
scientific article; zbMATH DE number 4012351
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A maximal distance result of interest in robotic simulation |
scientific article; zbMATH DE number 4012351 |
Statements
A maximal distance result of interest in robotic simulation (English)
0 references
1987
0 references
Given two hyper-rectangles in \(E^ n\) with sides having surface normals in the directions of the axes, and given a connected set in each that touches all 2n sides of its containing hyper-rectangle, it is important to have an easily calculated upper bound on the distance between the two connected sets. A result giving such a bound, necessary in branch and bound algorithms used for collision avoidance in robotic simulation, is stated and proved here.
0 references
branch and bound algorithms
0 references
collision avoidance in robotic simulation
0 references
