A novel approach to 6-DOF adaptive trajectory tracking control of an AUV in the presence of parameter uncertainties

In this paper, the trajectory tracking control of an autonomous underwater vehicle (AUVs) in six-degrees-of-freedom (6-DOFs) is addressed. It is assumed that the system parameters are unknown and the vehicle is underactuated. An adaptive controller is proposed, based on Lyapunov׳s direct method and the back-stepping technique, which interestingly guarantees robustness against parameter uncertainties. The desired trajectory can be any sufficiently smooth bounded curve parameterized by time even if consist of straight line. In contrast with the majority of research in this field, the likelihood of actuators׳ saturation is considered and another adaptive controller is designed to overcome this problem, in which control signals are bounded using saturation functions. The nonlinear adaptive control scheme yields asymptotic convergence of the vehicle to the reference trajectory, in the presence of parametric uncertainties. The stability of the presented control laws is proved in the sense of Lyapunov theory and Barbalat׳s lemma. Efficiency of presented controller using saturation functions is verified through comparing numerical simulations of both controllers.

Numerical studies of gypsum plasterboard and MGO board lined LSF walls exposed to fire

Fire resistance of cold-formed light gauge steel frame (LSF) wall systems is enhanced by lining them with single or multiple layers of wall boards with varying thermal properties. These wall boards are gypsum plasterboards or Magnesium Oxide (MgO) boards produced by different manufacturers. Thermal properties of these boards appear to show considerable variations and this can lead to varying fire resistance levels (FRL) for their wall systems. Currently FRLs of wall systems are determined using full scale fire tests, but they are time consuming and expensive. Recent research studies on the fire performance of LSF wall systems have used finite element studies to overcome this problem, but they were developed based on 1-D and 2-D finite element platform capable of performing either heat transfer or structural analysis separately. Hence in this research a 3-D finite element model was developed first for LSF walls lined with gypsum plasterboard and cavity insulation materials. Accurate thermal properties of these boards are essential for finite element modelling, and thus they were measured at both ambient and elevated temperatures. This experimental study included specific heat, relative density and thermal conductivity of boards. The developed 3-D finite element model was then validated using the available fire tests results of LSF walls lined with gypsum plasterboard, and is being used to investigate the fire performance of different LSF wall configurations. The tested MgO board exhibited significant variations in their thermal properties in comparison to gypsum plasterboards with about 50% loss of its initial mass at about 500 ºC compared to 16% for gypsum plasterboards. Hence the FRL of MgO board lined LSF wall systems is likely to be significantly reduced. This paper presents the details of this research study on the fire performance of LSF wall systems lined with gypsum plasterboard and MgO board including the developed 3-D finite element models, thermal property tests and the results.

Data distribution and task scheduling for distributed computing of all-to-all comparison problems

This research studied distributed computing of all-to-all comparison problems with big data sets. The thesis formalised the problem, and developed a high-performance and scalable computing framework with a programming model, data distribution strategies and task scheduling policies to solve the problem. The study considered storage usage, data locality and load balancing for performance improvement in solving the problem. The research outcomes can be applied in bioinformatics, biometrics and data mining and other domains in which all-to-all comparisons are a typical computing pattern.

A new multi-objective model to optimise rail transport scheduler

The sugarcane transport system plays a critical role in the overall performance of Australia’s sugarcane industry. An inefficient sugarcane transport system interrupts the raw sugarcane harvesting process, delays the delivery of sugarcane to the mill, deteriorates the sugar quality, increases the usage of empty bins, and leads to the additional sugarcane production costs. Due to these negative effects, there is an urgent need for an efficient sugarcane transport schedule that should be developed by the rail schedulers. In this study, a multi-objective model using mixed integer programming (MIP) is developed to produce an industry-oriented scheduling optimiser for sugarcane rail transport system. The exact MIP solver (IBM ILOG-CPLEX) is applied to minimise the makespan and the total operating time as multi-objective functions. Moreover, the so-called Siding neighbourhood search (SNS) algorithm is developed and integrated with Sidings Satisfaction Priorities (SSP) and Rail Conflict Elimination (RCE) algorithms to solve the problem in a more efficient way. In implementation, the sugarcane transport system of Kalamia Sugar Mill that is a coastal locality about 1050 km northwest of Brisbane city is investigated as a real case study. Computational experiments indicate that high-quality solutions are obtainable in industry-scale applications.

An object-centred approach to encourage online participation in the context of behaviour change

Online groups rely on contributions from their members to flourish, but in the context of behaviour change individuals are typically reluctant to participate actively before they have changed successfully. We took inspiration from CSCW research on objects to address this problem by shifting the focus of online participation from the exchange of personal experiences to more incidental interactions mediated by objects that offer support for change. In this article we describe how we designed, deployed and studied a smartphone application that uses different objects, called distractions and tips, to facilitate social interaction amongst people trying to quit smoking. A field study with 18 smokers revealed different forms of interaction: purely instrumental interactions with the objects, subtle engagement with other users through receptive and covert interactions, as well as explicit interaction with other users through disclosure and mutual support. The distraction objects offered a stepping-stone into interaction, whereas the tips encouraged interaction with the people behind the objects. This understanding of interaction through objects complements existing frameworks of online participation and adds to the current discourse on object-centred sociality. Furthermore, it provides an alternative approach to the design of online support groups, which offers the users enhanced control about the information they share with other users. We conclude by discussing how researchers and practitioners can apply the ideas of interaction around objects to other domains where individuals may have a simultaneous desire and reluctance to interact.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.