首页 /研究 /Stochastic dynamic programming applied to planning of robot grinding tasks
OTHER

Stochastic dynamic programming applied to planning of robot grinding tasks

N.L. Brown, Daniel E. Whitney

发表年份
1994
引用次数
9

摘要

This paper proposes an intelligent manufacturing system that can make decisions about the process in light of the uncertain outcome of these decisions and attempts to minimize the expected economic penalty resulting from those decisions. It uses robot weld bead grinding as an example of a process with significant process variation. A three tier hierarchical control system is proposed to plan an optimal sequence of grinding passes, dynamically simulate each pass, execute the planned sequence of controlled grinding passes, and modify the pass sequence as grinding continues. The top tier, described in this paper, plans the grinding sequence for each weld bead, and is implemented using stochastic dynamic programming, selecting the volumetric removal and feedspeed for each pass in order to optimize the satisfaction of the task requirements by the entire grinding sequence within the equipment, task, and process constraints. The resulting optimal policies have quite complex structures, showing foresight, anxiety, indifference, and aggressiveness, depending upon the situation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

关键词

GrindingSequence (biology)Computer scienceProcess (computing)Task (project management)RobotDynamic programmingIndustrial engineeringMathematical optimizationArtificial intelligence

相关论文

查看 OTHER 分类全部论文