A second-order maximum principle for discrete-time bilinear control systems with applications to discrete-time linear switched systems

A powerful approach for analyzing the stability of continuous-time switched systems is based on using optimal control theory to characterize the “most unstable” switching law. This reduces the problem of determining stability under arbitrary switching to analyzing stability for the specific “most unstable” switching law. For discrete-time switched systems, the variational approach received considerably less attention. This approach is based on using a first-order necessary optimality condition in the form of a maximum principle (MP), and typically this is not enough to completely characterize the “most unstable” switching law. In this paper, we provide a simple and self-contained derivation of a second-order necessary optimality condition for discrete-time bilinear control systems. This provides new information that cannot be derived using the first-order MP. We demonstrate several applications of this second-order MP to the stability analysis of discrete-time linear switched systems.     

Invariant ellipsoid method for minimization of unmatched disturbances effects in sliding mode control

A new sliding mode control design algorithm for a linear and a class of nonlinear quasi-Lipschitz disturbed system is presented. It is based on the appropriate selection of the sliding surface via invariant ellipsoid method. The designed control guarantees minimization of unmatched disturbances effects to system motions in a sliding mode. The obtained theoretical results are approved by numerical simulations.     

Spacecraft formation reconfiguration with collision avoidance

In this paper we present a behavioral control solution for reconfiguration of a spacecraft formation using the Null-Space Based (NSB) concept. The solution is task based, and aims to reconfigure and maintain a rigid formation while avoiding collisions between spacecraft. A model of relative translation is derived, together with a passivity-based sliding surface controller which globally stabilizes the equilibrium point of the closed-loop system. The NSB control method is implemented by giving each task different priorities and then calculating desired velocity and a Jacobian matrix for each spacecraft and each task. The velocity vector for each task is then projected into the null-space for higher prioritized tasks to remove conflicting velocity components. Simulation results are presented, showing that each spacecraft moves into the predefined formation without breaking any rules for the higher priority tasks, and all collisions are avoided.     

An internal model principle is necessary and sufficient for linear output synchronization

Output synchronization of a network of heterogeneous linear state–space models under time-varying and directed interconnection structures is investigated. It is shown that, assuming stabilizability and detectability of the individual systems and imposing very mild connectedness assumptions on the interconnection structure, an internal model requirement is necessary and sufficient for synchronizability of the network to polynomially bounded trajectories. The resulting dynamic feedback couplings can be interpreted as a generalization of existing methods for identical linear systems.     

Traceability and management of dispersed product knowledge during design and manufacturing

Product development processes comprise highly creative and knowledge-intensive tasks that involve extensive information exchange and communication among geographically distributed teams. Due to the geographical and institutional separation between the different systems involved in the product lifecycle, product knowledge sharing is becoming a key issue in the information systems of extended enterprises. This paper addresses the issue and challenges of product knowledge traceability during the product development. The aim of this research effort is to enhance the sharing and use of product knowledge acquired during the development process using traceability information.A standardized approach is proposed to trace and share product knowledge and key constructs to support traceability during the product development process are identified and formalized. This research effort is based on the premise that an important step towards achieving product knowledge sharing is providing traceability across various product knowledge elements that are used in product development phases, i.e. design and manufacturing. Two disjointed but complementary case studies illustrating the benefit of traceability are presented. The potential role of traceability is described, first to support the decision making process during engineering change management (ECM), and second to support product-oriented modelling for knowledge sharing and exchanging to meet the quality requirements. The proposed approach has been implemented using the MEGA Suite tool and applied to each of the case studies and could be integrated to PLM systems currently in use.     

Direct generation of extended STL file from unorganized point data

An extended STL file format is presented in this paper. Differing with existing solutions, it proposes a new format to produce and store triangles. The format uses a cluster unit composed of several triangles. The main advantages of the format are that it contains both geometry and topological information and has improved storage capability. Direct generation of the extended STL from the scanned data has a great advantage in that it can reduce the time and error in modeling process. In order to obtain the format from unorganized point cloud, a new triangulation algorithm was introduced. The algorithm is based on reconstructing the relative Delaunay triangulation of the sample points on the surface. Other advantages of the extended STL format were also presented in this paper.     

Simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection

Tolerance specification is an important part of mechanical design. Design tolerances strongly influence the functional performance and manufacturing cost of a mechanical product. Tighter tolerances normally produce superior components, better performing mechanical systems and good assemblability with assured exchangeability at the assembly line. However, unnecessarily tight tolerances lead to excessive manufacturing costs for a given application. The balancing of performance and manufacturing cost through identification of optimal design tolerances is a major concern in modern design. Traditionally, design tolerances are specified based on the designer’s experience. Computer-aided (or software-based) tolerance synthesis and alternative manufacturing process selection programs allow a designer to verify the relations between all design tolerances to produce a consistent and feasible design. In this paper, a general new methodology using intelligent algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPSO) for simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection is presented. The problem has a multi-criterion character in which 3 objective functions, 3 constraints and 5 variables are considered. The average fitness factor method and normalized weighted objective functions method are separately used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find the computational effort of NSGA-II and MOPSO algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed.     

Controlled linear perturbation

We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately and efficiently using computer arithmetic. Approximate computation in floating point arithmetic is efficient but can assign incorrect signs to geometric predicates, which can cause combinatorial errors in the algorithm output. We make approximate computation accurate by performing small input perturbations, which we compute using differential calculus. This strategy supports fast, accurate Minkowski sum computation. The only prior robust implementation uses a less efficient algorithm, requires exact algebraic computation, and is far slower based on our extensive testing.     

An auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range

In this paper, we present an automatic C-code generation strategy for real-time nonlinear model predictive control (NMPC), which is designed for applications with kilohertz sample rates. The corresponding code export module has been implemented within the software package ACADO Toolkit. It is capable of exporting fixed step-size integrators together with their sensitivities as well as a real-time Gauss–Newton method. Here, we employ the symbolic representation of optimal control problems in ACADO in order to auto-generate plain C-code which is optimized for final production. The exported code has been tested for model predictive control scenarios comprising constrained nonlinear dynamic systems with four states and a control horizon of ten samples. The numerical simulations show a promising performance of the exported code being able to provide feedback in much less than a millisecond.     

Observability of switching structured linear systems with unknown input. A graph-theoretic approach

This paper deals with the observability of the discrete mode, the internal state and the input of switching structured linear systems with unknown input. The proposed method, based on a graph-theoretic approach, assumes only the knowledge of the system’s structure. We express, in graphical terms, necessary and sufficient conditions for the generic observability of the discrete mode, the continuous internal state and the input of a switching structured linear system. These conditions can be implemented by classical graph theory algorithms based on finding particular paths and cycles in a digraph.