• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.306-319
• /
• 2008

Reaching fault tolerance in technological systems requires to detect malfunctions. This paper presents a diagnostic method that is robust with respect to unknown-but-bounded uncertainties of the dynamical model and the measurements. By using models of the faultless and the faulty behaviours, a state-set observer computes polyhedral sets from which the consistency of the models with the interval measurements is determined. The diagnostic result is proven to be complete, i.e., the set of faults obtained by the diagnostic algorithm includes the actual fault. The algorithm is illustrated by an application example.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.3
• /
• pp.502-507
• /
• 2005

The dual-mode strategy has been adopted in many constrained MPC (Model Predictive Control) methods. The size of stabilizable regions of states of MPC methods depends on the size of underlying feasible and positively invariant sets and the number of control moves. The results, however, may perhaps be conservative because the definition of positive invariance does not allow temporal departure of states from the set. In this paper, a concept of periodic invariance is introduced in which states are allowed to leave a set temporarily but return into the set in finite time steps. The periodic invariance can be defined with respect to sets of different state feedback gains. These facts make it possible for the periodically invariant sets to be considerably larger than ordinary invariant sets. The periodic invariance can be defined for systems with polyhedral model uncertainties. We derive a MPC method based on these periodically invariant sets. Some numerical examples are given to show that the use of periodic invariance yields considerably larger stabilizable sets than the case of using ordinary invariance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1-4
• /
• 2004

The dual-mode strategy has been adopted in many constrained MPC methods. The size of stabilizable regions of states of MPC methods depends on the size of underlying feasible and positively invariant set and number of control moves. These results, however, could be conservative because the definition of positive invariance does not allow temporal leave of states from the set, In this paper, a concept of periodic invariance is introduced in which states are allowed to leave a set temporarily but return into the set in finite steps. The periodic invariance can defined with respect to sets of different state feedback gains. These facts make it possible for the periodically invariant sets to considerably larger than ordinary invariant sets. The periodic invariance can be defined for systems with polyhedral model uncertainties. We derive a MPC method based on these periodically invariant sets. Some numerical examples are given to show that the use of periodic invariance yields considerably larger stabilizable sets than the case of using ordinary invariance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.762-766
• /
• 2003

In this paper, we present a new approach to solve the problem of estimating the camera 3-D location and orientation from a matched set of 3-D model and 2-D image features. An iterative least-square method is used to solve both rotation and translation simultaneously. Because conventional methods that solved for rotation first and then translation do not provide good solutions, we derive an error equation using roll-pitch-yaw angle to present the rotation matrix. To minimize the error equation, Levenberg-Marquardt algorithm is introduced with uniform sampling strategy of rotation space to avoid stuck in local minimum. Experimental results using real images are presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.63.4-63
• /
• 2001

An x-ray vision can be a unique method to monitor and analyze the motion of mechanical parts in real time which are invisible from outside. Our problem is to identify the pose, i.e. the position and orientation of an object from x-ray projection images. It is assumed here that the x-ray imaging conditions that include the relative coordinates of the x-ray source and the image plane are predetermined and the object geometry is known. In this situation, an x-ray image of an object at a given pose can be estimated computationally by using a priori known x-ray projection image model. It is based on the assumption that a pose of an object can be determined uniquely to a given x-ray projection image. Thus, once we have the numerical model of x-ray imaging process, x-ray image of the known object at any pose could be estimated ...

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.519-521
• /
• 2003

Within the paper an approach for the automatic extraction and reconstruction of buildings in urban built-up areas base on fusion of high-resolution satellite image and LIDAR data is presented. The presented data fusion scheme is essentially motivated by the fact that image and range data are quite complementary. Raised urban objects are first segmented from the terrain surface in the LIDAR data by making use of the spectral signature derived from satellite image, afterwards building potential regions are initially detected in a hierarchical scheme. A novel 3D building reconstruction model is also presented based on the assumption that most buildings can be approximately decomposed into polyhedral patches. With the constraints of presented building model, 3D edges are used to generate the hypothesis and follow the verification processes and a subsequent logical processing of the primitive geometric patches leads to 3D reconstruction of buildings with good details of shape. The approach is applied on the test sites and shows a good performance, an evaluation is described as well in the paper.

• Structural Monitoring and Maintenance
• /
• v.4 no.3
• /
• pp.195-220
• /
• 2017

Nowadays, railway system plays a significant role in transportation, conveying cargo, passengers, minerals, grains, and so forth. Railway ballasted track is a conventional railway track as can be seen all over the world. Ballast, located underneath the sleepers, is the most important elements on ballasted track, which has many functions and requires routine maintenance. Ballast needs to be maintained frequently to prevent rail buckling, settlement, misalignment so that ballast has to be modelled accurately. Continuum model was introduced to model granular material and was extended in ballast. However, ballast is a heterogeneous material with highly nonlinear behaviour. Hence, ballast could not be modelled accurately in continuum model due to the discontinuities nature and material degradation of ballast. Discrete element modelling (DEM) is proposed as an alternative approach that provides insight into constitutive model, realistic particle, and contact algorithm between each particle. DEM has been studied in many recent decades. However, there are limitations due to the high computational time and memory consumption, which cause the lack of using in high range. This paper presents a review of recent ballast modelling with benefits and drawbacks. Ballast particles are illustrated either circular, circular crump, spherical, spherical crump, super-quadric, polygonal and polyhedral. Moreover, the gaps and limitations of previous studies are also summarized. The outcome of this study will help the understanding into different ballast modelling and particle. The insight information can be used to improve ballast modelling and monitoring for condition-based track maintenance.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.1-7
• /
• 2002

The fast extraction of the silhouettes of a model is very useful for many applications in computer graphics and animation. In this paper, we present an efficient algorithm to compute a sequence of perspective silhouettes for a polyhedral model from a moving viewpoint. The viewpoint is assumed to move along a trajectory q(t), which is a space curve of a time parameter t. Then, we can compute the time-intervals for each edge of the model to be contained in the silhouette by two major computations: (i) intersecting q(t) with two planes and (ii) a number of dot products. If q(t) is a curve of degree n, then there are at most of n + 1 time-intervals for an edge to be in a silhouette. For each time point $t_i$ we can extract silhouette edges by searching the intervals containing $t_i$ among the computed intervals. For the efficient search, we propose two kinds of data structures for storing the intervals: an interval tree and an array. Our algorithm can be easily extended to compute the parallel silhouettes with minor modifications.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.3 s.234
• /
• pp.447-454
• /
• 2005

This paper presents a new paradigm for 3-axis tool path generation based on an incomplete 2-manifold mesh model, namely, an inexact polyhedron. When geometric data is transferred from one system to another system and tessellated for tool path generation, the model does not have any topological data between meshes and facets. In contrast to the existing polyhedral machining approach, the proposed method generates tool paths from an incomplete 2-manifold mesh model. In order to generate gouge-free tool paths, CL-meshes are generated by offsetting boundary edges, boundary vertices, and facets. The CL-meshes are sliced by machining planes and the calculated intersections are sorted, trimmed, and linked. The grid method is used to reduce the computing time when range searching problems arise. The method is fully implemented and verified by machining an incomplete 2-manifold mesh model.

• Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.55-66
• /
• 2015

To satisfy safety regulations of Economic Commission for Europe (ECE), the surface regions of automobile parts must have a sufficient degree of roundness if there is any chance that they could contact a sphere of 50.0 mm radius (exterior parts) or 82.5 mm radius (interior parts). In this paper, a new offset-based method is developed to automatically detect the possible sphere-contacting shape of such parts. A polyhedral model that precisely approximates the part shape is given as input, and the offset shape of the model is obtained as the Boolean union of the expanded shapes of all surface triangles. We adopt a triple-dexel representation of the 3D model to enable stable and precise Boolean union computations. To accelerate the dexel operations in these Boolean computations, a new parallel processing method with a pseudo-list structure and axis-aligned bounding box is developed. The possible sphere-contacting shape of the part surface is then extracted from the offset shape as a set of points or a set of polygons.