22 research outputs found
Genetic network programming with reinforcement learning and optimal search component : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Sciences at Massey University, Auckland, New Zealand
This thesis presents ways of improving the genetic composition, structure and learning
strategies for a graph-based evolutionary algorithm, called Genetic Networking Programming
with Reinforcement Learning (GNP-RL), particularly when working with multi-agent and
dynamic environments. GNP-RL is an improvement over Genetic Programming, allowing for
the concise representation of solutions in terms of a networked graph structure and uses RL to
further refine the graph solutions. This work has improved GNP-RL by combining three new
techniques: Firstly, it has added a reward and punishment scheme as part of its learning strategy
that supports constraint conformance, allowing for a more adaptive training of the agent, so
that it can learn how to avoid unwanted situations more effectively. Secondly, an optimal
search algorithm has been combined in the GNP-RL core to get an accurate analysis of the
exploratory environment. Thirdly, a task prioritization technique has been added to the agent’s
learning by giving promotional rewards, so they are trained on how to take priority into account
when performing tasks. In this thesis, we applied the improved algorithm to the Tile World
benchmarking testbed, which is considered as one of the standard complex problems in this
domain, having only a sparse training set. Our experiment results show that the proposed
algorithm is superior than the best existing variant of the GNP-RL algorithm [1]. We have
achieved 86.66% test accuracy on the standard benchmarking dataset [2]. In addition, we have
created another benchmarking dataset, similar in complexity to the one proposed in [1], to test
the proposed algorithms further, where it achieved a test accuracy of 96.66%; that is 33.66%
more accurate
Monte Carlo Method with Heuristic Adjustment for Irregularly Shaped Food Product Volume Measurement
Volume measurement plays an important role in the production and processing of food products. Various methods have been
proposed to measure the volume of food products with irregular shapes based on 3D reconstruction. However, 3D reconstruction
comes with a high-priced computational cost. Furthermore, some of the volume measurement methods based on 3D reconstruction
have a low accuracy. Another method for measuring volume of objects uses Monte Carlo method. Monte Carlo method performs
volume measurements using random points. Monte Carlo method only requires information regarding whether random points
fall inside or outside an object and does not require a 3D reconstruction. This paper proposes volume measurement using a
computer vision system for irregularly shaped food products without 3D reconstruction based on Monte Carlo method with
heuristic adjustment. Five images of food product were captured using five cameras and processed to produce binary images.
Monte Carlo integration with heuristic adjustment was performed to measure the volume based on the information extracted from
binary images. The experimental results show that the proposed method provided high accuracy and precision compared to the
water displacement method. In addition, the proposed method is more accurate and faster than the space carving method
Towards representing human behavior and decision making in Earth system models. An overview of techniques and approaches
Today, humans have a critical impact on the Earth system and vice versa, which can generate complex feedback processes between social and ecological dynamics. Integrating human behavior into formal Earth system models (ESMs), however, requires crucial modeling assumptions about actors and their goals, behavioral options, and decision rules, as well as modeling decisions regarding human social interactions and the aggregation of individuals’ behavior. Here, we review existing modeling approaches and techniques from various disciplines and schools of thought dealing with human behavior at different levels of decision making. We demonstrate modelers’ often vast degrees of freedom but also seek to make modelers aware of the often crucial consequences of seemingly innocent modeling assumptions. After discussing which socioeconomic units are potentially important for ESMs, we compare models of individual decision making that correspond to alternative behavioral theories and that make diverse modeling assumptions about individuals’ preferences, beliefs, decision rules, and foresight. We review approaches to model social interaction, covering game theoretic frameworks, models of social influence, and network models. Finally, we discuss approaches to studying how the behavior of individuals, groups, and organizations can aggregate to complex collective phenomena, discussing agent-based, statistical, and representative-agent modeling and economic macro-dynamics. We illustrate the main ingredients of modeling techniques with examples from land-use dynamics as one of the main drivers of environmental change bridging local to global scales
Intelligence artificielle et optimisation avec parallélisme
This document is devoted to artificial intelligence and optimization. This part will bedevoted to having fun with high level ideas and to introduce the subject. Thereafter,Part II will be devoted to Monte-Carlo Tree Search, a recent great tool for sequentialdecision making; we will only briefly discuss other tools for sequential decision making;the complexity of sequential decision making will be reviewed. Then, part IIIwill discuss optimization, with a particular focus on robust optimization and especiallyevolutionary optimization. Part IV will present some machine learning tools, useful ineveryday life, such as supervised learning and active learning. A conclusion (part V)will come back to fun and to high level ideas.On parlera ici de Monte-Carlo Tree Search, d'UCT, d'algorithmes évolutionnaires et d'autres trucs et astuces d'IA;l'accent sera mis sur la parallélisation
Task Allocation in Foraging Robot Swarms:The Role of Information Sharing
Autonomous task allocation is a desirable feature of robot swarms that collect and deliver items in scenarios where congestion, caused by accumulated items or robots, can temporarily interfere with swarm behaviour. In such settings, self-regulation of workforce can prevent unnecessary energy consumption. We explore two types of self-regulation: non-social, where robots become idle upon experiencing congestion, and social, where robots broadcast information about congestion to their team mates in order to socially inhibit foraging. We show that while both types of self-regulation can lead to improved energy efficiency and increase the amount of resource collected, the speed with which information about congestion flows through a swarm affects the scalability of these algorithms