Abstract: Graph rewriting-based visual model processing is a
widely used technique for model transformation. Visual model
transformations often need to follow an algorithm that requires a
strict control over the execution sequence of the transformation steps.
Therefore, in Visual Model Processors (VMPs) the execution order
of the transformation steps is crucial. This paper presents the visual
control flow support of Visual Modeling and Transformation System
(VMTS), which facilitates composing complex model
transformations of simple transformation steps and executing them.
The VMTS Visual Control Flow Language (VCFL) uses stereotyped
activity diagrams to specify control flow structures and OCL
constraints to choose between different control flow branches. This
paper introduces VCFL, discusses its termination properties and
provides an algorithm to support the termination analysis of VCFL
transformations.
Abstract: This paper presents the visual control flow support of Visual Modeling and Transformation System (VMTS), which facilitates composing complex model transformations out of simple transformation steps and executing them. The VMTS Visual Control Flow Language (VCFL) uses stereotyped activity diagrams to specify control flow structures and OCL constraints to choose between different control flow branches. This work discusses the termination properties of VCFL and provides an algorithm to support the termination analysis of VCFL transformations.
Abstract: In this paper we present an extension to Vision Based
LRTA* (VLRTA*) known as Vision Based Moving Target Search
(VMTS) for capturing unknown moving target in unknown territory
with randomly generated obstacles. Target position is unknown to the
agents and they cannot predict its position using any probability
method. Agents have omni directional vision but can see in one
direction at some point in time. Agent-s vision will be blocked by the
obstacles in the search space so agent can not see through the
obstacles. Proposed algorithm is evaluated on large number of
scenarios. Scenarios include grids of sizes from 10x10 to 100x100.
Grids had obstacles randomly placed, occupying 0% to 50%, in
increments of 10%, of the search space. Experiments used 2 to 9
agents for each randomly generated maze with same obstacle ratio.
Observed results suggests that VMTS is effective in locate target
time, solution quality and virtual target. In addition, VMTS becomes
more efficient if the number of agents is increased with proportion to
obstacle ratio.