| 摘要 |
PROBLEM TO BE SOLVED: To convey products by the shortest path in a clean room. SOLUTION: A conveyance robot traveling along rails selects the shortest or almost the shortest route for automatic traveling. In this case, the rails are suspended from the ceiling of the clean room that is a semiconductor- manufacturing line and are arranged, while the rails intersect longitudinally laterally, and diagonally. |
