The Planning of Intensive Storage Based on Minimum Time Algorithm

摘要：

　　Based on a minimum time algorithm the planning of dense storage with complicated storage objects and numerous storage positions was studied.For the operating space constraints of storage equipment, a pre-solution of minimum storage was given, which was obtained by artificial arrangement.Then, the optimum solution was solved by the Minimum Time Algorithm.The model was built, and it was proved that this planning has been considered to be accurate enough and helpful in practical applications.Especially, the planning has been already used in practical medicine storage.

关键词： Automatic pharmacy system Intensive goods storage planning Minimum time algorithm

作者: Honglei Che Chao Yun Jiyuan Zang

作者单位: Robotics Institute,Beihang University,Beijing,100191,China

会议类型: 国际会议

会议名称: 2013 International Conference on Innovation, Management and Technology Research(2013年创新、管理与技术研究国际会议)

会议地点: 太原

会议语种:英文

页码: 152-156

在线出版日期: 2013-11-16（万方平台首次上网日期，不代表论文的发表时间）