45,013 research outputs found

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    Get PDF
    This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. The knowledge acquired by the process is interpreted and mapped into vectors, which are kept in the database and used by the system to guide its reasoning process. Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. The main motivation for this research is to introduce and evaluate an advance new customized GA. Comparison results of different combinatorial operators, and tests with different probability factors are shown. Also, proposed are the new modifications to existing genetic operator called DPPC (Dynamic Pre-Populated Crossover) together with modification of a simple method of representation, called MLR (Multi-Layered Representation). In addition, the performance of the new operators called GA_INSP (GA Inspection Module), DTC (Dynamic Tuning Crossover), and BCS (Bi-Cycle Selection Method) for a better evolutionary approach to the time-based problem has been discussed in the thesis. The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. Besides that, the implementation of the new genetic operators helps to converge faster and produce better results. The representation approach has been implemented via a computer program in order to achieve optimized scanning performance. This algorithm has been tested and implemented successfully via a dual beam optical scanning system

    Multi-criteria Evolution of Neural Network Topologies: Balancing Experience and Performance in Autonomous Systems

    Full text link
    Majority of Artificial Neural Network (ANN) implementations in autonomous systems use a fixed/user-prescribed network topology, leading to sub-optimal performance and low portability. The existing neuro-evolution of augmenting topology or NEAT paradigm offers a powerful alternative by allowing the network topology and the connection weights to be simultaneously optimized through an evolutionary process. However, most NEAT implementations allow the consideration of only a single objective. There also persists the question of how to tractably introduce topological diversification that mitigates overfitting to training scenarios. To address these gaps, this paper develops a multi-objective neuro-evolution algorithm. While adopting the basic elements of NEAT, important modifications are made to the selection, speciation, and mutation processes. With the backdrop of small-robot path-planning applications, an experience-gain criterion is derived to encapsulate the amount of diverse local environment encountered by the system. This criterion facilitates the evolution of genes that support exploration, thereby seeking to generalize from a smaller set of mission scenarios than possible with performance maximization alone. The effectiveness of the single-objective (optimizing performance) and the multi-objective (optimizing performance and experience-gain) neuro-evolution approaches are evaluated on two different small-robot cases, with ANNs obtained by the multi-objective optimization observed to provide superior performance in unseen scenarios

    Adaptive neuro-fuzzy technique for autonomous ground vehicle navigation

    Get PDF
    This article proposes an adaptive neuro-fuzzy inference system (ANFIS) for solving navigation problems of an autonomous ground vehicle (AGV). The system consists of four ANFIS controllers; two of which are used for regulating both the left and right angular velocities of the AGV in order to reach the target position; and other two ANFIS controllers are used for optimal heading adjustment in order to avoid obstacles. The two velocity controllers receive three sensor inputs: front distance (FD); right distance (RD) and left distance (LD) for the low-level motion control. Two heading controllers deploy the angle difference (AD) between the heading of AGV and the angle to the target to choose the optimal direction. The simulation experiments have been carried out under two different scenarios to investigate the feasibility of the proposed ANFIS technique. The simulation results have been presented using MATLAB software package; showing that ANFIS is capable of performing the navigation and path planning task safely and efficiently in a workspace populated with static obstacles

    Learning to solve planning problems efficiently by means of genetic programming

    Get PDF
    Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In this article, we propose to evolve only the heuristics to make a particular planner more efficient. This approach is more feasible than (b) because it does not have to build a planner from scratch but can take advantage of already existing planning systems. It is also more efficient than (a) because once the heuristics have been evolved, they can be used to solve a whole class of different planning problems in a planning domain, instead of running GP for every new planning problem. Empirical results show that our approach (EVOCK) is able to evolve heuristics in two planning domains (the blocks world and the logistics domain) that improve PRODIGY4.0 performance. Additionally, we experiment with a new genetic operator - Instance-Based Crossover - that is able to use traces of the base planner as raw genetic material to be injected into the evolving population.Publicad
    corecore