Design of a controller for wheeled mobile robots based on automatic movement sequencing

There are many kinds of robots and among them the wheeled mobile robots (WMR) stand out, because they are relatively cheap and easy to build. These features make WMRs the test prototypes for control strategies or motion generation. In general, the controllers developed are based on sensory schemes that give an WMR the ability to travel through flat or obstructed environments. However, these strategies are highly reactive, i.e. they are based on the control-action scheme and are not adaptive; or, they are motion schemes built from simulations that assume the environmental conditions to determine the robot's path. In both cases, WMRs do not adapt perfectly to the change of environment, since the controller does not find appropriate movements for the  robot to move from one point to another. Therefore, this article proposesapartial solution to this problem, with a controller that generates sets of adaptive movements for an WMR to travel around its environment from the sensory perception information

Forecasting Stock Exchange Data using Group Method of Data Handling Neural Network Approach

The increasing uncertainty of the natural world has motivated computer scientists to seek out the best approach to technological problems. Nature-inspired problem-solving approaches include meta-heuristic methods that are focused on evolutionary computation and swarm intelligence. One of these problems significantly impacting information is forecasting exchange index, which is a serious concern with the growth and decline of stock as there are many reports on loss of financial resources or profitability. When the exchange includes an extensive set of diverse stock, particular concepts and mechanisms for physical security, network security, encryption, and permissions should guarantee and predict its future needs. This study aimed to show it is efficient to use the group method of data handling (GMDH)-type neural networks and their application for the classification of numerical results. Such modeling serves to display the precision of GMDH-type neural networks. Following the US withdrawal from the Joint Comprehensive Plan of Action in April 2018, the behavior of the stock exchange data stream and commend algorithms has not been able to predict correctly and fit in the network satisfactorily. This paper demonstrated that Group Method Data Handling is most likely to improve inductive self-organizing approaches for addressing realistic severe problems such as the Iranian financial market crisis. A new trajectory would be used to verify the consistency of the obtained equations hence the models' validity

A hyper-heuristic based ensemble genetic programming approach for stochastic resource constrained project scheduling problem

In project scheduling studies, to the best of our knowledge, the hyper-heuristic collaborative scheduling is first-time applied to project scheduling with random activity durations. A hyper-heuristic based ensemble genetic programming (HH-EGP) method is proposed for solving stochastic resource constrained project scheduling problem (SRCPSP) by evolving an ensemble of priority rules (PRs). The proposed approach features with (1) integrating the critical path method into the resource-based policy class to generate schedules; (2) improving the existing single hyper-heuristic project scheduling research to construct a suitable solution space for solving SRCPSP; and (3) bettering genetic evolution of each subpopulation from a decision ensemble with three different local searches in corporation with discriminant mutation and discriminant population renewal. In addition, a sequence voting mechanism is designed to deal with collaborative decision-making in the scheduling process for SRCPSP. The benchmark PSPLIB is performed to verify the advantage of the HH-EGP over heuristics, meta-heuristics and the single hyper-heuristic approaches

Solving Resource Constrained Project Scheduling Problems (RCPSP) with Remanufacturing

Scheduling is one of the crucial issues in the project planning phase. Completing the project in the desired duration with the available resources with minimum cost is a big challenge for project managers. In the recent decades, several approaches have been proposed to deal with the resource constraints in scheduling. It can create a serious bottleneck and drastically change the flow of the activities. Moreover, resource constrains can change the project duration in crashing the project even if the activity (which creates the bottleneck) is not on the critical path. To address this issue, a new approach for Resource Constrained Project Scheduling (RCPS) is proposed when the remanufacturing option for some activities is available in order to crash the project. In this research, first a mathematical model for RCPS is presented. Then, a new algorithm is proposed to shorten the project duration by activating remanufacturing line (if possible) or paying the crash cost. The proposed algorithm is implemented in MATLAB and some computational experiments have been done to demonstrate the effectiveness and sensitivity of the proposed procedures. The algorithm is also validated on a practical case study which is a manufacturing industry in the northern Ontario