Artificial Intelligence and Robotics Commons^™

Centroidal Voronoi Tessellation With Local Optimization, Tianyu Ye, Yiqun Wang, Dongming Yan, Junhai Yong

Journal of System Simulation

Abstract: Centroidal Voronoi tessellation is a special geometric structure, which has many applications in various fields such as geographical information system, signal processing, mesh generation/optimization, visualization and so on. Due to the highly non-convex nature of the CVT energy function, the existing methods for computing CVT have several drawbacks, which always trap into local minima. We propose generation optimization and stochastic optimization schemes for further reducing the CVT energy. Experimental results show that the proposed method improves both quality and efficiency compared to the recent approaches.

Artificial Fish Swarm And Feedback Linearization Of Flue Gas Denitration Control Based On Neural Network, Yuguang Niu, Pan Yan, Wenyuan Huang

Journal of System Simulation

Abstract: According to the present situation of SCR flue gas dentration control system in thermal power plant, an optimum proposal that control valve and concentration transmitter are added in the inlet of the SCR reactor is presented, and the corresponding control strategy is given. At the entrance of the SCR reactor, the receding horizon algorithm combined with the single neuron adaptive algorithm and the artificial fish swarm algorithm (RSNAAFS) is used to control branch valves to pretreat NO_X in the exhaust flue gas. At the outlet of the SCR reactor, the neural network based on feedback linearization algorithm (NNFL) …

Real-Time Pricing Strategy Considering The Risk Of Smart Grid, Hongbo Zhu, Gao Yan, Yeming Dai

Journal of System Simulation

Abstract: The real-time electricity price mechanism is an ideal method to adjust the power balance between supply and demand in smart grid. Its implementation has profound impacts on the users' behavior and the operation and management of electricity power grid’s safety. The users’ demand behavior plays a regulatory role in designing real-time electricity pricing strategy. Aiming at maximizing social welfare, the dynamic change of users’ aggregate demand is analyzed, which corrects the electricity risk items in online real-time risk model in the way of changing the individual user’s power fluctuations to all the users’ demand power fluctuations, and the optimization …

Optimization Of Q-Btgsid Based On Sensitivity Analysis, Shuwei Jia

Journal of System Simulation

Abstract: In order to make up for the defect that relative degree of incidence, absolute degree of incidence and synthetic degree of incidence are limited in the range of (0.5, 1], this paper attempts to improve the degree of grey incidence. A control factor of “λ” and the metric space are set up to adjust. A new model is established and its specific properties are studied. It is proved that the new model satisfies the grey incidence axioms and the range of degree of grey incidence can be extended to (0, 1]. We put forward four principles of …

Optimization Of Scheduling Rule Of Unidirectional Material Handling System With Short-Cut, Juntao Li, Kun Xia, Kise Hiroshi

Journal of System Simulation

Abstract: To decrease the interference and improve the performance of a unidirectional circulation-type material handling system on a single loop with a shortcut, the interference and scheduling problem between AGVs are studied. According to the actual situation of material handling system, the interferences of two scheduling rules (random rule and order rule) are analyzed. An optimal scheduling rule under the interference case—exchange order rule is proposed. Different scheduling rules have an influence on the interference between AGVs and then have an important effect on the efficiency of the whole system. Experiment results show that the exchange order (E-Order) rule …

Capso: A Multi-Objective Cultural Algorithm System To Predict Locations Of Ancient Sites, Samuel Dustin Stanley

Wayne State University Dissertations

ABSTRACT

CAPSO: A MULTI-OBJECTIVE CULTURAL ALGORITHM SYSTEM TO PREDICT LOCATIONS OF ANCIENT SITES

by

SAMUEL DUSTIN STANLEY

August 2019

Advisor: Dr. Robert Reynolds

Major: Computer Science

Degree: Doctor of Philosophy

The recent archaeological discovery by Dr. John O’Shea at University of Michigan of prehistoric caribou remains and Paleo-Indian structures underneath the Great Lakes has opened up an opportunity for Computer Scientists to develop dynamic systems modelling these ancient caribou routes and hunter-gatherer settlement systems as well as the prehistoric environments that they existed in. The Wayne State University Cultural Algorithm team has been interested assisting Dr. O’Shea’s archaeological team by …

Gradient Estimation For Attractor Networks, Thomas Flynn

Dissertations, Theses, and Capstone Projects

It has been hypothesized that neural network models with cyclic connectivity may be more powerful than their feed-forward counterparts. This thesis investigates this hypothesis in several ways. We study the gradient estimation and optimization procedures for several variants of these networks. We show how the convergence of the gradient estimation procedures are related to the properties of the networks. Then we consider how to tune the relative rates of gradient estimation and parameter adaptation to ensure successful optimization in these models. We also derive new gradient estimators for stochastic models. First, we port the forward sensitivity analysis method to the …

Efficient Gate System Operations For A Multipurpose Port Using Simulation Optimization, Ketki Kulkarni, Trong Khiem Tran, Hai Wang, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Port capacity is determined by three major infrastructural resources namely, berths, yards and gates. Theadvertised capacity is constrained by the least of the capacities of the three resources. While a lot ofattention has been paid to optimizing berth and yard capacities, not much attention has been given toanalyzing the gate capacity. The gates are a key node between the land-side and sea-side operations in anocean-to-cities value chain. The gate system under consideration, located at an important port in an Asiancity, is a multi-class parallel queuing system with non-homogeneous Poisson arrivals. It is hard to obtaina closed form analytic approach for …

A Selective-Discrete Particle Swarm Optimization Algorithm For Solving A Class Of Orienteering Problems, Aldy Gunawan, Vincent F. Yu, Perwira Redi, Parida Jewpanya, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This study addresses a class of NP-hard problem called the Orienteering Problem (OP), which belongs to a well-known class of vehicle routing problems. In the OP, a set of nodes that associated with a location and a score is given. The time required to travel between each pair of nodes is known in advance. The total travel time is limited by a predetermined time budget. The objective is to select a subset of nodes to be visited that maximizes the total collected score within a path. The Team OP (TOP) is an extension of OP that incorporates multiple paths. Another …

Investigating Genetic Algorithm Optimization Techniques In Video Games, Nathan Ambuehl

Undergraduate Honors Theses

Immersion is essential for player experience in video games. Artificial Intelligence serves as an agent that can generate human-like responses and intelligence to reinforce a player’s immersion into their environment. The most common strategy involved in video game AI is using decision trees to guide chosen actions. However, decision trees result in repetitive and robotic actions that reflect an unrealistic interaction. This experiment applies a genetic algorithm that explores selection, crossover, and mutation functions for genetic algorithm implementation in an isolated Super Mario Bros. pathfinding environment. An optimized pathfinding AI can be created by combining an elitist selection strategy with …

Dynamic Repositioning To Reduce Lost Demand In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Bike Sharing Systems (BSSs) are widely adopted in major cities of the world due to concerns associated with extensive private vehicle usage, namely, increased carbon emissions, traffic congestion and usage of nonrenewable resources. In a BSS, base stations are strategically placed throughout a city and each station is stocked with a pre-determined number of bikes at the beginning of the day. Customers hire the bikes from one station and return them at another station. Due to unpredictable movements of customers hiring bikes, there is either congestion (more than required) or starvation (fewer than required) of bikes at base stations. Existing …

Self-Organizing Neural Network For Adaptive Operator Selection In Evolutionary Search, Teck Hou Teng, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Evolutionary Algorithm is a well-known meta-heuristics paradigm capable of providing high-quality solutions to computationally hard problems. As with the other meta-heuristics, its performance is often attributed to appropriate design choices such as the choice of crossover operators and some other parameters. In this chapter, we propose a continuous state Markov Decision Process model to select crossover operators based on the states during evolutionary search. We propose to find the operator selection policy efficiently using a self-organizing neural network, which is trained offline using randomly selected training samples. The trained neural network is then verified on test instances not used for …

Robust Influence Maximization, Meghna Lowalekar, Pradeep Varakantham, Akshat Kumar

Research Collection School Of Computing and Information Systems

Influence Maximization is the problem of finding a fixed size set of nodes, which will maximize the expected number of influenced nodes in a social network. The number of influenced nodes is dependent on the influence strength of edges that can be very noisy. The noise in the influence strengths can be modeled using a random noise or adversarial noise model. It has been shown that all random processes that independently affect edges of the graph can be absorbed into the activation probabilities themselves and hence random noise can be captured within the independent cascade model. On the other hand, …

Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network, Hala Mostafa, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study the problem of optimizing the trajectories of agents moving over a network given their preferences over which nodes to visit subject to operational constraints on the network. In our running example, a theme park manager optimizes which attractions to include in a day-pass to maximize the pass’s appeal to visitors while keeping operational costs within budget. The first challenge in this combinatorial optimization problem is that it involves quantities (expected visit frequencies of each attraction) that cannot be expressed analytically, for which we use the Sample Average Approximation. The second challenge is that while sampling is typically done …

Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar

Research Collection School Of Computing and Information Systems

We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem. We develop the well known Expectation-Maximization (EM) algorithm for the SPR problem that maximizes the likelihood, and show that it does not get stuck in a locally optimal solution. Using the same probabilistic framework, we then address an NP-Hard network design problem where the goal is to repair a network of …

Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Spatio-temporal matching of services to customers online is a problem that arises on a large scale in many domains associated with shared transportation (ex: taxis, ride sharing, super shuttles, etc.) and delivery services (ex: food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that matching of services to customers in one round has a direct impact on the matching of services to customers in the next round. For instance, in the case of taxis, in the second round taxis can only pick up customers closer to the drop off point of the customer from the first …

Ad-Hoc Automated Teller Machine Failure Forecast And Field Service Optimization, Michelle L. F. Cheong, Ping Shung Koo, B. Chandra Babu

Research Collection School Of Computing and Information Systems

As part of its overall effort to maintain good customer service while managing operational efficiency and reducing cost, a bank in Singapore has embarked on using data and decision analytics methodologies to perform better ad-hoc ATM failure forecasting and plan the field service engineers to repair the machines. We propose using a combined Data and Decision Analytics Framework which helps the analyst to first understand the business problem by collecting, preparing and exploring data to gain business insights, before proposing what objectives and solutions can and should be done to solve the problem. This paper reports the work in analyzing …

The Impact Of Increased Optimization Problem Dimensionality On Cultural Algorithm Performance, Yang Yang

Wayne State University Theses

ABSTRACT

The Impact of Increased Optimization Problem Dimensionality on

Cultural Algorithm Performance

by

Yang Yang

August 2015

Advisor: Dr. Robert Reynolds

Major: Computer Science

Degree: Master of Science

In this thesis, we investigate the performance of Cultural Algorithms when dealing with the increasing dimensionality of optimization problems. The research is based on previous cultural algorithm approaches with the Cultural Algorithms Toolkit, CAT 2.0, which supports a variety of co-evolutionary features at both the knowledge and population levels. In this project, the system was applied to the solution of 60 randomly generated problems that ranged from 2-dimensional to 5-dimensional problem spaces. …

Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real …

Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange

Dissertations

The general adversarial agents problem is an abstract problem description touching on the fields of Artificial Intelligence, machine learning, decision theory, and game theory. The goal of the problem is, given one or more mobile agents, each identified as either “friendly" or “enemy", along with a specified environment state, to choose an action or series of actions from all possible valid choices for the next “timestep" or series thereof, in order to lead toward a specified outcome or set of outcomes. This dissertation explores approaches to this problem utilizing Artificial Immune Systems, Particle Swarm Optimization, and hybrid approaches, along with …

Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza

Research Collection School Of Computing and Information Systems

This paper proposes an orchestration model for post-disaster response that is aimed at automating the coordination of scarce resources that minimizes the loss of human lives. In our setting, different teams are treated as agents and their activities are "orchestrated" to optimize rescue performance. Results from simulation are analysed to evaluate the performance of the optimization model.

Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar

Research Collection School Of Computing and Information Systems

In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely to be slow. Alternatively if the selection pressure is set too high the system is likely to become stuck in a local optimum due to a loss of diversity in the population. The recent Fitness Uniform Selection Scheme (FUSS) is a conceptually simple but somewhat radical approach to addressing this problem - rather than biasing the selection towards higher fitness, FUSS biases selection towards sparsely populated fitness levels. In …