Use of Probe Vehicles to Increase Traffic Estimation Accuracy in Brisbane

Traffic congestion is an increasing problem with high costs in financial, social and personal terms. These costs include psychological and physiological stress, aggressivity and fatigue caused by lengthy delays, and increased likelihood of road crashes. Reliable and accurate traffic information is essential for the development of traffic control and management strategies. Traffic information is mostly gathered from in-road vehicle detectors such as induction loops. Traffic Message Chanel (TMC) service is popular service which wirelessly send traffic information to drivers. Traffic probes have been used in many cities to increase traffic information accuracy. A simulation to estimate the number of probe vehicles required to increase the accuracy of traffic information in Brisbane is proposed. A meso level traffic simulator has been developed to facilitate the identification of the optimal number of probe vehicles required to achieve an acceptable level of traffic reporting accuracy. Our approach to determine the optimal number of probe vehicles required to meet quality of service requirements, is to simulate runs with varying numbers of traffic probes. The simulated traffic represents Brisbane’s typical morning traffic. The road maps used in simulation are Brisbane’s TMC maps complete with speed limits and traffic lights. Experimental results show that that the optimal number of probe vehicles required for providing a useful supplement to TMC (induction loop) data lies between 0.5% and 2.5% of vehicles on the road. With less probes than 0.25%, little additional information is provided, while for more probes than 5%, there is only a negligible affect on accuracy for increasingly many probes on the road. Our findings are consistent with on-going research work on traffic probes, and show the effectiveness of using probe vehicles to supplement induction loops for accurate and timely traffic information.

A Numerical Solution Using an Adaptively Preconditioned Lanczos Method for a Class of Linear Systems Related with the Fractional Poisson Equation

This study considers the solution of a class of linear systems related with the fractional Poisson equation (FPE) (−∇2)α/2φ=g(x,y) with nonhomogeneous boundary conditions on a bounded domain. A numerical approximation to FPE is derived using a matrix representation of the Laplacian to generate a linear system of equations with its matrix A raised to the fractional power α/2. The solution of the linear system then requires the action of the matrix function f(A)=A−α/2 on a vector b. For large, sparse, and symmetric positive definite matrices, the Lanczos approximation generates f(A)b≈β0Vmf(Tm)e1. This method works well when both the analytic grade of A with respect to b and the residual for the linear system are sufficiently small. Memory constraints often require restarting the Lanczos decomposition; however this is not straightforward in the context of matrix function approximation. In this paper, we use the idea of thick-restart and adaptive preconditioning for solving linear systems to improve convergence of the Lanczos approximation. We give an error bound for the new method and illustrate its role in solving FPE. Numerical results are provided to gauge the performance of the proposed method relative to exact analytic solutions.

A sequencing approach for creating new train timetables

Train scheduling is a complex and time consuming task of vital importance. To schedule trains more accurately and efficiently than permitted by current techniques a novel hybrid job shop approach has been proposed and implemented. Unique characteristics of train scheduling are first incorporated into a disjunctive graph model of train operations. A constructive algorithm that utilises this model is then developed. The constructive algorithm is a general procedure that constructs a schedule using insertion, backtracking and dynamic route selection mechanisms. It provides a significant search capability and is valid for any objective criteria. Simulated Annealing and Local Search meta-heuristic improvement algorithms are also adapted and extended. An important feature of these approaches is a new compound perturbation operator that consists of many unitary moves that allows trains to be shifted feasibly and more easily within the solution. A numerical investigation and case study is provided and demonstrates that high quality solutions are obtainable on real sized applications.

Application of a continuum theory to vertical vibrations of a layer of granular material

Many interesting phenomena have been observed in layers of granular materials subjected to vertical oscillations; these include the formation of a variety of standing wave patterns, and the occurrence of isolated features called oscillons, which alternately form conical heaps and craters oscillating at one-half of the forcing frequency. No continuum-based explanation of these phenomena has previously been proposed. We apply a continuum theory, termed the double-shearing theory, which has had success in analyzing various problems in the flow of granular materials, to the problem of a layer of granular material on a vertically vibrating rigid base undergoing vertical oscillations in plane strain. There exists a trivial solution in which the layer moves as a rigid body. By investigating linear perturbations of this solution, we find that at certain amplitudes and frequencies this trivial solution can bifurcate. The time dependence of the perturbed solution is governed by Mathieu’s equation, which allows stable, unstable and periodic solutions, and the observed period-doubling behaviour. Several solutions for the spatial velocity distribution are obtained; these include one in which the surface undergoes vertical velocities that have sinusoidal dependence on the horizontal space dimension, which corresponds to the formation of striped standing waves, and is one of the observed patterns. An alternative continuum theory of granular material mechanics, in which the principal axes of stress and rate-of-deformation are coincident, is shown to be incapable of giving rise to similar instabilities.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.

Social innovation to solve homelessness : wicked solutions for wicked problems

Homelessness is a complex problem that manifests in all societies. This intractable and ‘wicked’ issue resists single-agency solutions and its resolution and requires a large, on-going investment of financial and professional resources that few organisations can sustain. This paper adopts a social innovation framework to examine government and community sector responses to homelessness. While recent evaluations and policy prescriptions have suggested better integrated and more co-ordinated service delivery models for addressing homelessness, there is little understanding of the innovation framework in which alternative service system paradigms emerge. A framework that identifies/distils and explains different innovation levels is put forward. The framework highlights that while government may lead strategic level innovations, community organisations are active in developing innovation at the service and client level. Moreover, community organisations may be unaware of the innovative capacity that resides in their creative responses to resolving social crisis and marginalisation through being without shelter.

Realistic yet humanitarian? The comprehensive plan of action and refugee policy in Southeast Asia

The 1989 Comprehensive Plan of Action (CPA) has recently been described as a successful example of how to manage large protracted refugee flows. However, this article revisits the circumstances surrounding the CPA used to resolve the prolonged Indo-Chinese refugee crisis to highlight that part of its development was linked to the fact that Southeast Asian states refused to engage with proposed solutions, which did not include repatriation for the majority of the Indo-Chinese asylum seekers who were deemed to be ‘non-genuine’1 ( UNGA, 1989a) refugees. This resulted in the CPA often forcibly repatriating ‘non-genuine’ refugees, particularly near the end of its program. This article reviews the CPA in order to assess whether its practices and results should be repeated.

Apparatus for monitoring load bearing rehabilitation exercises of a transfemoral amputee fitted with an osseointegrated fixation : a proof-of-concept study

The purpose of this proof-of-concept study was to determine the relevance of direct measurements to monitor the load applied on the osseointegrated fixation of transfemoral amputees during static load bearing exercises. The objectives were (A) to introduce an apparatus using a three-dimensional load transducer, (B) to present a range of derived information relevant to clinicians, (C) to report on the outcomes of a pilot study and (D) to compare the measurements from the transducer with those from the current method using a weighing scale. One transfemoral amputee fitted with an osseointegrated implant was asked to apply 10 kg, 20 kg, 40 kg and 80 kg on the fixation, using self-monitoring with the weighing scale. The loading was directly measured with a portable kinetic system including a six-channel transducer, external interface circuitry and a laptop. As the load prescribed increased from 10 kg to 80 kg, the forces and moments applied on and around the antero-posterior axis increased by 4 fold anteriorly and 14 fold medially, respectively. The forces and moments applied on and around the medio-lateral axis increased by 9 fold laterally and 16 fold from anterior to posterior, respectively. The long axis of the fixation was overloaded and underloaded in 17 % and 83 % of the trials, respectively, by up to ±10 %. This proof-of-concept study presents an apparatus that can be used by clinicians facing the challenge of improving basic knowledge on osseointegration, for the design of equipment for load bearing exercises and for rehabilitation programs.

Integrity determination of RTK solutions in precision farming applications

Integrity of Real Time Kinematic (RTK) positioning solutions relates to the confidential level that can be placed in the information provided by the RTK system. It includes the ability of the RTK system to provide timely valid warnings to users when the system must not be used for the intended operation. For instance, in the controlled traffic farming (CTF) system that controls traffic separates wheel beds and root beds, RTK positioning error causes overlap and increases the amount of soil compaction. The RTK system’s integrity capacity can inform users when the actual positional errors of the RTK solutions have exceeded Horizontal Protection Levels (HPL) within a certain Time-To-Alert (TTA) at a given Integrity Risk (IR). The later is defined as the probability that the system claims its normal operational status while actually being in an abnormal status, e.g., the ambiguities being incorrectly fixed and positional errors having exceeded the HPL. The paper studies the required positioning performance (RPP) of GPS positioning system for PA applications such as a CTF system, according to literature review and survey conducted among a number of farming companies. The HPL and IR are derived from these RPP parameters. A RTK-specific rover autonomous integrity monitoring (RAIM) algorithm is developed to determine the system integrity according to real time outputs, such as residual square sum (RSS), HDOP values. A two-station baseline data set is analyzed to demonstrate the concept of RTK integrity and assess the RTK solution continuity, missed detection probability and false alarm probability.

Thermally activated seawater neutralised red mud used for the removal of arsenate, vanadate and molybdate from aqueous solutions.

The effectiveness of using thermally activated hydrotalcite materials has been investigated for the removal of arsenate, vanadate, and molybdate in individual and mixed solutions. Results show that increasing the Mg,Al ratio to 4:1 causes an increase in the percentage of anions removed from solution. The order of affinity of the three anions analysed in this investigation is arsenate, vanadate, and molybdate. By comparisons with several synthetic hydrotalcite materials, the hydrotalcite structure in the seawater neutralised red mud (SWN-RM) has been determined to consist of magnesium and aluminium with a ratio between 3.5:1 and 4:1. Thermally activated seawater neutralised red mud removes at least twice the concentration of anionic species than thermally activated red mud alone, due to the formation of 40 to 60 % Bayer hydrotalcite during the neutralisation process.

Developing teamwork assessment : satisfying solutions for the real world

While the need for teamwork skills consistently appears in job advertisements across all sectors, the development of these skills for many university students (and some academic staff) remains one of the most painful and often complained about experiences. This presentation introduces the final phase of a project that has investigated and analysed the design of teamwork assessment across all discipline areas in order to provide a university-wide protocol for this important graduate capability. The protocol concentrates best practice guidelines and resources across a range of approaches to team assessment and includes an online diagnostic tool for evaluating the quality of assessment design. Guide-lines are provided for all aspects of the design process such as the development of real-world relevance; choosing the ideal team structure; planning for intervention and conflict resolution; and selecting appropriate marking options. While still allowing academic staff to exercise creativity in assessment design; the guidelines increase the possibility of students’ experiencing a consistent and explicit approach to teamwork throughout their course. If implementation of the protocol is successful, the project team predicts that the resulting consistency and explicitness in approaches to teamwork will lead to more coherent skill development across units, more realistic expectations for students and staff and better communication between all those participating in the process.

Three Carrier Ambiguity Resolutions : Generalised problems, models and solutions

In this paper, the problems of three carrier phase ambiguity resolution (TCAR) and position estimation (PE) are generalized as real time GNSS data processing problems for a continuously observing network on large scale. In order to describe these problems, a general linear equation system is presented to uniform various geometry-free, geometry-based and geometry-constrained TCAR models, along with state transition questions between observation times. With this general formulation, generalized TCAR solutions are given to cover different real time GNSS data processing scenarios, and various simplified integer solutions, such as geometry-free rounding and geometry-based LAMBDA solutions with single and multiple-epoch measurements. In fact, various ambiguity resolution (AR) solutions differ in the floating ambiguity estimation and integer ambiguity search processes, but their theoretical equivalence remains under the same observational systems models and statistical assumptions. TCAR performance benefits as outlined from the data analyses in some recent literatures are reviewed, showing profound implications for the future GNSS development from both technology and application perspectives.