1,791 research outputs found
Agent-Based Computational Economics
Agent-based computational economics (ACE) is the computational study of economies modeled as evolving systems of autonomous interacting agents. Starting from initial conditions, specified by the modeler, the computational economy evolves over time as its constituent agents repeatedly interact with each other and learn from these interactions. ACE is therefore a bottom-up culture-dish approach to the study of economic systems. This study discusses the key characteristics and goals of the ACE methodology. Eight currently active research areas are highlighted for concrete illustration. Potential advantages and disadvantages of the ACE methodology are considered, along with open questions and possible directions for future research.Agent-based computational economics; Autonomous agents; Interaction networks; Learning; Evolution; Mechanism design; Computational economics; Object-oriented programming.
IK-FA, a new heuristic inverse kinematics solver using firefly algorithm
In this paper, a heuristic method based on Firefly Algorithm is proposed for inverse kinematics problems in articulated robotics. The proposal is called, IK-FA. Solving inverse kinematics, IK, consists in finding a set of joint-positions allowing a specific point of the system to achieve a target position. In IK-FA, the Fireflies positions are assumed to be a possible solution for joints elementary motions. For a robotic system with a known forward kinematic model, IK-Fireflies, is used to generate iteratively a set of joint motions, then the forward kinematic model of the system is used to compute the relative Cartesian positions of a specific end-segment, and to compare it to the needed target position. This is a heuristic approach for solving inverse kinematics without computing the inverse model. IK-FA tends to minimize the distance to a target position, the fitness function could be established as the distance between the obtained forward positions and the desired one, it is subject to minimization. In this paper IK-FA is tested over a 3 links articulated planar system, the evaluation is based on statistical analysis of the convergence and the solution quality for 100 tests. The impact of key FA parameters is also investigated with a focus on the impact of the number of fireflies, the impact of the maximum iteration number and also the impact of (a, Ăź, Âż, d) parameters. For a given set of valuable parameters, the heuristic converges to a static fitness value within a fix maximum number of iterations. IK-FA has a fair convergence time, for the tested configuration, the average was about 2.3394 Ă— 10-3 seconds with a position error fitness around 3.116 Ă— 10-8 for 100 tests. The algorithm showed also evidence of robustness over the target position, since for all conducted tests with a random target position IK-FA achieved a solution with a position error lower or equal to 5.4722 Ă— 10-9.Peer ReviewedPostprint (author's final draft
Introductory Review of Swarm Intelligence Techniques
With the rapid upliftment of technology, there has emerged a dire need to
fine-tune or optimize certain processes, software, models or structures, with
utmost accuracy and efficiency. Optimization algorithms are preferred over
other methods of optimization through experimentation or simulation, for their
generic problem-solving abilities and promising efficacy with the least human
intervention. In recent times, the inducement of natural phenomena into
algorithm design has immensely triggered the efficiency of optimization process
for even complex multi-dimensional, non-continuous, non-differentiable and
noisy problem search spaces. This chapter deals with the Swarm intelligence
(SI) based algorithms or Swarm Optimization Algorithms, which are a subset of
the greater Nature Inspired Optimization Algorithms (NIOAs). Swarm intelligence
involves the collective study of individuals and their mutual interactions
leading to intelligent behavior of the swarm. The chapter presents various
population-based SI algorithms, their fundamental structures along with their
mathematical models.Comment: Submitted to Springe
Individuality and the collective in AI agents: Explorations of shared consciousness and digital homunculi in the metaverse for cultural heritage
The confluence of extended reality (XR) technologies, including augmented and virtual reality, with large language models (LLM) marks a significant advancement in the field of digital humanities, opening uncharted avenues for the representation of cultural heritage within the burgeoning metaverse. This paper undertakes an examination of the potentialities and intricacies of such a convergence, focusing particularly on the creation of digital homunculi or changelings. These virtual beings, remarkable for their sentience and individuality, are also part of a collective consciousness, a notion explored through a thematic comparison in science fiction with the Borg and the Changelings in the Star Trek universe. Such a comparison offers a metaphorical framework for discussing complex phenomena such as shared consciousness and individuality, illuminating their bearing on perceptions of self and awareness. Further, the paper considers the ethical implications of these concepts, including potential loss of individuality and the challenges inherent to accurate representation of historical figures and cultures. The latter necessitates collaboration with cultural experts, underscoring the intersectionality of technological innovation and cultural sensitivity. Ultimately, this chapter contributes to a deeper understanding of the technical aspects of integrating large language models with immersive technologies and situates these developments within a nuanced cultural and ethical discourse. By offering a comprehensive overview and proposing clear recommendations, the paper lays the groundwork for future research and development in the application of these technologies within the unique context of cultural heritage representation in the metaverse
Piecewise Linear Homeomorphisms: The Scalar Case
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is invertible in closed form. In this paper we introduce the graph intersection (GI) algorithm for learning piecewise linear scalar functions in two settings: approximation, where an oracle outputs accurate functional values in response to input queries; and estimation, where only a fixed discrete data base of input-output pairs is available. We provide a local convergence result for the approximation version of the GI algorithm as well as a study of its numerical performance in the estimation setting. We conclude that PLH offers accuracy closed to that of a neural net while requiring, via our GI algorithm, far shorter training time and preserving desired invariant properties unlike any other presently popular basis family
Assembly sequence planning using hybrid binary particle swarm optimization
Assembly Sequence Planning (ASP) is known as a large-scale, timeconsuming combinatorial problem. Therefore time is the main factor in production planning. Recently, ASP in production planning had been studied widely especially to minimize the time and consequently reduce the cost. The first objective of this research is to formulate and analyse a mathematical model of the ASP problem. The second objective is to minimize the time of the ASP problem and hence reduce the product cost. A case study of a product consists of 19 components have been used in this research, and the fitness function of the problem had been calculated using Binary Particle Swarm Optimization (BPSO), and hybrid algorithm of BPSO and Differential Evolution (DE). The novel algorithm of BPSODE has been assessed with performance-evaluated criteria (performance measure). The algorithm has been validated using 8 comprehensive benchmark problems from the literature. The results show that the BPSO algorithm has an improved performance and can reduce further the time of assembly of the 19 parts of the ASP compared to the Simulated Annealing and Genetic Algorithm. The novel hybrid BPSODE algorithm shows a superior performance when assessed via performance-evaluated criteria compared to BPSO. The BPSODE algorithm also demonstrated a good generation of the recorded optimal value for the 8 standard benchmark problems
Enhancing feature selection with a novel hybrid approach incorporating genetic algorithms and swarm intelligence techniques
Computing advances in data storage are leading to rapid growth in large-scale datasets. Using all features increases temporal/spatial complexity and negatively influences performance. Feature selection is a fundamental stage in data preprocessing, removing redundant and irrelevant features to minimize the number of features and enhance the performance of classification accuracy. Numerous optimization algorithms were employed to handle feature selection (FS) problems, and they outperform conventional FS techniques. However, there is no metaheuristic FS method that outperforms other optimization algorithms in many datasets. This motivated our study to incorporate the advantages of various optimization techniques to obtain a powerful technique that outperforms other methods in many datasets from different domains. In this article, a novel combined method GASI is developed using swarm intelligence (SI) based feature selection techniques and genetic algorithms (GA) that uses a multi-objective fitness function to seek the optimal subset of features. To assess the performance of the proposed approach, seven datasets have been collected from the UCI repository and exploited to test the newly established feature selection technique. The experimental results demonstrate that the suggested method GASI outperforms many powerful SI-based feature selection techniques studied. GASI obtains a better average fitness value and improves classification performance
- …