Motion Control of Marine Craft

Marine craft (surface vessels, underwater vehicles, and offshore rigs) perform operations that require tight motion control. During the past three decades, there has been an increasing demand for higher accuracy and reliability of marinecraft motion control systems. Today, these control systems are an enabling factor for single and multicraft marine operations. This chapter provides an overview of the main characteristics and design aspects of motion control systems for marine craft. In particular, we discuss the architecture of the control system, the functionality of its main components, the characteristics of environmental disturbances, control objectives, and essential aspects of modeling and motion control design.

Generalized aggregate Quality of Service computation for composite services

This article addresses the problem of estimating the Quality of Service (QoS) of a composite service given the QoS of the services participating in the composition. Previous solutions to this problem impose restrictions on the topology of the orchestration models, limiting their applicability to well-structured orchestration models for example. This article lifts these restrictions by proposing a method for aggregate QoS computation that deals with more general types of unstructured orchestration models. The applicability and scalability of the proposed method are validated using a collection of models from industrial practice.

Aggregate quality of service computation for composite services

This paper addresses the problem of computing the aggregate QoS of a composite service given the QoS of the services participating in the composition. Previous solutions to this problem are restricted to composite services with well-structured orchestration models. Yet, in existing languages such as WS-BPEL and BPMN, orchestration models may be unstructured. This paper lifts this limitation by providing equations to compute the aggregate QoS for general types of irreducible unstructured regions in orchestration models. In conjunction with existing algorithms for decomposing business process models into single-entry-single-exit regions, these functions allow us to cover a larger set of orchestration models than existing QoS aggregation techniques.

Simplified computation and generalization of the refined process structure tree

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

Causal behavioural profiles : efficient computation, applications, and evaluation

Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S- or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.

Efficient computation of causal behavioural profiles using structural decomposition

Identification of behavioural contradictions is an important aspect of software engineering, in particular for checking the consistency between a business process model used as system specification and a corresponding workflow model used as implementation. In this paper, we propose causal behavioural profiles as the basis for a consistency notion, which capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities. Existing notions of behavioural equivalence, such as bisimulation and trace equivalence, might also be applied as consistency notions. Still, they are exponential in computation. Our novel concept of causal behavioural profiles provides a weaker behavioural consistency notion that can be computed efficiently using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S- or T-nets.

Energy-based motion control of marine vehicles using interconnection and damping assignment passivity-based control : a survey

This paper reviews some recent results in motion control of marine vehicles using a technique called Interconnection and Damping Assignment Passivity-based Control (IDA-PBC). This approach to motion control exploits the fact that vehicle dynamics can be described in terms of energy storage, distribution, and dissipation, and that the stable equilibrium points of mechanical systems are those at which the potential energy attains a minima. The control forces are used to transform the closed-loop dynamics into a port-controlled Hamiltonian system with dissipation. This is achieved by shaping the energy-storing characteristics of the system, modifying its interconnection structure (how the energy is distributed), and injecting damping. The end result is that the closed-loop system presents a stable equilibrium (hopefully global) at the desired operating point. By forcing the closed-loop dynamics into a Hamiltonian form, the resulting total energy function of the system serves as a Lyapunov function that can be used to demonstrate stability. We consider the tracking and regulation of fully actuated unmanned underwater vehicles, its extension to under-actuated slender vehicles, and also manifold regulation of under-actuated surface vessels. The paper is concluded with an outlook on future research.

Joint motion control and control allocation design for UAS flight control systems

As Unmanned Aircraft Systems (UAS) grow in complexity, and their level of autonomy increases|moving away from the concept of a remotely piloted systems and more towards autonomous systems|there is a need to further improve reliability and tolerance to faults. The traditional way to accommodate actuator faults is by using standard control allocation techniques as part of the flight control system. The allocation problem in the presence of faults often requires adding constraints that quantify the maximum capacity of the actuators. This in turn requires on-line numerical optimisation. In this paper, we propose a framework for joint allocation and constrained control scheme via vector input scaling. The actuator configuration is used to map actuator constraints into the space of the aircraft generalised forces, which are the magnitudes demanded by the light controller. Then by constraining the output of controller, we ensure that the allocation function always receive feasible demands. With the proposed framework, the allocation problem does not require numerical optimisation, and since the controller handles the constraints, there is not need to implement heuristics to inform the controller about actuator saturation.

Ship roll motion control

The technical feasibility of roll motion control devices has been amply demonstrated for over 100 years. Performance, however, can still fall short of expectations because of deficiencies in control system designs, which have proven to be far from trivial due to fundamental performance limitations. This tutorial paper presents an account of the development of various ship roll motion control systems and the challenges associated with their design. The paper discusses how to assess performance, the applicability of different models, and control methods that have been applied in the past.

Port-Hamiltonian theory of motion control for marine craft

Port-Hamiltonian Systems (PHS) have a particular form that incorporates explicitly a function of the total energy in the system (energy function) and also other functions that describe structure of the system in terms of energy distribution. For PHS, the product of the input and output variables gives the rate of energy change. This type of systems have the property that under certain conditions on the energy function, the system is passive; and thus, stable. Therefore, if one can design a controller such that the closed-loop system retains - or takes - a PHS form, such closed-loop system will inherit the properties of passivity and stability. In this paper, the classical model of marine craft is put into a PHS form. It is shown that models used for positioning control do not have a PHS form due to a kinematic transformation, but a control design can be done such that the closed-loop system takes a PHS form. It is further shown how integral action can be added and how the PHS-form can be exploited to provide a procedure for control design that ensures passivity and thus stability.

Impact of the piston secondary motion on its slap force

A theoretical model is developed for the analysis of piston secondary motion. Based on this model, the slap force of a specific L6 diesel engine was compared when considering different boundary conditions, such as lubricating oil on cylinder liner, surface roughness, deformation of cylinder liner and piston skirt. It is concluded that it is necessary to consider the secondary motion of piston in the analysis of the inner excitation for an internal combustion engine. A more comprehensive consideration of the boundary condition (i.e., more close to the actual condition) will lead to a smaller maximum slap force, and among all boundary conditions considered in this paper, the structural deformation of the piston skirt and cylinder liner is the most influential factor. The theoretical model developed and findings obtained in this study will benefit the future analysis and design of advanced internal combustion engine structures.

Computation of ECG signal features using MCMC modelling in software and FPGA reconfigurable hardware

Computational optimisation of clinically important electrocardiogram signal features, within a single heart beat, using a Markov-chain Monte Carlo (MCMC) method is undertaken. A detailed, efficient data-driven software implementation of an MCMC algorithm has been shown. Initially software parallelisation is explored and has been shown that despite the large amount of model parameter inter-dependency that parallelisation is possible. Also, an initial reconfigurable hardware approach is explored for future applicability to real-time computation on a portable ECG device, under continuous extended use.

A taxonomy of computation offloading in mobile cloud computing

The ability of cloud computing to provide almost unlimited storage, backup and recovery, and quick deployment contributes to its widespread attention and implementation. Cloud computing has also become an attractive choice for mobile users as well. Due to limited features of mobile devices such as power scarcity and inability to cater computationintensive tasks, selected computation needs to be outsourced to the resourceful cloud servers. However, there are many challenges which need to be addressed in computation offloading for mobile cloud computing such as communication cost, connectivity maintenance and incurred latency. This paper presents taxonomy of the computation offloading approaches which aim to address the challenges. The taxonomy provides guidelines to identify research scopes in computation offloading for mobile cloud computing. We also outline directions and anticipated trends for future research.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Defining the spatiotemporal surveillance space for alien species’ invasions using approximate Bayesian computation

The spatiotemporal dynamics of an alien species invasion across a real landscape are typically complex. While surveillance is an essential part of a management response, planning surveillance in space and time present a difficult challenge due to this complexity. We show here a method for determining the highest probability sites for occupancy across a landscape at an arbitrary point in the future, based on occupancy data from a single slice in time. We apply to the method to the invasion of Giant Hogweed, a serious weed in the Czech republic and throughout Europe.