针对机器人在设计中存在的工程特性冲突问题,提出了质量屋、发明问题解决原理(theory of the solution of inventive problems,TRIZ)与定量优先度分析的集成方法。利用质量屋对野外非结构化地形中的需求进行分析,发掘负相关工程特性,基...针对机器人在设计中存在的工程特性冲突问题,提出了质量屋、发明问题解决原理(theory of the solution of inventive problems,TRIZ)与定量优先度分析的集成方法。利用质量屋对野外非结构化地形中的需求进行分析,发掘负相关工程特性,基于定量优先度分析法对创新方案进行遴选,运用发明问题解决原理进行工程特性冲突消解,设计出满足要求的结构创新方案。以液压四足机器人为例,验证了方法的实用性与可行性,为消解工程特性冲突提供了新思路。展开更多
To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic prior...To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic priority to assign priorities for tasks. By assigning higher priorities to the aperiodic soft real-time jobs with longer release intervals, it guarantees the executions for periodic hard real-time tasks and further probabilistically guarantees the executions for aperiodic soft real-time tasks. The schedulability test approach for the LRIF algorithm is presented. The implementation issues of the LRIF algorithm are also discussed. Simulation result shows that LRIF obtains better schedulable performance than the maximum urgency first （MUF） algorithm, the earliest deadline first （EDF） algorithm and EDF for hybrid tasks. LRIF has great capability to schedule both periodic hard real-time and aperiodic soft real-time tasks.展开更多
Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than th...Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than the elements themselves. These constraints follow generalized Kirchhoff＇s laws derived from physical constraints. Once we have a graph; then the working environment becomes the graph-theory. An algorithm derived from graph theory is developed within the paper in order to analyze general networks. The algorithm is based on computing all the spanning trees in the graph G with an associated weight. This weight is the product ofadmittance＇s of the edges forming the spanning tree. In the first phase this algorithm computes a depth first spanning tree together with its cotree. Both are used as parents for controlled generation of off-springs. The control is represented in selecting the off-springs that were not generated previously. While the generation of off-springs, is based on replacement of one or more tree edges by cycle edges corresponding to cotree edges. The algorithm can generate a frequency domain analysis of the network.展开更多
文摘针对机器人在设计中存在的工程特性冲突问题,提出了质量屋、发明问题解决原理(theory of the solution of inventive problems,TRIZ)与定量优先度分析的集成方法。利用质量屋对野外非结构化地形中的需求进行分析,发掘负相关工程特性,基于定量优先度分析法对创新方案进行遴选,运用发明问题解决原理进行工程特性冲突消解,设计出满足要求的结构创新方案。以液压四足机器人为例,验证了方法的实用性与可行性,为消解工程特性冲突提供了新思路。
基金The Natural Science Foundation of Jiangsu Province(NoBK2005408)
文摘To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic priority to assign priorities for tasks. By assigning higher priorities to the aperiodic soft real-time jobs with longer release intervals, it guarantees the executions for periodic hard real-time tasks and further probabilistically guarantees the executions for aperiodic soft real-time tasks. The schedulability test approach for the LRIF algorithm is presented. The implementation issues of the LRIF algorithm are also discussed. Simulation result shows that LRIF obtains better schedulable performance than the maximum urgency first （MUF） algorithm, the earliest deadline first （EDF） algorithm and EDF for hybrid tasks. LRIF has great capability to schedule both periodic hard real-time and aperiodic soft real-time tasks.
文摘Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than the elements themselves. These constraints follow generalized Kirchhoff＇s laws derived from physical constraints. Once we have a graph; then the working environment becomes the graph-theory. An algorithm derived from graph theory is developed within the paper in order to analyze general networks. The algorithm is based on computing all the spanning trees in the graph G with an associated weight. This weight is the product ofadmittance＇s of the edges forming the spanning tree. In the first phase this algorithm computes a depth first spanning tree together with its cotree. Both are used as parents for controlled generation of off-springs. The control is represented in selecting the off-springs that were not generated previously. While the generation of off-springs, is based on replacement of one or more tree edges by cycle edges corresponding to cotree edges. The algorithm can generate a frequency domain analysis of the network.
