Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

GUARDIANS final report

Emergencies in industrial warehouses are a major concern for firefghters. The large dimensions together with the development of dense smoke that drastically reduces visibility, represent major challenges. The Guardians robot swarm is designed to assist fire fighters in searching a large warehouse. In this report we discuss the technology developed for a swarm of robots searching and assisting fire fighters. We explain the swarming algorithms which provide the functionality by which the robots react to and follow humans while no communication is required. Next we discuss the wireless communication system, which is a so-called mobile ad-hoc network. The communication network provides also one of the means to locate the robots and humans. Thus the robot swarm is able to locate itself and provide guidance information to the humans. Together with the re ghters we explored how the robot swarm should feed information back to the human fire fighter. We have designed and experimented with interfaces for presenting swarm based information to human beings

A Systematic Literature Review of Path-Planning Strategies for Robot Navigation in Unknown Environment

The Many industries, including ports, space, surveillance, military, medicine and agriculture have benefited greatly from mobile robot technology.  An autonomous mobile robot navigates in situations that are both static and dynamic. As a result, robotics experts have proposed a range of strategies. Perception, localization, path planning, and motion control are all required for mobile robot navigation. However, Path planning is a critical component of a quick and secure navigation. Over the previous few decades, many path-planning algorithms have been developed. Despite the fact that the majority of mobile robot applications take place in static environments, there is a scarcity of algorithms capable of guiding robots in dynamic contexts. This review compares qualitatively mobile robot path-planning systems capable of navigating robots in static and dynamic situations. Artificial potential fields, fuzzy logic, genetic algorithms, neural networks, particle swarm optimization, artificial bee colonies, bacterial foraging optimization, and ant-colony are all discussed in the paper. Each method's application domain, navigation technique and validation context are discussed and commonly utilized cutting-edge methods are analyzed. This research will help researchers choose appropriate path-planning approaches for various applications including robotic cranes at the sea ports as well as discover gaps for optimization

An emergent wall following behaviour to escape local minima for swarms of agents

Natural examples of emergent behaviour, in groups due to interactions among the group's individuals, are numerous. Our aim, in this paper, is to use complex emergent behaviour among agents that interact via pair-wise attractive and repulsive potentials, to solve the local minima problem in the artificial potential based navigation method. We present a modified potential field based path planning algorithm, which uses agent internal states and swarm emergent behaviour to enhance group performance. The algorithm is used successfully to solve a reactive path-planning problem that cannot be solved using conventional static potential fields due to local minima formation. Simulation results demonstrate the ability of a swarm of agents to perform problem solving using the dynamic internal states of the agents along with emergent behaviour of the entire group

A Nature inspired guidance system for unmanned autonomous vehicles employed in a search role.

Since the very earliest days of the human race, people have been studying animal behaviours. In those early times, being able to predict animal behaviour gave hunters the advantages required for success. Then, as societies began to develop this gave way, to an extent, to agriculture and early studies, much of it trial and error, enabled farmers to successfully breed and raise livestock to feed an ever growing population. Following the advent of scientific endeavour, more rigorous academic research has taken human understanding of the natural world to much greater depth. In recent years, some of this understanding has been applied to the field of computing, creating the more specialised field of natural computing. In this arena, a considerable amount of research has been undertaken to exploit the analogy between, say, searching a given problem space for an optimal solution and the natural process of foraging for food. Such analogies have led to useful solutions in areas such as numerical optimisation and communication network management, prominent examples being ant colony systems and particle swarm optimisation; however, these solutions often rely on well-defined fitness landscapes that may not always be available. One practical application of natural computing may be to create behaviours for the control of autonomous vehicles that would utilise the findings of ethological research, identifying the natural world behaviours that have evolved over millennia to surmount many of the problems that autonomous vehicles find difficult; for example, long range underwater navigation or obstacle avoidance in fast moving environments. This thesis provides an exploratory investigation into the use of natural search strategies for improving the performance of autonomous vehicles operating in a search role. It begins with a survey of related work, including recent developments in autonomous vehicles and a ground breaking study of behaviours observed within the natural world that highlights general cooperative group behaviours, search strategies and communication methods that might be useful within a wider computing context beyond optimisation, where the information may be sparse but new paradigms could be developed that capitalise on research into biological systems that have developed over millennia within the natural world. Following this, using a 2-dimensional model, novel research is reported that explores whether autonomous vehicle search can be enhanced by applying natural search behaviours for a variety of search targets. Having identified useful search behaviours for detecting targets, it then considers scenarios where detection is lost and whether natural strategies for re-detection can improve overall systemic performance in search applications. Analysis of empirical results indicate that search strategies exploiting behaviours found in nature can improve performance over random search and commonly applied systematic searches, such as grids and spirals, across a variety of relative target speeds, from static targets to twice the speed of the searching vehicles, and against various target movement types such as deterministic movement, random walks and other nature inspired movement. It was found that strategies were most successful under similar target-vehicle relationships as were identified in nature. Experiments with target occlusion also reveal that natural reacquisition strategies could improve the probability oftarget redetection

Obstacle Avoidance Scheme Based Elite Opposition Bat Algorithm for Unmanned Ground Vehicles

Unmanned Ground Vehicles (UGVs) are intelligent vehicles that operate in an obstacle environment without an onboard human operator but can be controlled autonomously using an obstacle avoidance system or by a human operator from a remote location. In this research, an obstacle avoidance scheme-based elite opposition bat algorithm (EOBA) for UGVs was developed. The obstacle avoidance system comprises a simulation map, a perception system for obstacle detection, and the implementation of EOBA for generating an optimal collision-free path that led the UGV to the goal location. Three distance thresholds of 0.1 m, 0.2 m, and 0.3 m was used in the obstacle detection stage to determine the optimal distance threshold for obstacle avoidance. The performance of the obstacle avoidance scheme was compared with that of bat algorithm (BA) and particle swarm optimization (PSO) techniques. The simulation results show that the distance threshold of 0.3 m is the optimal threshold for obstacle avoidance provided that the size of the obstacle does not exceed the size of the UGV. The EOBA based scheme when compared with BA and PSO schemes obtained an average percentage reduction of 21.82% in terms of path length and 60% in terms of time taken to reach the target destination. The uniqueness of this approach is that the UGV avoid collision with an obstacle at a distance of 0.3 m from nearby obstacles as against taking three steps backward before avoiding obstacl

Past, present and future of path-planning algorithms for mobile robot navigation in dynamic environments

Mobile robots have been making a significant contribution to the advancement of many sectors including automation of mining, space, surveillance, military, health, agriculture and many more. Safe and efficient navigation is a fundamental requirement of mobile robots, thus, the demand for advanced algorithms rapidly increased. Mobile robot navigation encompasses the following four requirements: perception, localization, path-planning and motion control. Among those, path-planning is a vital part of a fast, secure operation. During the last couple of decades, many path-planning algorithms were developed. Despite most of the mobile robot applications being in dynamic environments, the number of algorithms capable of navigating robots in dynamic environments is limited. This paper presents a qualitative comparative study of the up-to-date mobile robot path-planning methods capable of navigating robots in dynamic environments. The paper discusses both classical and heuristic methods including artificial potential field, genetic algorithm, fuzzy logic, neural networks, artificial bee colony, particle swarm optimization, bacterial foraging optimization, ant-colony and Agoraphilic algorithm. The general advantages and disadvantages of each method are discussed. Furthermore, the commonly used state-of-the-art methods are critically analyzed based on six performance criteria: algorithm's ability to navigate in dynamically cluttered areas, moving goal hunting ability, object tracking ability, object path prediction ability, incorporating the obstacle velocity in the decision, validation by simulation and experimentation. This investigation benefits researchers in choosing suitable path-planning methods for different applications as well as identifying gaps in this field. © 2020 IEEE

COORDINATION OF LEADER-FOLLOWER MULTI-AGENT SYSTEM WITH TIME-VARYING OBJECTIVE FUNCTION

This thesis aims to introduce a new framework for the distributed control of multi-agent systems with adjustable swarm control objectives. Our goal is twofold: 1) to provide an overview to how time-varying objectives in the control of autonomous systems may be applied to the distributed control of multi-agent systems with variable autonomy level, and 2) to introduce a framework to incorporate the proposed concept to fundamental swarm behaviors such as aggregation and leader tracking. Leader-follower multi-agent systems are considered in this study, and a general form of time-dependent artificial potential function is proposed to describe the varying objectives of the system in the case of complete information exchange. Using Lyapunov methods, the stability and boundedness of the agents\u27 trajectories under single order and higher order dynamics are analyzed. Illustrative numerical simulations are presented to demonstrate the validity of our results. Then, we extend these results for multi-agent systems with limited information exchange and switching communication topology. The first steps of the realization of an experimental framework have been made with the ultimate goal of verifying the simulation results in practice