Emerging robot swarm traffic

We discuss traffic patterns generated by swarms of robots while commuting to and from a base station. The overall question is whether to explicitly organise the traffic or whether a certain regularity develops `naturally'. Human driven motorized traffic is rigidly structured in two lanes. However, army ants develop a three-lane pattern in their traffic, while human pedestrians generate a main trail and secondary trials in either direction. Our robot swarm approach is bottom-up: designing individual agents we first investigate the mathematics of cases occurring when applying the artificial potential field method to three 'perfect' robots. We show that traffic lane pattern will not be disturbed by the internal system of forces. Next, we define models of sensor designs to account for the practical fact that robots (and ants) have limited visibility and compare the sensor models in groups of three robots. In the final step we define layouts of a highway: an unbounded open space, a trail with surpassable edges and a hard defined (walled) highway. Having defined the preliminaries we run swarm simulations and look for emerging traffic patterns. Apparently, depending on the initial situation a variety of lane patterns occurs, however, high traffic densities do delay the emergence of traffic lanes considerably. Overall we conclude that regularities do emerge naturally and can be turned into an advantage to obtain efficient robot traffic

Individual rules for trail pattern formation in Argentine ants (Linepithema humile)

We studied the formation of trail patterns by Argentine ants exploring an empty arena. Using a novel imaging and analysis technique we estimated pheromone concentrations at all spatial positions in the experimental arena and at different times. Then we derived the response function of individual ants to pheromone concentrations by looking at correlations between concentrations and changes in speed or direction of the ants. Ants were found to turn in response to local pheromone concentrations, while their speed was largely unaffected by these concentrations. Ants did not integrate pheromone concentrations over time, with the concentration of pheromone in a 1 cm radius in front of the ant determining the turning angle. The response to pheromone was found to follow a Weber's Law, such that the difference between quantities of pheromone on the two sides of the ant divided by their sum determines the magnitude of the turning angle. This proportional response is in apparent contradiction with the well-established non-linear choice function used in the literature to model the results of binary bridge experiments in ant colonies (Deneubourg et al. 1990). However, agent based simulations implementing the Weber's Law response function led to the formation of trails and reproduced results reported in the literature. We show analytically that a sigmoidal response, analogous to that in the classical Deneubourg model for collective decision making, can be derived from the individual Weber-type response to pheromone concentrations that we have established in our experiments when directional noise around the preferred direction of movement of the ants is assumed.Comment: final version, 9 figures, submitted to Plos Computational Biology (accepted

CBPRS: A City Based Parking and Routing System

Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased.information systems;computer simulation;dynamic routing

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Sensor networks security based on sensitive robots agents. A conceptual model

Multi-agent systems are currently applied to solve complex problems. The security of networks is an eloquent example of a complex and difficult problem. A new model-concept Hybrid Sensitive Robot Metaheuristic for Intrusion Detection is introduced in the current paper. The proposed technique could be used with machine learning based intrusion detection techniques. The new model uses the reaction of virtual sensitive robots to different stigmergic variables in order to keep the tracks of the intruders when securing a sensor network.Comment: 5 page

CBPRS: A City Based Parking and Routing System

Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased