Automatic robot planning by marked Petri net

Abstract

An algorithm of automatic robot planning according to a marked Petri net is presented. This net is configured by a goal structure and initial constraints, both in Petri net formalism. Based on a matrix representation, an assembly planning algorithm is developed. An example of how to plan an assembly process if presented. The overall goal of the study is to give planning or decision-making ability to the robot.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>