ROBOT DYNAMIC CONTROL INSTABILITIES.

The authors demonstrate that a widely proposed method of robot dynamic control can be inherently unstable, due to an algebraic feedback loop condition causing an ill-posed feedback system. By focussing on the concept of ill-posedness a necessary and sufficient condition is derived for instability in robot manipulator systems which incorporate online acceleration cross-coupling control. Also demonstrated is a quasilinear multivariable control framework useful for assessing the robustness of this type of control when the instability condition is not obeyed.

Application of a laminar flamelet model to confined explosion hazards

The majority of computational studies of confined explosion hazards apply simple and inaccurate combustion models, requiring ad hoc corrections to obtain realistic flame shapes and often predicting an order of magnitude error in the overpressures. This work describes the application of a laminar flamelet model to a series of two-dimensional test cases. The model is computationally efficient applying an algebraic expression to calculate the flame surface area, an empirical correlation for the laminar flame speed and a novel unstructured, solution adaptive numerical grid system which allows important features of the solution to be resolved close to the flame. Accurate flame shapes are predicted, the correct burning rate is predicted near the walls, and an improvement in the predicted overpressures is obtained. However, in these fully turbulent calculations the overpressures are still too high and the flame arrival times too low, indicating the need for a model for the early laminar burning phase. Due to the computational expense, it is unrealistic to model a laminar flame in the complex geometries involved and therefore a pragmatic approach is employed which constrains the flame to propagate at the laminar flame speed. Transition to turbulent burning occurs at a specified turbulent Reynolds number. With the laminar phase model included, the predicted flame arrival times increase significantly, but are still too low. However, this has no significant effect on the overpressures, which are predicted accurately for a baffled channel test case where rapid transition occurs once the flame reaches the first pair of baffles. In a channel with obstacles on the centreline, transition is more gradual and the accuracy of the predicted overpressures is reduced. However, although the accuracy is still less than desirable in some cases, it is much better than the order of magnitude error previously expected.

The use of object oriented modelling and simulation tools in constraint satisfaction for embodiment design

The software package Dymola, which implements the new, vendor-independent standard modelling language Modelica, exemplifies the emerging generation of object-oriented modelling and simulation tools. This paper shows how, in addition to its simulation capabilities, it may be used as an embodiment design tool, to size automatically a design assembled from a library of generic parametric components. The example used is a miniature model aircraft diesel engine. To this end, the component classes contain extra algebraic equations calculating the overload factor (or its reciprocal, the safety factor) for all the different modes of failure, such as buckling or tensile yield. Thus the simulation results contain the maximum overload or minimum safety factor for each failure mode along with the critical instant and the device state at which it occurs. The Dymola "Initial Conditions Calculation" function, controlled by a simple software script, may then be used to perform automatic component sizing. Each component is minimised in mass, subject to a chosen safety factor against failure, over a given operating cycle. Whilst the example is in the realm of mechanical design, it must be emphasised that the approach is equally applicable to the electrical or mechatronic domains, indeed to any design problem requiring numerical constraint satisfaction.

Scalar dissipation and mean reaction rates in premixed turbulent combustion

A general equation for a variance parameter, appearing as a crucial quantity in a simple algebraic expression for the mean chemical rate, is derived. This derivation is based on a flamelet approach to model a turbulent premixed flame, for high but finite values of the Damköhler number. Application of this equation to the case of a planar turbulent flame normal to the oncoming flow of reactants gives good agreement with DNS data corresponding to three different values of the Damköhler number and two values of the heat release parameter. © 2011.

Conditional Moment Closure for Turbulent Premixed Flames

The conditional moment closure (CMC) method has been successfully applied to various non-premixed combustion systems in the past, but its application to premixed flames is not fully tested and validated. The main difficulty is associated with the modeling of conditional scalar dissipation rate of the conditioning scalar, the progress variable. A simple algebraic model for the conditional dissipation rate is validated using DNS results of a V-flame. This model along with the standard k- turbulence modeling is used in computations of stoichiometric pilot stabilized Bunsen flames using the RANS-CMC method. A first-order closure is used for the conditional mean reaction rate. The computed non reacting and reacting scalars are in reasonable agreement with the experimental measurements and are consistent with earlier computations using flamelets and transported PDF methods. Sensitivity to chemical kinetic mechanism is also assessed. The results suggest that the CMC may be applied across the regimes of premixed combustion.

The analysis of impact forces in randomly vibrating elastic systems

This work is concerned with the characteristics of the impact force produced when two randomly vibrating elastic bodies collide with each other, or when a single randomly vibrating elastic body collides with a stop. The impact condition includes a non-linear spring, which may represent, for example, a Hertzian contact, and in the case of a single body, closed form approximate expressions are derived for the duration and magnitude of the impact force and for the maximum deceleration at the impact point. For the case of two impacting bodies, a set of algebraic equations are derived which can be solved numerically to yield the quantities of interest. The approach is applied to a beam impacting a stop, a plate impacting a stop, and to two impacting beams, and in each case a comparison is made with detailed numerical simulations. Aspects of the statistics of impact velocity are also considered, including the probability that the impact velocity will exceed a specified value within a certain time. © 2012 Elsevier Ltd. All rights reserved.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Progressive 3D reconstruction of infrastructure with videogrammetry

A number of methods are commonly used today to collect infrastructure's spatial data (time-of-flight, visual triangulation, etc.). However, current practice lacks a solution that is accurate, automatic, and cost-efficient at the same time. This paper presents a videogrammetric framework for acquiring spatial data of infrastructure which holds the promise to address this limitation. It uses a calibrated set of low-cost high resolution video cameras that is progressively traversed around the scene and aims to produce a dense 3D point cloud which is updated in each frame. It allows for progressive reconstruction as opposed to point-and-shoot followed by point cloud stitching. The feasibility of the framework is studied in this paper. Required steps through this process are presented and the unique challenges of each step are identified. Results specific to each step are also presented.

Automated sparse 3D point cloud generation of infrastructure using its distinctive visual features

The commercial far-range (>10 m) spatial data collection methods for acquiring infrastructure’s geometric data are not completely automated because of the necessary manual pre- and/or post-processing work. The required amount of human intervention and, in some cases, the high equipment costs associated with these methods impede their adoption by the majority of infrastructure mapping activities. This paper presents an automated stereo vision-based method, as an alternative and inexpensive solution, to producing a sparse Euclidean 3D point cloud of an infrastructure scene utilizing two video streams captured by a set of two calibrated cameras. In this process SURF features are automatically detected and matched between each pair of stereo video frames. 3D coordinates of the matched feature points are then calculated via triangulation. The detected SURF features in two successive video frames are automatically matched and the RANSAC algorithm is used to discard mismatches. The quaternion motion estimation method is then used along with bundle adjustment optimization to register successive point clouds. The method was tested on a database of infrastructure stereo video streams. The validity and statistical significance of the results were evaluated by comparing the spatial distance of randomly selected feature points with their corresponding tape measurements.

Progressive Site Modelling with Videogrammetry

A number of methods are commonly used today to collect as-built spatial data (time-of-flight, visual triangulation, etc.). However, current practice lacks a solution that is accurate, automatic and cost-efficient at the same time. LiDARmethods generate high resolution depth information, but the significant cost of the equipment counteracts their benefits for the majority of construction projects. This is true especially for small projects, where projected savings hardly justify adopting this technology. Vision-based technologies, such as videogrammetry, is potentially able to address the existing limitations.

Three-Dimensional Tracking of Construction Resources using an On-Site Camera System

Vision trackers have been proposed as a promising alternative for tracking at large-scale, congested construction sites. They provide the location of a large number of entities in a camera view across frames. However, vision trackers provide only two-dimensional (2D) pixel coordinates, which are not adequate for construction applications. This paper proposes and validates a method that overcomes this limitation by employing stereo cameras and converting 2D pixel coordinates to three-dimensional (3D) metric coordinates. The proposed method consists of four steps: camera calibration, camera pose estimation, 2D tracking, and triangulation. Given that the method employs fixed, calibrated stereo cameras with a long baseline, appropriate algorithms are selected for each step. Once the first two steps reveal camera system parameters, the third step determines 2D pixel coordinates of entities in subsequent frames. The 2D coordinates are triangulated on the basis of the camera system parameters to obtain 3D coordinates. The methodology presented in this paper has been implemented and tested with data collected from a construction site. The results demonstrate the suitability of this method for on-site tracking purposes.

Sensor graphs for guaranteed cooperative localization performance

A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of the graph of relative measurements is known to affect the steady-state value of the position error covariance matrix. Classes of sensor graphs are identified, for which tight bounds for the trace of the covariance matrix can be obtained based on the algebraic properties of the underlying relative measurement graph. The string and the star graph topologies are considered, and the explicit form of the eigenvalues of error covariance matrix is given. More general sensor graph topologies are considered as combinations of the string and star topologies, when additional edges are added. It is demonstrated how the addition of edges increases the trace of the steady-state value of the position error covariance matrix, and the theoretical predictions are verified through simulation analysis.