A General Framework for Multi-Agent Task Selection

Ph.DDOCTOR OF PHILOSOPH

Decentralized Control of an Energy Constrained Heterogeneous Swarm for Persistent Surveillance

Robot swarms are envisioned in applications such as surveillance, agriculture, search-and-rescue operations, and construction. The decentralized nature of swarm intelligence has three key advantages over traditional multi-robot control algorithms: it is scalable, it is fault tolerant, and it is not susceptible to a single point of failure. These advantages are critical to the task of persistent surveillance - where a number of target locations need to be visited as frequently as possible. Unfortunately, in the real world, the autonomous robots that can be used for persistent surveillance have a limited battery life (or fuel capacity). Thus, they need to abandon their surveillance duties to visit a battery swapping station (or refueling depot) a.k.a. €˜depots€™. This €˜down time€™ reduces the frequency of visitation. This problem can be eliminated if the depots themselves were autonomous vehicles that could meet the (surveillance) robots at some point along their path from one target to another. Thus, the robots would spend less time on the \u27charging\u27 (or refueling) task. In this thesis we present decentralized control algorithms, and their results, for three stages of the persistent surveillance problem. First, we consider the case where the robots have no energy constraints, and use a decentralized approach to allow the robots choose the €˜best€™ target that they should visit next. While the selection process is decentralized, the robots can communicate with all the other robots in the swarm, and let them know which is their chosen target. We then consider the energy constraints of the robots, and slightly modify the algorithm, so that the robots visit a depot before they run out of energy. Lastly, we consider the case where the depots themselves can move, and communicate with the robots to pick a location and time to meet, to be able to swap the empty battery of a robot, with a fresh one. The goal of persistent surveillance is to visit target locations as frequently as possible, and thus, the performance measurement parameter is chosen to be the median frequency of visitation for all target locations. We evaluate the performance of the three algorithms in an extensive set of simulated experiments

Developing Police Patrol Strategies Based on the Urban Street Network

In urban areas, crime and disorder have been long-lasting problems that spoil the economic and emotional well-being of residents. A significant way to deter crime, and maintain public safety is through police patrolling. So far, the deployment of police forces in patrolling has relied mainly on expert knowledge, and is usually based on two-dimensional spatial units, giving insufficient consideration to the underlying urban structure and collaboration among patrol officers. This approach has led to impractical and inefficient police patrol strategies, as well as a workload imbalance among officers. Therefore, it is of essential importance to devise advanced police patrol strategies that incorporate urban structure, the collaboration of the patrol officers, and a workload balance. This study aims to develop police patrol strategies that would make intelligent use of the street network layout in urban areas. The street network is a key component in urban structure and is the domain in which crime and policing take place. By explicitly considering street network configurations in their operations, police forces are enabled to provide timely responses to emergency calls and essential coverage to crime hotspots. Although some models have considered street networks in patrolling to some extent, challenges remain. First, most existing methods for the design of police districts use two-dimensional units, such as grid cells, as basic units, but using streets as basic units would lead to districts that are more accessible and usable. Second, the routing problem in police patrolling has several unique characteristics, such as patrollers potentially starting from different stations, but most existing routing strategies have failed to consider these. Third, police patrolling strategies should be validated using real-world scenarios, whilst most existing strategies in the literature have only been tested in small hypothetical instances without realistic settings. In this thesis, a framework for developing police patrol strategies based on the urban street network is proposed, to effectively cover crime hotspots, as well as the rest of the territory. This framework consists of three strategies, including a districting model, a patrol routing strategy for repeated coverage, and a patrol routing strategy for infrequent coverage. Various relevant factors have been considered in the strategy design, including the underlying structure of the street network and the collaboration among patrollers belonging to different stations. Moreover, these strategies have been validated by the patrolling scenarios in London. The results demonstrate that these strategies outperform the current corresponding benchmark strategies, which indicates that they may have considerable potential in future police operations

Never Too Old To Learn: On-line Evolution of Controllers in Swarm- and Modular Robotics

Eiben, A.E. [Promotor

Do Herbivores Eavesdrop on Ant Chemical Communication to Avoid Predation?

Strong effects of predator chemical cues on prey are common in aquatic and marine ecosystems, but are thought to be rare in terrestrial systems and specifically for arthropods. For ants, herbivores are hypothesized to eavesdrop on ant chemical communication and thereby avoid predation or confrontation. Here I tested the effect of ant chemical cues on herbivore choice and herbivory. Using Margaridisa sp. flea beetles and leaves from the host tree (Conostegia xalapensis), I performed paired-leaf choice feeding experiments. Coating leaves with crushed ant liquids (Azteca instabilis), exposing leaves to ant patrolling prior to choice tests (A. instabilis and Camponotus textor) and comparing leaves from trees with and without A. instabilis nests resulted in more herbivores and herbivory on control (no ant-treatment) relative to ant-treatment leaves. In contrast to A. instabilis and C. textor, leaves previously patrolled by Solenopsis geminata had no difference in beetle number and damage compared to control leaves. Altering the time A. instabilis patrolled treatment leaves prior to choice tests (0-, 5-, 30-, 90-, 180-min.) revealed treatment effects were only statistically significant after 90- and 180-min. of prior leaf exposure. This study suggests, for two ecologically important and taxonomically diverse genera (Azteca and Camponotus), ant chemical cues have important effects on herbivores and that these effects may be widespread across the ant family. It suggests that the effect of chemical cues on herbivores may only appear after substantial previous ant activity has occurred on plant tissues. Furthermore, it supports the hypothesis that herbivores use ant chemical communication to avoid predation or confrontation with ants

訪問頻度を考慮したマルチエージェント巡回問題における公平なタスク分割法の提案

早大学位記番号:新7959早稲田大

Drone Base Station Trajectory Management for Optimal Scheduling in LTE-Based Sparse Delay-Sensitive M2M Networks

Providing connectivity in areas out of reach of the cellular infrastructure is a very active area of research. This connectivity is particularly needed in case of the deployment of machine type communication devices (MTCDs) for critical purposes such as homeland security. In such applications, MTCDs are deployed in areas that are hard to reach using regular communications infrastructure while the collected data is timely critical. Drone-supported communications constitute a new trend in complementing the reach of the terrestrial communication infrastructure. In this study, drones are used as base stations to provide real-time communication services to gather critical data out of a group of MTCDs that are sparsely deployed in a marine environment. Studying different communication technologies as LTE, WiFi, LPWAN and Free-Space Optical communication (FSOC) incorporated with the drone communications was important in the first phase of this research to identify the best candidate for addressing this need. We have determined the cellular technology, and particularly LTE, to be the most suitable candidate to support such applications. In this case, an LTE base station would be mounted on the drone which will help communicate with the different MTCDs to transmit their data to the network backhaul. We then formulate the problem model mathematically and devise the trajectory planning and scheduling algorithm that decides the drone path and the resulting scheduling. Based on this formulation, we decided to compare between an Ant Colony Optimization (ACO) based technique that optimizes the drone movement among the sparsely-deployed MTCDs and a Genetic Algorithm (GA) based solution that achieves the same purpose. This optimization is based on minimizing the energy cost of the drone movement while ensuring the data transmission deadline missing is minimized. We present the results of several simulation experiments that validate the different performance aspects of the technique

Learning spatiotemporal patterns for monitoring smart cities and infrastructure

Recent advances in the Internet of Things (IoT) have changed the way we interact with the world. The ability to monitor and manage objects in the physical world electronically makes it possible to bring data-driven decision making to new realms of city infrastructure and management. Large volumes of spatiotemporal data have been collected from pervasive sensors in both indoor and outdoor environments, and this data reveals dynamic patterns in cities, infrastructure, and public property. In light of the need for new approaches to analysing such data, in this thesis, we propose present relevant data mining techniques and machine learning approaches to extract knowledge from spatiotemporal data to solve real-world problems. Many challenges and problems are under-addressed in smart cities and infrastructure monitoring systems such as indoor person identification, evaluation of city regions segmentation with parking events, fine collection from cars in violations, parking occupancy prediction and airport aircraft path map reconstruction. All the above problems are associated with both spatial and temporal information and the accurate pattern recognition of these spatiotemporal data are essential for determining problem solutions. Therefore, how to incorporate spatiotemporal data mining techniques, artificial intelligence approaches and expert knowledge in each specific domain is a common challenge. In the indoor person identification area, identifying the person accessing a secured room without vision-based or device-based systems is very challenging. In particular, to distinguish time-series patterns on high-dimensional wireless signal channels caused by different activities and people, requires novel time-series data mining approaches. To solve this important problem, we established a device-free system and proposed a two-step solution to identify a person who has accessed a secure area such as an office. Establishing smart parking systems in cities is a key component of smart cities and infrastructure construction. Many sub-problems such as parking space arrangements, fine collection and parking occupancy prediction are urgent and important for city managers. Arranging parking spaces based on historical data can improve the utilisation rate of parking spaces. To arrange parking spaces based on collected spatiotemporal data requires reasonable region segmentation approaches. Moreover, evaluating parking space grouping results needs to consider the correlation between the spatial and temporal domains since these are heterogeneous. Therefore, we have designed a spatiotemporal data clustering evaluation approach, which exploits the correlation between the spatial domain and the temporal domain. It can evaluate the segmentation results of parking spaces in cities using historical data and similar clustering results that group data consisting of both spatial and temporal domains. For fine collection problem, using the sensor instrumentation installed in parking spaces to detect cars in violation and issue infringement notices in a short time-window to catch these cars in time is significantly difficult. This is because most cars in violation leave within a short period and multiple cars are in violation at the same time. Parking officers need to choose the best route to collect fines from these drivers in the shortest time. Therefore, we proposed a new optimisation problem called the Travelling Officer Problem and a general probability-based model. We succeeded in integrating temporal information and the traditional optimisation algorithm. This model can suggest to parking officers an optimised path that maximise the probability to catch the cars in violation in time. To solve this problem in real-time, we incorporated the model with deep learning methods. We proposed a theoretical approach to solving the traditional orienteering problem with deep learning networks. This approach could improve the efficiency of similar urban computing problems as well. For parking occupancy prediction, a key problem in parking space management is with providing a car parking availability prediction service that can inform car drivers of vacant parking lots before they start their journeys using prediction approaches. We proposed a deep learning-based model to solve this parking occupancy prediction problem using spatiotemporal data analysis techniques. This model can be generalised to other spatiotemporal data prediction problems also. In the airport aircraft management area, grouping similar spatiotemporal data is widely used in the real world. Determining key features and combining similar data are two key problems in this area. We presented a new framework to group similar spatiotemporal data and construct a road graph with GPS data. We evaluated our framework experimentally using a state-of-the-art test-bed technique and found that it could effectively and efficiently construct and update airport aircraft route map. In conclusion, the studies in this thesis aimed to discover intrinsic and dynamic patterns from spatiotemporal data and proposed corresponding solutions for real-world smart cities and infrastructures monitoring problems via spatiotemporal pattern analysis and machine learning approaches. We hope this research will inspire the research community to develop more robust and effective approaches to solve existing problems in this area in the future