Search

Throughout the world, the reliability-based approach to safety design of aircraft systems is quite mature and widely used. However, there are still shortcomings in the reliability-based aircraft system safety analysis method. It cannot dynamically analyze the accident evolution process and lack consideration of the complex situation of multifactor coupling. On the basis of the original aircraft system safety analysis method, this paper innovatively proposes a functional hazard analysis (FHA) method based on the analytic hierarchy process (AHP) and multifactor fuzzy comprehensive assessment (FCA). The purpose is to improve the objectivity and quantification of the FHA method in the safety design of aircraft systems. At the same time, in the terminal airworthiness verification, this paper proposes a repeatable and controllable virtual test flight verification method, which aims to reduce the cost and cycle of the terminal airworthiness verification and expand the coverage of the envelope verification. Finally, combined with the clauses in MIL-HDBK-516B, a case calculation is carried out to verify the feasibility of the proposed method. [ABSTRACT FROM AUTHOR]

To make agents' route decision-making behaviours as real as possible, this paper proposes a layered navigation algorithm, emphasizing the coordinating of the global route planning at strategic level and the local route planning at tactical level. Specifically, by an improved visibility graph method, the global route is firstly generated based on static environment map. Then, a new local route planning (LRP) based on dynamic local environment is activated for multipath selection to allow pedestrian to respond changes at a real-time sense. In particular, the LRP model is developed on the basis of a passenger's psychological motivation. The pedestrians' individual preferences and the uncertainties existing in the process of evaluation and choice are fully considered. The suitable local path can be generated according to an estimated passing time. The LRP model is applied to the choice of ticket gates at a subway station, and the behaviours of gate choosing and rechoosing are investigated. By utilizing C++, the layered navigation algorithm is implemented. The simulation results exhibit agents' tendency to avoid congestion, which is often observed in real crowds. [ABSTRACT FROM AUTHOR]

In the traditional EKF-SLAM algorithm, the computational complexity and uncertainty will grow up rapidly with the increase of the feature points and the enlargement of the map coverage. As we know, the computational complexity is proportional to the quadratic of the number of feature points contained in a single filtering process. The approach represented in the paper combines EKF-SLAM with local submaps, which can improve the computational efficiency and reduce the computational complexity. At first, an independent local submap is established for the observed feature points. When the number of feature points contained in the local submap reaches a certain threshold value, the local submap is integrated into the global map. At last, the submap is initialized again. The simulation results show that the approach can reduce the computational complexity effectively and increase the computation speed greatly in the case of maintaining the computational accuracy of the traditional EKF-SLAM algorithm. [ABSTRACT FROM AUTHOR]

The paper presents the theoretical analysis and simulation verification of robust fault diagnosis and adaptive parameter identification for single phase transformerless inverters. The fault diagnosis is composed of two parts, fault detection and fault identification. In the fault detection part, a Luenberger observer is designed to realize the detection of faults. Then, we apply a bank of observers to identify the location of faults. Meanwhile, the fault identification observers based estimation along with a gradient descent algorithm are also used in the parameter identification to estimate the actual values of components in a single phase transformerless inverter. Not only we develop the design methodology for the robust fault diagnosis and adaptive parameter identifier but also we present simulation results. The simulation results show the effectiveness of fault diagnosis and the accurate tracking of changes in component parameters for a wide range. [ABSTRACT FROM AUTHOR]

This paper focuses on the lane departure avoidance system for a four in-wheel motors’ drive electric vehicle, aiming at preventing lane departure under dangerous driving conditions. The control architecture for the lane departure avoidance system is hierarchical. In the upper controller, the desired yaw rate was calculated with the consideration of vehicle-lane deviation, vehicle dynamic, and the limitation of road adhesion. In the middle controller, a sliding mode controller (SMC) was designed to control the additional yaw moment. In the lower layer, the yaw moment was produced by the optimal distribution of driving/braking torque between four wheels. Lane departure avoidance was carried out by tracking desired yaw response. Simulations were performed to study the effectiveness of the control algorithm in Carsim®/Simulink® cosimulation. Simulation results show that the proposed methods can effectively confine the vehicle in lane and prevent lane departure accidents. [ABSTRACT FROM AUTHOR]

Wireless sensor networks have been widely used in a variety of commercial and military applications, which often require neighbor nodes to establish connection quickly. Due to high mobility of nodes, it is a challenging issue to reduce discovery delay. Most discovery designs are based on pairwise and fixed duty cycle, in which discovery is passively achieved when two nodes wake up at the same time. In order to further improve the efficiency of neighbor discovery in mobile sensor networks, this paper proposes an improved group-based neighbor discovery algorithm (IGND) which dynamically adjusts the nodes' active time based on spatial properties. This paper describes the network model and the algorithm implementation in detail. Simulation results show that the improved algorithm has a good effect in reducing discovery latency and promoting discovery efficiency. [ABSTRACT FROM AUTHOR]

Message propagation is a primary means to locate resources in current unstructured peer-to-peer (P2P) systems and how to reduce effectively the redundant messages of propagation while keeping its high network coverage is what many researchers go in for in this field. In this paper, we propose the algorithm of LMPR, a scheme of improved MPR for message propagation in distributed unstructured P2P system. Based on analyzing the process and message redundancy of MPR, this paper proposes to add to such scheme a mechanism of specified relay-list to reduce further the number of its retransmitting of message. By attaching to each relay-peer a relay-list with peers it will relay message to, the scheme can assure that in the view of each decision-peer a broadcast message can be dispatched and only be dispatched once to every neighbor peer within 2 hops of it. Simulation results show that the scheme of LMPR has better performance than that of MPR in message redundancy, network overhead, and fluctuation brought to the system. [ABSTRACT FROM AUTHOR]

This paper is concerned with accurate and efficient numerical methods for solving viscous and nonviscous wave problems. The paper first introduces a new second-order PR-ADI like scheme. For an efficient simulation, the scheme is also extended to a highorder compact PRADI likemethod. Both of themhave the advantages of unconditional stability, less impact of the perturbing terms on the accuracy, and being convenient to compute the boundary values of the intermediates. Besides this, the compact scheme has high-order accuracy and costs less in computational time. Numerical results are presented to show the accuracy and efficiency of the new algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a flexible solution methodology for the capacitated vehicle routing problem with stochastic travel times (CVRPSTT). One of the basic ideas of the methodology is to consider a vehicle working time lower than the actual maximum vehicle working time when designing CVRPSTT solutions. In this way, the working time surplus can be used to cope with unexpected congestions when necessary. Another important idea is to transform the CVRPSTT instance to a limited set of capacitated vehicle routing problems (CVRP), each of which is defined by a given percentage of the maximum vehicle working time. Thus, our approach can take advantage of any efficient heuristic that already exists for the CVRP. Based on the two key ideas, this paper presents a simulation-based algorithm, in which Monte Carlo simulation is used to obtain estimates of the cost and the reliability of each solution, and the Clarke and Wright heuristic is improved to generate more reliable solutions. Finally, a number of numerical experiments are done in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios. [ABSTRACT FROM AUTHOR]

This paper presents the design and implementation of a super-twisting algorithm second-order sliding mode controller (SOSMC) for a synchronous reluctance motor. SOSMC is an effective tool for the control of uncertain nonlinear systems since it overcomes themain drawbacks of conventional slidingmode control, that is, large control effort and chattering. The practical implementation of SOSMC has simple control laws and assures an improvement in sliding accuracy with respect to conventional sliding mode control. This paper proposes a control scheme based on super-twisting algorithm SOSMC. The SOSMC is mathematically derived, and its performance is verified by simulation and experiments. The proposed SOSMC is robust against motor parameter variation and mitigates chattering. [ABSTRACT FROM AUTHOR]

The paper proposes a procedure for design of PI controllers for hydraulic systems with long transmission lines which are described by models of high order. Design is based on the combination of the IE criterion and engineering specifications (settling time and relative stability) as well as on the application of D-decomposition. In comparison with some known results, the method is of graphical character, and it is very simple (solving nonlinear algebraic equations is eliminated). The paper presents the algorithm of software procedure for design of the controller. The method is compared with other methods at the level of simulation, and its superiority is shown. By applying theNyquist criterion, it is shown that themethod possesses robustness in relation to nonmodelled dynamics. [ABSTRACT FROM AUTHOR]

Algorithms for harmonic detection and compensation are important guarantees for an active power filter (APF) to achieve the harmonic control function and directly determine the overall performance. Existing algorithms usually need a large amount of computation, and the compensation effect of specified order harmonic is also limited. DC side capacitor voltage at sudden change of load is affected by the algorithm as well. This paper proposes a new algorithm for harmonic detection and compensation based on synchronous reference frame (SRF), in which a band-pass filter with center frequency of 6kth harmonic is designed in fundamental frequency SRF to extract random harmonic current with two different frequencies of (6k±1)th harmonic in stationary reference frame. This new algorithm can rapidly detect any specified harmonic, and it can adjust the power factor to compensate reactive power. Meanwhile, it has few impacts on DC side capacitor voltage under complicated operating conditions such as sudden change of load. The correctness and effectiveness of this new algorithm are verified by simulation and experiment. [ABSTRACT FROM AUTHOR]

Open source design (OSD) is an emerging mode of product design. In OSD process, how to select right tasks directly influences the efficiency and quality of task completion, hence impacting the whole evolution process of OSD. In this paper, designer’s bidirectional behavior of task selection integrating passive selection based on website recommendation and autonomous selection is modeled. First, the model of passive selection behavior by website recommendation is proposed with application of collaborative filtering algorithm, based on a three-dimensional matrix including information of design agents, tasks, and skills; second, the model of autonomous selection behavior is described in consideration of factors such as skill and incentive; third, the model of bidirectional selection behavior is described integrating the aforementioned two selection algorithms. At last, contrast simulation analysis of bidirectional selection, passive selection based on website recommendation, and autonomous selection is proposed with ANOVA, and results show that task selection behavior has significant effect on OSD evolution process and that bidirectional selection behavior is more effective to shorten evolution cycle according to the experiment settings. In addition, the simulation study testifies the model of bidirectional selection by describing the task selection process of OSD in microperspective. [ABSTRACT FROM AUTHOR]

This paper presents a synthetic algorithm for tracking a moving object in a multiple-dynamic obstacles environment based on kinematically planar manipulators. By observing the motions of the object and obstacles, Spline filter associated with polynomial fitting is utilized to predict their moving paths for a period of time in the future. Several feasible paths for the manipulator in Cartesian space can be planned according to the predicted moving paths and the defined feasibility criterion. The shortest one among these feasible paths is selected as the optimized path. Then the real-time path along the optimized path is planned for the manipulator to track the moving object in real-time. To improve the convergence rate of tracking, a virtual controller based on PD controller is designed to adaptively adjust the real-time path. In the process of tracking, the null space of inverse kinematic and the local rotation coordinate method (LRCM) are utilized for the arms and the end-effector to avoid obstacles, respectively. Finally, the moving object in a multiple-dynamic obstacles environment is thus tracked via real-time updating the joint angles of manipulator according to the iterative method. Simulation results show that the proposed algorithm is feasible to track a moving object in a multiple-dynamic obstacles environment. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of distributed fusion when the conditional independence assumptions on sensor measurements or local estimates are not met. A new data fusion algorithm called Copula fusion is presented. The proposed method is grounded on Copula statistical modeling and Bayesian analysis. The primary advantage of the Copula-based methodology is that it could reveal the unknown correlation that allows one to build joint probability distributions with potentially arbitrary underlying marginals and a desired intermodal dependence. The proposed fusion algorithm requires no a priori knowledge of communications patterns or network connectivity. The simulation results show that the Copula fusion brings a consistent estimate for a wide range of process noises. [ABSTRACT FROM AUTHOR]

In complex systems like Large-ScaleDistributed Systems (LSDSs) the optimization of resource control is an open issue. The large number of resources and multicriteria optimization requirements make the optimization problem a complex one. The importance of resource control increases with the need of use for industrial process and manufacturing, being a key solution for QoS assuring. This paper presents different solutions for multiobjective decentralized control models for tasks assignment in LSDS. The transaction in real-time complex system is modeled in simulation by tasks which will be scheduled and executed in a distributed system, so a set of specifications and requirements are known. The paper presents a critical analysis of existing solutions and focuses on a genetic-based algorithm for optimization. The contribution of the algorithm is the fitness function that includes multiobjective criteria for optimization in different way. Several experimental scenarios, modeled using simulation, were considered to offer a support for analysis of near-optimal solution for resource selection. [ABSTRACT FROM AUTHOR]

Evaluating the reliability of a transportation network often involves an intensive simulation exercise to randomly generate and evaluate different possible network states. This paper proposes an algorithm to approximate the network reliability which minimizes the use of such simulation procedure. The algorithm will dissect and classify the network states into reliable, unreliable, and un-determined partitions. By postulating the monotone property of the reliability function, each reliable and/or unreliable state can be used to determine a number of other reliable and/or unreliable states without evaluating all of them with an equilibrium assignment procedure. The paper also proposes the cause-based failure framework for representing dependent link degradation probabilities. The algorithm and framework proposed are tested with a medium size test network to illustrate the performance of the algorithm. [ABSTRACT FROM AUTHOR]

This paper presents an equivalent-input-disturbance (EID-) based disturbance rejection method for fractional-order time-delay systems. First, a modified state observer is applied to reconstruct the state of the fractional-order time-delay plant. Then, a disturbance estimator is designed to actively compensate for the disturbances. Under such a construction of the system, by constructing a novel monochromatic Lyapunov function and using direct Lyapunov approach, the stability analysis and controller design algorithm are derived in terms of linear matrix inequality (LMI) technique. Finally, simulation results demonstrate the validity of the proposed method. [ABSTRACT FROM AUTHOR]

The profile recovery is an important work in X-ray pulsar-based navigation. It is a key step for the analysis on the pulsar signal’s characteristic and the computing of time of arrival (TOA). This paper makes an argument for an algorithm based on the tracking-differentiator (TD) to recover the profile from the low Signal-to-Noise Ratio (SNR) signals. In the method, a TD filter with cascade structure is designed which has very low phase delay and amplitude distortion. In the simulation experiment, two typical pulsars (PSR B0531+21 and PSR B1937+21) are used to verify the algorithm’s performance. The simulation results show that the method satisfies the application requirements in the aspects of SNR and profile fidelity. By processing the data collected by the Rossi X-Ray Timing Explorer (RXTE) satellite in space, similar results can also be achieved. [ABSTRACT FROM AUTHOR]

Delaunay refinement is a technique for generating unstructured meshes of triangles for sensor network configuration engineering practice. A new method for solving Delaunay triangulation problem is proposed in this paper, which is called endpoint triangle’s circumcircle model (ETCM). As compared with the original fractional node refinement algorithms, the proposed algorithm can get well refinement stability with least time cost. Simulations are performed under five aspects including refinement stability, the number of additional nodes, time cost, mesh quality after intruding additional nodes, and the aspect ratio improved by single additional node. All experimental results show the advantages of the proposed algorithm as compared with the existing algorithms and confirm the algorithm analysis sufficiently. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSNs), connecting disjoint segments is significant for network restoration, especially in some mission critical applications. However, the variability of distances between disjoint segments has tremendous influence on relay nodes deployment. In fact, finding the optimal solution for connecting disjoint segments in terms of the number and positions of relay nodes is NP-hard. To address this issue, plenty of heuristics, such as STP-MSP (Cheng et al., 2008), MST-1tRN (Lloyd et al., 2007), and CORP (Lee and Younis, 2010) are deeply pursued. In this paper, we propose a distributed restoration algorithm based on optimal relay node placement (simply, ORNP). It aims at federating separated segments by populating the minimum number of relay nodes in a WSN that has suffered a significant damage. In addition, both of complexity and upper bound of the relay count for ORNP are explored. The simulation results show that ORNP performs better than STP-MSP, MST-1tRN, and CORP in terms of relay count and the connectivity of resulting topology. [ABSTRACT FROM AUTHOR]

We present an approach for the modelling and simulating of the modem section of underwater sensor networks. The proposal is based on a specially designed modem architecture and the use of simulation tools and models that represent each of the communication elements: the water medium, physical transducers, electronics, and coding/decoding software. The algorithms can be simulated in the modelling environment; this framework does not require recoding and allows the combination of real and modelled elements. In physical terms, the modem engine provides a decoupled pipelined design of the processing path for the algorithms which allows users to run complex algorithms without requiring a highly demanding specific hardware. The proposal includes a methodology that has allowed us to significantly reduce the effort required in the process, from algorithm development to the effective deployment of the system. As a case study, this paper shows its application and results in the evaluation of a multipath and Doppler-shift correction algorithms. [ABSTRACT FROM AUTHOR]

How to cover a monitored area with the minimum number of sensor nodes is a fundamental in wireless sensor network (WSN). To address this problem, this paper proposes ECAPM, that is, Enhanced Coverage Algorithm Based on Probability Model. Given an area to monitor, ECAPM can calculate the minimum number of sensor nodes to cover that area. Firstly, ECAPM introduces the method to compute the expectation of probability that a sensor node is covered. Then ECAPM presents the procedure of expected value calculation when target node is covered by one sensor node and N sensor nodes. Finally ECAPM verifies the relation of proportional function when random variables are not independent. The simulation results show that ECAPM can cover the monitored area effectively with less sensor nodes and improve the quality of coverage. [ABSTRACT FROM AUTHOR]

Extensive research in the field of telecommunications has been done on the techniques of multipath routing, as they offer many advantages over conventional single-path routing methods. Some of these techniques make use of the so-called Destination- Oriented Directed Acyclic Graphs (DODAGs) which are constructed on the networks, usually in a distributed way. However, while defining methods of forming DODAGs, the authors of multipath algorithms tend to overlook a possibly significant issue which could, in a way, define the quality of a given DODAG in the context of multipath routing, namely, providing an equitable distribution of the paths between the nodes in the newly created DODAG. In this paper, a few requirements for constructing a "fair" DODAG are identified in the context of multipath routing. An optimization algorithm that tries to find an equitable solution according to these requirements is also presented. Three DODAG-creation algorithms that appear in the literature are simulated and compared against this equitable solution, and none of them is getting close to it in terms of fairness in the distribution of the paths. Moreover, two interesting properties of equitable solutions are revealed in the simulations. [ABSTRACT FROM AUTHOR]

Images are often corrupted by impulse noise. In this paper, an alternating direction minimization with continuation algorithm is modified and iteratively used to remove the impulse noise in images by exploring its self-similarity. A patch-based nonlocal operator and sparse representation are married in the l1-l1 optimization model to be solved. Simulation results demonstrate that the proposed algorithm outperforms typical denoisingmethods in terms of preserving edges and textures for both salt-and-pepper noise and random-valued impulse noise. It can be also applied to suppress impulse noise-like artifacts in real mural images. [ABSTRACT FROM AUTHOR]

In the recent years, there has been a huge advancement in wireless sensor computing technology. Today, wireless sensor network (WSN) has become a key technology for different types of smart environment. Nodes localization in WSN has arisen as a very challenging problem in the research community. Most of the applications for WSN are not useful without a priory known nodes positions. Adding GPS receivers to each node is an expensive solution and inapplicable for indoor environments. In this paper, we implemented and evaluated an algorithm based on multidimensional scaling (MDS) technique for three-dimensional (3D) nodes localization in WSN using improved heuristic method for distance calculation. Using extensive simulations we investigated our approach regarding various network parameters. We compared the results from the simulations with other approaches for 3D-WSN localization and showed that our approach outperforms other techniques in terms of accuracy. [ABSTRACT FROM AUTHOR]

There are some problems in traditional interacting multiple model algorithms (IMM) when used in target tracking systems. For instance, the mode transition matrix is inaccurate and cannot be determined when the sojourn times are not known. To solve these problems, an optimal mode transition matrix IMM (OMTM-IMM) algorithm is proposed in this paper. The linear minimum variance theory is used to calculate the mode transition matrix which depends on the continuous system state rather than the sojourn times in this algorithm. Moreover, the correlation of the sub filter is considered; hence the covariance matrices are utilized to compute mode transition matrix. In this algorithm, the model probability is defined as a diagonal matrix which is combined with the filters outputs; thus the effects produced by each state can be distinguished. Finally, to verify the superiority of the new algorithm, the theoretical proof and simulation results are given. They show that the OMTM-IMM algorithm can improve the tracking accuracy and can be utilized in the complex environment. [ABSTRACT FROM AUTHOR]

Road friction information is very important for vehicle active braking control systems such as ABS, ASR, or ESP. It is not easy to estimate the tire/road friction forces and coefficient accurately because of the nonlinear system, parameters uncertainties, and signal noises. In this paper, a robust and effective tire/road friction estimation algorithm for ABS is proposed, and its performance is further discussed by simulation and experiment. The tire forces were observed by the discrete Kalman filter, and the road friction coefficient was estimated by the recursive least square method consequently. Then, the proposed algorithm was analysed and verified by simulation and road test. A sliding mode based ABS with smooth wheel slip ratio control and a threshold based ABS by pulse pressure control with significant fluctuations were used for the simulation. Finally, road tests were carried out in both winter and summer by the car equipped with the same threshold based ABS, and the algorithm was evaluated on different road surfaces. The results show that the proposed algorithm can identify the variation of road conditions with considerable accuracy and response speed. [ABSTRACT FROM AUTHOR]

This paper considers a joint optimal design of admission control and resource allocation for multimedia services delivery in high-speed railway (HSR) wireless networks. A stochastic network optimization problem is formulated which aims at maximizing the system utility while stabilizing all transmission queues under the average power constraint. By introducing virtual queues, the original problem is equivalently transformed into a queue stability problem, which can be naturally decomposed into three separate subproblems: utility maximization, admission control, and resource allocation. A threshold-based admission control strategy is proposed for the admission control subproblem. And a distributed resource allocation scheme is developed for the mixed-integer resource allocation subproblem with guaranteed global optimality. Then a dynamic admission control and resource allocation algorithm is proposed, which is suitable for distributed implementation. Finally, the performance of the proposed algorithm is evaluated by theoretical analysis and numerical simulations under realistic conditions of HSR wireless networks. [ABSTRACT FROM AUTHOR]

The mixed wireless sensor networks that are composed of a mixture of mobile and static sensors are the tradeoff between cost and coverage. To provide the required high coverage, the mobile sensors have to move from dense areas to sparse areas. However, where to move and how to move are important issues for mobile sensors. This paper presents a centralized algorithm to assist the movement of mobile sensors. In this algorithm, the management node of the WSN collected the geographical information of all of the static and mobile sensors. Then, the management node executed the algorithm to get the best matches between mobile sensors and coverage holes. Simulation results show the effectiveness of our algorithm, in terms of saving energy and the load balance. [ABSTRACT FROM AUTHOR]

In recent years we have witnessed strong development and widespread use of powerful wirelessly connected platforms, thus the set of the related problems that need to be solved by distributed algorithms is growing rapidly. Some of them present large obstacles in harnessing the full potential of this new technology, so there is an imminent need for a fast and easy evaluation of new ideas and approaches. Simulation is a fundamental part of distributed algorithm design and evaluation process. In this paper, we present a library for event-based simulation and evaluation of distributed algorithms. This library provides a set of simple but powerful tools with a goal to ease virtual setup of a complex system such as a distributed network of communicating entities and to define, simulate, and analyze its behavior. In order to reduce a huge problem space inherent in such systems, our library is using a high level of abstraction. This is made possible by a strict and complete definition of the distributed computing environment. The library is implemented in Python whose simple and expressive syntax provides a possibility of minimal implementations and a mild learning curve. In addition to executing automated simulations or larger experiments, the library fully supports interactive mode along with a step-by-step execution, which can be a very powerful combination. [ABSTRACT FROM AUTHOR]

This paper discusses a concept for enhanced active safety by introducing a driver warning system based on vehicle dynamics that predicts a potential loss of control condition prior to stability control activation. This real-time warning algorithm builds on available technologies such as the Electronic Stability Control (ESC). The driver warning system computes several indices based on yaw rate, side-slip velocity, and vehicle understeer using ESC sensor suite. An arbitrator block arbitrates between the different indices and determines the status index of the driving vehicle. The status index is compared to predetermined stability levels which correspond to high and low stability levels. If the index exceeds the high stability level, a warning signal (haptic, acoustic, or visual) is issued to alert the driver of a potential loss of control and ESC activation. This alert will remain in effect until the index is less than the low stability level at which time the warning signal will be terminated. A vehicle speed advisory algorithm is integrated with the warning algorithm to provide a desired vehicle speed of a vehicle traveling on a curve. Simulation results and vehicle tests were conducted to illustrate the effectiveness of the warning algorithm. [ABSTRACT FROM AUTHOR]

This paper concerns the tracking control of a robot manipulator with unknown uncertainties and disturbances. It presents a new control method that uses only joint position measurements to design a tracking controller. The controller has two parts. One is based on a feedback linearization technique; itmakes the nominal model of a manipulator asymptotically track a desired trajectory. The other is based on the idea of equivalent input disturbance (EID); it compensates for uncertainties and disturbances. Together they enable a robot manipulator to precisely track the desired trajectory. The new control algorithm is applied to a two-link robot manipulator, and simulation results demonstrate the validity of this method. [ABSTRACT FROM AUTHOR]

The power system reliability is an important index to evaluate the ability of power supply. According to the characteristics of the practical grid operation, this paper trains and sets up power grid reliability predicting model, based on relevance vector machine, taking the load supplying capacity of power grid and natural calamities as input variables, and the outage time of power grid failure affecting the reliability of the power supply as output variables. In the modeling process, through principal component analysis of the training sample set of relevance vector machine, the input factor number of sample is improved, the input number of network is reduced, the network structure is simplified, and the predicting accuracy is increased. Simulation results are provided to verify the effectiveness of the proposed algorithm, which show that it provides a new way for power system reliability predicting. [ABSTRACT FROM AUTHOR]

In industrial computed tomography (CT), it is often required to inspect large objects whose size is beyond a reconstructed field of view (FOV). Somemultiscanmodes have been developed to acquire the complete CT projection data for a larger object using small panel detectors. In this paper, we give a non-concyclic dual-source circular cone-beam scanning geometry based on the idea of multiscan modes and propose a backprojection-filtration-based (BPF) reconstruction algorithm without data rebinning. Since the FOV calculated according to this nonconcyclic dual-source circular CT scanning geometry is larger than cardiac dual-source CT scanning geometry, our method can reconstruct larger horizontal slices (i.e., the slices perpendicular to rotation axis) than cardiac dual-source CT. The quality of CT images is expected to be superior to those obtained using larger panel detectors. The simulation results have indicated that CT images obtained by the proposed method are satisfying. [ABSTRACT FROM AUTHOR]

Constituting reliable optimal solution is a key issue for the nonlinear constrained model predictive control. Input-output feedback linearization is a popular method in nonlinear control. By using an input-output feedback linearizing controller, the original linear input constraints will change to nonlinear constraints and sometimes the constraints are state dependent. This paper presents an iterative quadratic program(IQP) routine on the continuous-time system. To guarantee its convergence, another iterative approach is incorporated. The proposed algorithmcan reach a feasible solution over the entire prediction horizon. Simulation results on both a numerical example and the continuous stirred tank reactors (CSTR) demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents a new control methodology based on active disturbance rejection control (ADRC) for designing the tension decoupling controller of the unwinding system in a gravure printing machine. The dynamic coupling can be actively estimated and compensated in real time, which makes feedback control an ideal approach to designing the decoupling controller of the unwinding system. This feature is unique to ADRC. In this study, a nonlinear mathematical model is established according to the working principle of the unwinding system. A decouplingmodel is also constructed to determine the order and decoupling plant of the unwinding system. Based on the order and decoupling plant, an ADRC decoupling controlmethodology is designed to enhance the tension stability in the unwinding system. The effectiveness and capability of the proposed methodology are verified through simulation and experiments. The results show that the proposed strategy not only realises a decoupling control for the unwinding system but also has an effective antidisturbance capability and is robust. [ABSTRACT FROM AUTHOR]

In the context of robotics, the grid-based Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent their surrounding area. Current approaches for incrementally constructing GVDs mainly focus on providing metric skeletons of underlying grids, while the connectivity among GVD vertices and edges remains implicit, whichmakes high-level spatial reasoning tasks impractical. In this paper, we present an algorithm named Dynamic Topology Detector (DTD) for extracting a GVD with topological information from a grid map. Beyond the construction and reconstruction of a GVD on grids, DTD further extracts connectivity among the GVD edges and vertices. DTD also provides efficient repair mechanism to treat with local changes, making it work well in dynamic environments. Simulation tests in representative scenarios demonstrate that (1) compared with the static algorithms, DTD generally makes an order of magnitude improvement regarding computation times when working in dynamic environments; (2) with negligible extra computation, DTD detects topologies not computed by existing incremental algorithms. We also demonstrate the usefulness of the resulting topological information for high-level path planning tasks. [ABSTRACT FROM AUTHOR]

Influenced by light, temperature, atmospheric pressure, and some other random factors, photovoltaic power has characteristics of volatility and intermittent. Accurately forecasting photovoltaic power can effectively improve security and stability of power grid system. The paper comprehensively analyzes influence of light intensity, day type, temperature, and season on photovoltaic power. According to the proposed scene simulation knowledge mining (SSKM) technique, the influencing factors are clustered and fused into prediction model. Combining adaptive algorithm with neural network, adaptive neural network prediction model is established. Actual numerical example verifies the effectiveness and applicability of the proposed photovoltaic power prediction model based on scene simulation knowledge mining and adaptive neural network. [ABSTRACT FROM AUTHOR]

A simulation algorithm is proposed in this paper for lightning transient analysis of the wind turbine (WT) towers. In the proposed algorithm, the tower body is first subdivided into a discrete multiconductor system. A set of formulas are given to calculate the electrical parameters of the branches in the multiconductor system. By means of the electrical parameters, each branch unit in the multiconductor system is replaced as a coupled π-type circuit and the multiconductor system is converted into a circuit model. Then, the lightning transient responses can be obtained in different parts on the tower body by solving the circuit equations of the equivalent discretization network. The laboratory measurement is also made by a reduced-scale tower for checking the validity of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In practical engineerings, structures are often excited by different kinds of loads at the same time. How to effectively analyze and simulate this kind of dynamic environment of structure, named combined dynamic environment, is one of the key issues. In this paper, a novel prediction method of combined dynamic environment is proposed from the perspective of data analysis. First, the existence of dynamic similarity between vibration responses of the same structure under different boundary conditions is theoretically proven. It is further proven that this similarity can be established by a multiple-input multiple-output regression model. Second, two machine learning algorithms, multiple-dimensional support vectormachine and extreme learningmachine, are introduced to establish thismodel. To test the effectiveness of this method, shock and stochastic white noise excitations are acted on a cylindrical shell with two clamps to simulate different dynamic environments. The prediction errors on variousmeasuring points are all less than ±3 dB, which shows that the proposed method can predict the structural vibration response under one boundary condition by means of the response under another condition in terms of precision and numerical stability. [ABSTRACT FROM AUTHOR]

We present in this paper a novel and unified control approach that combines intelligent fuzzy logic methodology with predictive method for controlling chaotic vibration of a class of uncertain chaotic systems. We first introduce prediction into each subsystem of Takagi Sugeno (T-S) fuzzy IF-THEN rules and then present a unified T-S predictive fuzzy model for chaos control. The proposed controller can successfully stabilize the chaos and track the desired targets. The simulation results illustrate its effectiveness. [ABSTRACT FROM AUTHOR]

Categorical time series are time-sequenced data in which the values at each time point are categories rather than measurements. A categorical time series is considered stationary if the marginal distribution of the data is constant over the time period for which it was gathered and the correlation between successive values is a function only of their distance from each other and not of their position in the series. However, there are many examples of categorical series which do not fit this rather strong definition of stationarity. Such data show various nonstationary behavior, such as a change in the probability of the occurrence of one or more categories. In this paper, we introduce an algorithm which corrects for nonstationarity in categorical time series. The algorithm produces serieswhich are not stationary in the traditional sense often used for stationary categorical time series. The form of stationarity is weaker but still useful for parameter estimation. Simulation results show that this simple algorithm applied to a DAR(1) model can dramatically improve the parameter estimates. [ABSTRACT FROM AUTHOR]

In this paper a combined node searching algorithm for simulation of crack discontinuities in meshless methods called combined visibility and surrounding triangles (CVT) is proposed. The element free Galerkin (EFG) method is employed for stress analysis of cracked bodies. The proposed node searching algorithm is based on the combination of surrounding triangles and visibility methods; the surrounding triangles method is used for support domains of nodes and quadrature points generated at the vicinity of crack faces and the visibility method is used for points located on the crack faces. In comparison with the conventional methods, such as the visibility, the transparency, and the diffraction method, this method is simpler with reasonable efficiency. To show the performance of this method, linear elastic fracture mechanics analyses are performed on number of standard test specimens and stress intensity factors are calculated. It is shown that the results are in good agreement with the exact solution and with those generated by the finite element method (FEM). [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) consist of a large number of low-cost miniature sensors, which can be applied to battlefield surveillance, environmental monitoring, target tracking, and other applications related to the positions of sensors. The location information of sensors is of great importance for wireless sensor networks. In this paper, we propose a new localization algorithm for the wireless sensor network based on time difference of arrival (TDOA), which is a typical algorithm in the wireless localization field. In order to improve the localization accuracy of a sensor, a new strategy is proposed for a localized sensor being upgraded to an anchor node, which is used to localize the position of the next sensor. Performance analysis and simulation results show that the revised TODA localization algorithm has the higher localization accuracy when compared with the original TDOA location method. [ABSTRACT FROM AUTHOR]

The proportional loss rate differentiation (PLD) model was proposed to provide controllable and predictable loss rate for different classes of wired network connections. However, these algorithms cannot be directly applied to wireless networks, because of the location-dependent and time-varying wireless channel capacity. This paper proposes a novel packet dropper for fuzzy controlling of the proportional loss rate differentiation in a wireless network with multistate channel. The proposed dropper, fuzzy proportional loss rate dropper (FPLR), prefers to drop the small packets destined to a poor condition channel to improve the network performance. The loss rate debts of the poor channel will be compensated later to keep PLD. From simulation results, FPLR does achieve accurate loss rate proportion, lower queuing delay and loss rate, and higher throughput, compared with other methods in the wireless environment. [ABSTRACT FROM AUTHOR]

The convergence of model-free adaptive control (MFAC) algorithm can be guaranteed when the system is subject to measurement data dropout. The system output convergent speed gets slower as dropout rate increases. This paper proposes a MFAC algorithm with data compensation. The missing data is first estimated using the dynamical linearization method, and then the estimated value is introduced to update control input. The convergence analysis of the proposed MFAC algorithm is given, and the effectiveness is also validated by simulations. It is shown that the proposed algorithm can compensate the effect of the data dropout, and the better output performance can be obtained. [ABSTRACT FROM AUTHOR]

To include user interactions in simulations of product use, the most common approach is to couple human subjects to simulation models, using hardware interfaces to close the simulation-control loop. Testing with virtual human models could offer a low-cost addition to evaluation with human subjects. This paper explores the possibilities for coupling human and artefact models to achieve fully software-based interaction simulations. We have critically reviewed existing partial solutions to simulate or execute control (both human control and product-embedded control) and compared solutions from literature with a proof-of-concept we have recently developed. Our concept closes all loops, but it does not rely on validated algorithms to predict human decision making and low-level human motor control. For low-level control, validated solutions are available from other approaches. For human decision making, however, validated algorithms exist only to predict the timing but not the reasoning behind it. To identify decision-making schemes beyond what designers can conjecture, testing with human subjects remains indispensable. [ABSTRACT FROM AUTHOR]

In order to obtain the better analysis of the multiple reentrant manufacturing systems (MRMSs), their modeling and analysis from both micro- and macroperspectives are considered. First, this paper presents the discrete event simulation models for MRMS and the corresponding algorithms are developed. In order to describe MRMS more accurately, then a modified continuum model is proposed. This continuum model takes into account the re-entrant degree of products, and its effectiveness is verified through numerical experiments. Finally, based on the discrete event simulation and the modified continuum models, a numerical example is used to analyze the MRMS. The changes in the WIP levels and outflux are also analyzed in details for multiple reentrant supply chain networks. Meanwhile, some interesting observations are discussed. [ABSTRACT FROM AUTHOR]

A trimming mean eliminates the extreme observations by removing observations from each end of the ordered sample. In this paper, we adopted the Hogg's and Brys's tail weight measures. In addition, a new algorithm was proposed as a linear estimator based on the quartile; we used a quartile to divide the data into three and four groups. Then two new estimators were proposed. These classes of linear estimators were examined via simulation method over a variety of asymmetric distributions. Sample sizes 50, 100, 150, and 200 were generated using R program. The results of 50 were tabulated, since we have similar results for the other sizes. These results were tabulated for 7 asymmetric distributions with total trimmed proportions 0.10 and 0.20 on both sides, respectively. The results for these estimators were ordered based on their relative efficiency. [ABSTRACT FROM AUTHOR]