A time aggregation approach to Markov decision processes

We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings.     

Interaction bounds in multivariable control systems

Time-domain limitations due to right half-plane zeros and poles in linear multivariable control systems are studied. Lower bounds on the interaction are derived. They show not only how the location of zeros and poles are critical in multivariable systems, but also how the zero and pole directions influence the performance. The results are illustrated on the quadruple-tank process, which is a new multivariable laboratory process.     

Switching controller design via convex polyhedral Lyapunov functions

In this paper we propose a systematic switching control design method for a class of nonlinear discrete time hybrid systems. The novelty of the adopted approach is in the fact that unlike conventional control the control burden is shifted to a logical level thus creating the need for the development of new analysis/design methods.     

Performance gain margins of the two-stage LQ reliable control

This paper presents the performance gain margins of the recently developed two-stage LQ reliable control, which is a discrete-time version of Veillette's reliable LQ regulator, such that the performance cost is guaranteed to be within a certain bound. It is shown that the desired gain margins satisfy a unified gain margin constraint and a solution to solve this constraint is obtained in terms of linear matrix inequalities. An application of the proposed unified gain margin constraint to design a reliable guaranteed cost controller is illustrated. A numerical example is also given to show the effectiveness of the proposed results.     

Recognition of machining features for cast then machined parts

Mechanical parts are typically manufactured using multiple manufacturing processes. Primary processes such as casting realize the primary shape of the part, while secondary processes such as machining generate more detailed shape of the part. This paper presents a feature recognition method to support machining process planning for cast-then-machined parts. From the part model including the specification of machined faces, we generate the starting workpiece for machining, which represents the casting output in sufficient detail to support machining process planning. The starting workpiece is generated by identifying faces to be made by casting followed by machining, then offsetting the part through these faces by a uniform machining thickness to obtain cast faces, and combining the halfspaces induced by machined faces and the halfspaces induced by their bounding cast faces to enclose removal volumes. Machining features are then recognized from the removal volumes using a volume decomposition method called Alternating Sum of Volumes with Partitioning.     

Offset tool-path linking for pocket machining

For die-cavity pocketing, contour-parallel offset (CPO) machining is the most popular machining strategy. CPO tool-path generation for pocketing includes geometrical and technological issues: (1) a 2D-curve offsetting algorithm; and (2) optimizing technological objectives, such as tool-path linking. The 2D-curve offsetting solution has been widely studied, because it has so many potential applications. However, though the tool-path linking may seriously affect the machining performance, there have been few reported investigations on optimizing the CPO tool-path linking. This paper presents a CPO tool-path linking procedure optimizing technological objectives, such as dealing with islands (positive and negative) and minimizing tool retractions, drilling holes and slotting. Main features of the proposed algorithm are as follows: (1) a data structure, called a ‘TPE-net’, is devised to provide information on the parent/child relationships among the tool-path-elements; (2) the number of tool retractions is minimized by a ‘tool-path-element linking algorithm’ finding a tour through the TPE-net; and (3) the number of drilling holes is minimized by making use of the concept of the ‘free space’ (negative islands or already machined region).     

An integrated modelling environment for the embodiment of mechanical systems

The efficient, economical and often elegant transformation from a design schema to an embodied design solution containing real components is essential for the commercial success of a product. More often the ability of the designer to explore an optimum solution is severely frustrated by the analytically intensive and time-consuming aspects of embodying a concept. This paper presents a computer based system-modelling tool that is to be used by designers during the transformation of a concept to an embodied solution particularly to deal with standard components. This environment provides for the representation of conceptual schemas and subsequent embodiment from computer based component selection modules. These selection modules encompass the full range of electronic representations for standard mechanical components. The strategy for representing a mechanical system, its included components and their associated representations is discussed. The process of constructing a system model, specifying the desired performance characteristics and system resolution are also described.     

Biarc approximation of NURBS curves

An algorithm for approximating arbitrary NURBS curves with biarcs is presented. The main idea is to approximate the NURBS curve with a polygon, and then to approximate the polygon with biarcs to within the required tolerance. The method uses a parametric formulation of biarcs appropriate in geometric design using parametric curves. The method is most useful in numerical control to drive the cutter along straight line or circular paths.     

Logarithm bispectrum-based approach to radar range profile for automatic target recognition

The paper starts by the definition of logarithm bispectrum and the presentation of its properties relative to target recognition. A relationship is established between the logarithm bispectrum feature of a target and that of its high resolution range profile. As a result, the criterion for target recognition, based on the relationship, is induced, and its scheme and pseudocode for implementation are given. Simulation with some acquired outfield data is given to show that the approach is effective and advantageous in both rapid recognition and easy computation.     

3D C-string: a new spatio-temporal knowledge representation for video database systems

In video database systems, one of the most important methods for discriminating the videos is by using the objects and the perception of spatial and temporal relations that exist between objects in the desired videos. In this paper, we propose a new spatio-temporal knowledge representation called 3D C-string. The knowledge structure of 3D C-string, extended from the 2D C⁺-string, uses the projections of objects to represent spatial and temporal relations between the objects in a video. Moreover, it can keep track of the motions and size changes of the objects in a video. The string generation and video reconstruction algorithms for the 3D C-string representation of video objects are also developed. By introducing the concept of the template objects and nearest former objects, the string generated by the string generation algorithm is unique for a given video and the video reconstructed from a given 3D C-string is unique too. This approach can provide us an easy and efficient way to retrieve, visualize and manipulate video objects in video database systems. Finally, some experiments are performed to show the performance of the proposed algorithms.