Analysis of Petri net model and task planning heuristic algorithms for product reconfiguration
Analysis of Petri net model and task planning heuristic algorithms for product reconfiguration
复制标题
产品重构的Petri网模型和任务规划启发式算法分析
作者：
重构规划是降低可重构产品制造成本的一个重要因素，其主要任务是利用有效算法生成一组最优或接近最优的重构序列。提出了一种生成Petri网作为重构树来表示产品两态过渡的方法，解决了重构接口替换的表示问题。与此方法相关，提出了两种启发式算法来生成任务序列，并考虑了经济性，有效地搜索重构路径。最后，对这两种启发式算法进行了客观评价.所开发的重构任务规划启发式算法可以生成更好的重构策略和重构方案。并以可重构并联机床的struts重构为例进行了验证。
Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguration sequences using some effect algorithms. A method is developed to generate a Petri net as the reconfiguration tree to represent two-state-transit of product, which solved the representation problem of reconfiguring interfaces replacement. Relating with this method, two heuristic algorithms are proposed to generate task sequences which considering economics to search reconfiguration paths effectively. At last, an objective evaluation is applied to compare these two heuristic algorithms to other ones. The developed reconfiguration task planning heuristic algorithms can generate better strategies and plans for reconfiguration. The research finds are exemplified with struts reconfiguration of reconfigurable parallel kinematics machine (RPKM).