Search results

The purpose of this paper is to investigate the existence and global exponential stability of periodic solution of memristor-based recurrent neural networks with time-varying delays and leakage delays.

The differential inequality theory and some novel mathematical analysis techniques are applied.

A set of sufficient conditions which guarantee the existence and global exponential stability of periodic solution of involved model is derived.

It plays an important role in designing the neural networks.

The obtained results of this paper are new and complement some previous studies. The innovation of this paper concludes two aspects: the analysis on the existence and global exponential stability of periodic solution of memristor-based recurrent neural networks with time-varying delays and leakage delays is first proposed; and it is first time to establish the sufficient criterion which ensures the existence and global exponential stability of periodic solution of memristor-based recurrent neural networks with time-varying delays and leakage delays.

The purpose of this paper is to investigate the time optimal trajectory of the multi-tethered robot (MTR) on a large spinning net structures in microgravity environment.

The MTR is a small space robot that uses several tethers attached to the corner-fixed satellites of a spinning net platform. The transition of the MTR from a start point to any arbitrary designated points on the platform surface can be achieved by controlling the tethers’ length and tension simultaneously. Numerical analysis of trajectory optimization problem for the MTR is implemented using the pseudospectral (PS) method.

The globally time optimal trajectory for MTR on a free-end spinning net platform can be obtained through the PS method.

The analysis in this paper is limited to a planar trajectory and the effects caused by attitude of the MTR will be neglected. To make the problem simple and to see the feasibility in the general case, in this paper, it is assumed there are no any limitations of mechanical hardware constraints such as the velocity limitation of the robot and tether length changing constraint, while only geometrical constraints are considered.

The optimal solution derived from numerical analysis can be used for a path planning, guidance and navigation control. This method can be used for more efficient on-orbit autonomous self-assembly system or extravehicular activities supports which using a tether-controlled robot.

This approach for a locomotion mechanism has the capability to solve problems of conventional crawling type robots on a loose net in microgravity.

Dynamic lot sizing is the problem of determining the quantity and timing of ordering items while satisfying the demand over a finite planning horizon. This paper considers the problem with two practical considerations: minimum order size and lost sales. The minimum order size is the minimum amount of items that should be purchased and lost sales involve situations in which sales are lost because items are not on hand or when it becomes more economical to lose the sale rather than making the sale. The objective is to minimize the costs of ordering, item , inventory holding and lost sale over the planning horizon. To solve the problem, we suggest a heuristic algorithm by considering trade-offs between cost factors. Computational experiments on randomly generated test instances show that the algorithm quickly obtains near-optimal solutions.

Based on several new concepts, this paper mathematically deduces a new model of general systems, namely, the structural model of general systems. By its mathematical analysis, the principles and laws of general systems can be mathematically achieved, which can not only help scientists achieve a better understanding and control of complex systems in nature and society but also be applied to solve particular scientific problems, and thus a problem‐oriented and mathematically expressed general systems theory, namely, the structural theory of general systems, would be achieved.

This paper aims to explore the optimization process involved in the aircraft maintenance allocation and packing problem. The aircraft industry misses a part of the optimization potential while developing maintenance plans. This research provides the modeling foundation for the missing part considering the failure behavior of components, costs involved with all maintenance tasks and opportunity costs.

The study models the cost-effectiveness of support against the availability to come up with an optimization problem. The mathematical problem was solved with an exact algorithm. Experiments were performed with real field and synthetically generated data, to validate the correctness of the model and its potential to provide more accurate and better engineered maintenance plans.

The solution procedure provided excellent results by enhancing the overall arrangement of the tasks, resulting in higher availability rates and a substantial decrease in total maintenance costs. In terms of situational awareness, it provides the user with the flexibility to better manage resource constraints while still achieving optimal results.

This is an innovative research providing a state-of-the-art mathematical model and an algorithm for efficiently solving a task allocation and packing problem by incorporating components’ due flight time, failure probability, task relationships, smart allocation of common preparation tasks, operational profile and resource limitations.

This paper aims to propose a new linear parameter varying (LPV) controller for the robot tracking control problem. Using the identification of the robot dynamics in different work space points about modeling trajectory based on the least square of error algorithm, an LPV model for the robotic arm is extracted.

Parameter set mapping based on parameter component analysis results in a reduced polytopic LPV model that reduces the complexity of the implementation. An approximation of the required torque is computed based on the reduced LPV models. The state-feedback gain of each zone is computed by solving some linear matrix inequalities (LMIs) to sufficiently decrease the time derivative of a Lyapunov function. A novel smoothing method is used for the proposed controller to switch properly in the borders of the zones.

The polytopic set of the resulting gains creates the smooth switching polytopic LPV (SS-LPV) controller which is applied to the trajectory tracking problem of the six-degree-of-freedom PUMA 560 robotic arm. A sufficient condition ensures that the proposed controller stabilizes the polytopic LPV system against the torque estimation error.

Smoothing of the switching LPV controller is performed by defining some tolerances and creating some quasi-zones in the borders of the main zones leading to the compressed main zones. The proposed torque estimation is not a model-based technique; so the model variation and other disturbances cannot destroy the performance of the suggested controller. The proposed control scheme does not have any considerable computational load, because the control gains are obtained offline by solving some LMIs, and the torque computation is done online by a simple polytopic-based equation.

In this paper, a new SS-LPV controller is addressed for the trajectory tracking problem of robotic arms. Robot workspace is zoned into some main zones in such a way that the number of models in each zone is almost equal. Data obtained from the modeling trajectory is used to design the state-feedback control gain.

Multi-view fuzzy clustering algorithms are not widely used in image segmentation, and many of these algorithms are lacking in robustness. The purpose of this paper is to investigate a new algorithm that can segment the image better and retain as much detailed information about the image as possible when segmenting noisy images.

The authors present a novel multi-view fuzzy c-means (FCM) clustering algorithm that includes an automatic view-weight learning mechanism. Firstly, this algorithm introduces a view-weight factor that can automatically adjust the weight of different views, thereby allowing each view to obtain the best possible weight. Secondly, the algorithm incorporates a weighted fuzzy factor, which serves to obtain local spatial information and local grayscale information to preserve image details as much as possible. Finally, in order to weaken the effects of noise and outliers in image segmentation, this algorithm employs the kernel distance measure instead of the Euclidean distance.

The authors added different kinds of noise to images and conducted a large number of experimental tests. The results show that the proposed algorithm performs better and is more accurate than previous multi-view fuzzy clustering algorithms in solving the problem of noisy image segmentation.

Most of the existing multi-view clustering algorithms are for multi-view datasets, and the multi-view fuzzy clustering algorithms are unable to eliminate noise points and outliers when dealing with noisy images. The algorithm proposed in this paper has stronger noise immunity and can better preserve the details of the original image.

The purpose of this study is to propose a new mathematical model that integrates strategic decision-making with tactical-operational decision-making in order to optimize production and scheduling decisions.

This study presents a multi-objective optimization framework to make production planning, scheduling and maintenance decisions. An epsilon-constraint method is used to solve small instances of the model, while new hybrid optimization algorithms, including multi-objective particle swarm optimization (MOPSO), non-dominated sorting genetic algorithm, multi-objective harmony search and improved multi-objective harmony search (IMOHS) are developed to address the high complexity of large-scale problems.

The computational results demonstrate that the metaheuristic algorithms are effective in obtaining economic solutions within a reasonable computational time. In particular, the results show that the IMOHS algorithm is able to provide optimal Pareto solutions for the proposed model compared to the other three algorithms.

This study presents a new mathematical model that simultaneously determines green production planning and scheduling decisions by minimizing the sum of the total cost, makespan, lateness and energy consumption criteria. Integrating production and scheduling of a shop floor is critical for achieving optimal operational performance in production planning. To the best of the authors' knowledge, the integration of production planning and maintenance has not been adequately addressed.

The authors explore the hypothesis that some movements in commodity prices are anticipated (news shocks) and can trigger aggregate fluctuations in small open emerging economies. This paper aims to discuss the aforementioned objective.

The authors build a multi-sector dynamic stochastic general equilibrium model with endogenous commodity production. There are five exogenous processes: a country-specific interest rate shock that responds to commodity price fluctuations, a productivity (TFP) shock for each sector and a commodity price shock. Both TFP and commodity price shocks are composed of unanticipated and anticipated components.

The authors show that news shocks to commodity prices lead to higher output, investment and consumption, and a countercyclical movement in the trade-balance-to-output ratio. The authors also show that commodity price news shocks explain about 24% of output aggregate fluctuations in the small open economy.

Given the importance of both anticipated and unanticipated commodity price shocks, policymakers should pay attention to developments in commodity markets when designing policies to attenuate the business cycles. Future research should investigate the design of optimal fiscal and monetary policies in SOE subject to news shocks in commodity prices.

This paper contributes to the knowledge of the sources of fluctuations in emerging economies highlighting the importance of a new source: news shocks in commodity prices.

This research explores mitigating carbon emissions and integrating sustainability in e-commerce logistics by optimizing the multi-depot pollution routing problem with time windows (MDPRPTW). A proposed model contrasts non-collaborative and collaborative decision-making for order assignment among logistics service providers (LSPs), incorporating low-carbon considerations.

The model is substantiated using improved adaptive large neighborhood search (IALNS), tabu search (TS) and oriented ant colony algorithm (OACA) within the context of e-commerce logistics. For model validation, a normal distribution is employed to generate random demand and inputs, derived from the location and requirements files of LSPs.

This research validates the efficacy of e-commerce logistics optimization and IALNS, TS and OACA algorithms, especially when demand follows a normal distribution. It establishes that cooperation among LSPs can substantially reduce carbon emissions and costs, emphasizing the importance of integrating sustainability in e-commerce logistics optimization.

This paper proposes a meta-heuristic algorithm to solve the NP-hard problem. Methodologies such as reinforcement learning can be investigated in future work.

This research can help logistics managers understand the status of sustainable and cost-effective logistics operations and provide a basis for optimal decision-making.

This paper describes the complexity of the MDPRPTW model, which addresses both carbon emissions and cost reduction. Detailed information about the algorithm, methodology and computational studies is investigated. The research problem encompasses various practical aspects related to routing optimization in e-commerce logistics, aiming for sustainable development.