首页 | 本学科首页   官方微博 | 高级检索  
     检索      

布局装卸路径规划的研究
引用本文:王金敏,刘卫.布局装卸路径规划的研究[J].内蒙古工业大学学报,1997,16(1):22-30.
作者姓名:王金敏  刘卫
作者单位:天津大学机械系!天津,300072,天津大学机械系!天津,300072,内蒙古工业大学机械系!呼和浩特,010062,天津大学机械系!天津,300072
摘    要:本文对布局装卸路径与形态操作的关系进行了深入的研究,进而提出了计算形态操作及装卸路径可行域的定理与算法,这些算法具有较广泛的适应范围。本文还根据八叉树这种数据结构的特点及一评价函数,提出了一种定向搜索算法来求解布局物体的装卸路径。走向搜索法可用较短的时间求得较佳的装卸路径,具有广泛的应用范围。

关 键 词:布局路径规划  八叉树  形态操作  定向搜索法

A STUDY ON THE PLANNING FOR LOADING PATHS OF PACKING OBJECTS
Wang Jinmin, Zha Jiangzhong, Liu Wei, Dong Ming.A STUDY ON THE PLANNING FOR LOADING PATHS OF PACKING OBJECTS[J].Journal of Inner Mongolia Polytechnic University(Social Sciences Edition),1997,16(1):22-30.
Authors:Wang Jinmin  Zha Jiangzhong  Liu Wei  Dong Ming
Abstract:In this paper,a systematic research is made on the relationship between Minkowski op-erations and loading paths of packing objects. Furthermore, the theorems and algorithms,which can be used widely,for Minkowski operations and feasible region of loading paths are put forward. According to the octree's characteristics and an evaluation function,a directional search algorithm is presented for solving loading paths of packing objects. Better loading paths of packing objects can be obtained by the directional search algorithm in a short time.
Keywords:planning for loading paths  octree  Minkowski operation  directional search algorithm  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号