568 research outputs found

    A Comparative Analysis of OLSR Routing Protocol based on PSO and Cuckoo Search Optimization (CSO) in Manets

    Get PDF
    New developments in wireless communication have enabled the use of highly efficient and inexpensive wireless receivers in a variety of portable applications. Each node in a mobile network is a mobile device that independently organizes its own connection to the others and manages its own data transmissions. The adaptability, scalability, and cost reduction of mobile networks have attracted considerable attention. Because mobile networks are constantly changing, problems with routing and power usage are common. High error rates, energy limitations, and inadequate bandwidth are just a few of the issues plaguing mobile ad hoc networks. The relevance of routing protocols in dynamic multi-hop networks like Mobile Ad hoc Networks (MANET) has drawn the attention of many scholars. In this paper, we focus on  implementing an OLSR(Optimised Link State  Routing) protocol and evaluates its performance using two optmisation algorithm: Particle Swarm Optimization(OLSR) and Cuckoo Search Optimization (CSO). The simulation result suggests that PSO is superior to both CSO and the conventional OLSR routing technique. We implemented using NS-2 simulator for simulation and NAM for network animation

    IK-FA, a new heuristic inverse kinematics solver using firefly algorithm

    Get PDF
    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

    Multiple robot co-ordination using particle swarm optimisation and bacteria foraging algorithm

    Get PDF
    The use of multiple robots to accomplish a task is certainly preferable over the use of specialised individual robots. A major problem with individual specialized robots is the idle-time, which can be reduced by the use of multiple general robots, therefore making the process economical. In case of infrequent tasks, unlike the ones like assembly line, the use of dedicated robots is not cost-effective. In such cases, multiple robots become essential. This work involves path-planning and co-ordination between multiple mobile agents in a static-obstacle environment. Multiple small robots (swarms) can work together to accomplish the designated tasks that are difficult or impossible for a single robot to accomplish. Here Particle Swarm Optimization (PSO) and Bacteria Foraging Algorithm (BFA) have been used for coordination and path-planning of the robots. PSO is used for global path planning of all the robotic agents in the workspace. The calculated paths of the robots are further optimized using a localised BFA optimization technique. The problem considered in this project is coordination of multiple mobile agents in a predefined environment using multiple small mobile robots. This work demonstrates the use of a combinatorial PSO algorithm with a novel local search enhanced by the use of BFA to help in efficient path planning limiting the chances of PSO getting trapped in the local optima. The approach has been simulated on a graphical interface

    Inferring Human Pose and Motion from Images

    No full text
    As optical gesture recognition technology advances, touchless human computer interfaces of the future will soon become a reality. One particular technology, markerless motion capture, has gained a large amount of attention, with widespread application in diverse disciplines, including medical science, sports analysis, advanced user interfaces, and virtual arts. However, the complexity of human anatomy makes markerless motion capture a non-trivial problem: I) parameterised pose configuration exhibits high dimensionality, and II) there is considerable ambiguity in surjective inverse mapping from observation to pose configuration spaces with a limited number of camera views. These factors together lead to multimodality in high dimensional space, making markerless motion capture an ill-posed problem. This study challenges these difficulties by introducing a new framework. It begins with automatically modelling specific subject template models and calibrating posture at the initial stage. Subsequent tracking is accomplished by embedding naturally-inspired global optimisation into the sequential Bayesian filtering framework. Tracking is enhanced by several robust evaluation improvements. Sparsity of images is managed by compressive evaluation, further accelerating computational efficiency in high dimensional space

    Agent-based modeling for environmental management. Case study: virus dynamics affecting Norwegian fish farming in fjords

    Get PDF
    Background: Norwegian fish-farming industry is an important industry, rapidly growing, and facing significant challenges such as the spread of pathogens1, trade-off between locations, fish production and health. There is a need for research, i.e. the development of theories (models), methods, techniques and tools for analysis, prediction and management, i.e. strategy development, policy design and decision making, to facilitate a sustainable industry. Loss due to the disease outbreaks in the aquaculture systems pose a large risk to a sustainable fish industry system, and pose a risk to the coastal and fjord ecosystem systems as a whole. Norwegian marine aquaculture systems are located in open areas (i.e. fjords) where they overlap and interact with other systems (e.g. transport, wild life, tourist, etc.). For instance, shedding viruses from aquaculture sites affect the wild fish in the whole fjord system. Fish disease spread and pathogen transmission in such complex systems, is process that it is difficult to predict, analyze, and control. There are several time-variant factors such as fish density, environmental conditions and other biological factors that affect the spread process. In this thesis, we developed methods to examine these factors on fish disease spread in fish populations and on pathogen spread in the time-space domain. Then we develop methods to control and manage the aquaculture system by finding optimal system settings in order to have a minimum infection risk and a high production capacity. Aim: The overall objective of the thesis is to develop agent-based models, methods and tools to facilitate the management of aquaculture production in Norwegian fjords by predicting the pathogen dynamics, distribution, and transmission in marine aquaculture systems. Specifically, the objectives are to assess agent-based modeling as an approach to understanding fish disease spread processes, to develop agent-based models that help us predict, analyze and understand disease dynamics in the context of various scenarios, and to develop a framework to optimize the location and the load of the aquaculture systems so as to minimize the infection risk in a growing fish industry. Methods: We use agent-based method to build models to simulate disease dynamics in fish populations and to simulate pathogen transmission between several aquaculture sites in a Norwegian fjord. Also, we use particle swarm optimization algorithm to identify agent-based models’ parameters so as to optimize the dynamics of the system model. In this context, we present a framework for using a particle swarm optimization algorithm to identify the parameter values of the agent-based model of aquaculture system that are expected to yield the optimal fish densities and farm locations that avoid the risk of spreading disease. The use of particle swarm optimization algorithm helps in identifying optimal agent-based models’ input parameters depending on the feedback from the agentbased models’ outputs. Results: As the thesis is built on three main studies, the results of the thesis work can be divided into three components. In the first study, we developed many agent-based models to simulate fish disease spread in stand-alone fish populations. We test the models in different scenarios by varying the agents (i.e. fish and pathogens) parameters, environment parameters (i.e. seawater temperature and currents), and interactions (interaction between agents-agents, and agents-environment) parameters. We use sensitivity analysis method to test different key input parameters such as fish density, fish swimming behavior, seawater temperature, and sea currents to show their effects on the disease spread process. Exploring the sensitivity of fish disease dynamics to these key parameters helps in combatting fish disease spread. In the second study, we build infection risk maps in a space-time domain, by developing agent-based models to identify the pathogen transmission patterns. The agent-based method helps us advance our understanding of pathogen transmission and builds risk maps to help us reduce the spread of infectious fish diseases. By using this method, we may study the spatial and dynamic aspects of the spread of infections and address the stochastic nature of the infection process. In the third study, we developed a framework for the optimization of the aquaculture systems. The framework uses particle swarm optimization algorithm to optimize agent-based models’ parameters so as to optimize the objective function. The framework was tested by developing a model to find optimal fish densities and farm locations in marine aquaculture system in a Norwegian fjord. Results show so that the rapid convergence of the presented particle swarm optimization algorithm to the optimal solution, - the algorithm requires a maximum of 18 iterations to find the best solution which can increase the fish density to three times while keeping the risk of infection at an accepted level. Conclusion: There are many contributions of this research work. First, we assessed the agent-based modeling as a method to simulate and analyze fish disease spread dynamics as a foundation for managing aquaculture systems. Results from this study demonstrate how effective the use of agentbased method is in the simulation of infectious diseases. By using this method, we are able to study spatial aspects of the spread of fish diseases and address the stochastic nature of infections process. Agent-based models are flexible, and they can include many external factors that affect fish disease dynamics such as interactions with wild fish and ship traffic. Agent-based models successfully help us to overcome the problem associated with lack of data in fish disease transmission and contribute to our understanding of different cause-effects relationships in the dynamics of fish diseases. Secondly, we developed methods to build infection risk maps in a space-time domain conditioned upon the identification of the pathogen transmission patterns in such a space-time domain, so as to help prevent and, if needed, combat infectious fish diseases by informing the management of the fish industry in Norway. Finally, we developed a method by which we may optimize the fish densities and farm locations of aquaculture systems so as to ensure a sustainable fish industry with a minimum risk of infection and a high production capacity. This PhD study offers new research-based approaches, models and tools for analysis, predictions and management that can be used to facilitate a sustainable development of the marine aquaculture industry with a maximal economic outcome and a minimal environmental impact

    An Adjectival Interface for procedural content generation

    Get PDF
    Includes abstract.Includes bibliographical references.In this thesis, a new interface for the generation of procedural content is proposed, in which the user describes the content that they wish to create by using adjectives. Procedural models are typically controlled by complex parameters and often require expert technical knowledge. Since people communicate with each other using language, an adjectival interface to the creation of procedural content is a natural step towards addressing the needs of non-technical and non-expert users. The key problem addressed is that of establishing a mapping between adjectival descriptors, and the parameters employed by procedural models. We show how this can be represented as a mapping between two multi-dimensional spaces, adjective space and parameter space, and approximate the mapping by applying novel function approximation techniques to points of correspondence between the two spaces. These corresponding point pairs are established through a training phase, in which random procedural content is generated and then described, allowing one to map from parameter space to adjective space. Since we ultimately seek a means of mapping from adjective space to parameter space, particle swarm optimisation is employed to select a point in parameter space that best matches any given point in adjective space. The overall result, is a system in which the user can specify adjectives that are then used to create appropriate procedural content, by mapping the adjectives to a suitable set of procedural parameters and employing the standard procedural technique using those parameters as inputs. In this way, none of the control offered by procedural modelling is sacrificed â although the adjectival interface is simpler, it can at any point be stripped away to reveal the standard procedural model and give users access to the full set of procedural parameters. As such, the adjectival interface can be used for rapid prototyping to create an approximation of the content desired, after which the procedural parameters can be used to fine-tune the result. The adjectival interface also serves as a means of intermediate bridging, affording users a more comfortable interface until they are fully conversant with the technicalities of the underlying procedural parameters. Finally, the adjectival interface is compared and contrasted to an interface that allows for direct specification of the procedural parameters. Through user experiments, it is found that the adjectival interface presented in this thesis is not only easier to use and understand, but also that it produces content which more accurately reflects usersâ intentions

    Interactive Virtual Cinematography

    Get PDF
    corecore