387 research outputs found

    A robot swarm assisting a human fire-fighter

    Get PDF
    Emergencies in industrial warehouses are a major concern for fire-fighters. 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 paper we discuss the technology developed for a swarm of robots assisting fire-fighters. We explain the swarming algorithms that 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 the means to locate the robots and humans. Thus, the robot swarm is able to provide guidance information to the humans. Together with the fire-fighters 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

    GUARDIANS final report

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

    GUARDIANS final report part 1 (draft): a robot swarm assisting a human fire fighter

    Get PDF
    Emergencies in industrial warehouses are a major concern for fire fighters. 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 re ghters in searching a large warehouse. In this paper we discuss the technology developed for a swarm of robots assisting re ghters. 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 the means to locate the robots and humans. Thus the robot swarm is able to provide guidance information to the humans. Together with the fire fighters 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

    Computational Challenges in Cooperative Intelligent Urban Transport

    Get PDF
    This report documents the talks and group work of Dagstuhl Seminar 16091 “Computational Challenges in Cooperative Intelligent Urban Transport”. This interdisciplinary seminar brought researchers together from many fields including computer science, transportation, operations research, mathematics, machine learning and artificial intelligence. The seminar included two formats of talks: several minute research statements and longer overview talks. The talks given are documented here with abstracts. Furthermore, this seminar consisted of significant amounts of group work that is also documented with short abstracts detailing group discussions and planned outcomes

    Formation coordination and network management of UAV networks using particle swarm optimization and software-defined networking

    Get PDF
    In recent years, with the growth in the use of Unmanned Aerial Vehicles (UAVs), UAV-based systems have become popular in both military and civil applications. The lack of reliable communication infrastructure in these scenarios has motivated the use of UAVs to establish a network as flying nodes, also known as UAV networks. However, the high mobility degree of flying and terrestrial users may be responsible for constant changes in nodes’ positioning, which makes it more challenging to guarantee their communication during the operational time. In this context, this work presents a framework solution for formation coordination and network management of UAVs, which aims to establish and maintain a set of relays units in order to provide a constant, reliable and efficient communication link among user nodes - which are performing individual or collaborative missions on its turn. Such a framework relies on a set of formation coordination algorithms - including the Particle Swarm Optimization (PSO) evolutionary algorithm -, and also considers the use of Software-defined Networking-based (SDN) communication protocol for network management. For coordination proposes, a novel particle selection criteria is proposed, which aims to guarantee network manageability of UAV formations, therefore being able to guarantee service persistence in case of nodes’ failure occurrence, as well as to provide required network performance, as a consequence. Simulations performed in OMNeT++ show the efficiency of the proposed solution and prove a promising direction of the solution for accomplishing its purposes.Em regiões de confrontos militares, em cenários pós-catástrofes naturais e, inclusive, em grandes áreas de cultivo agrícola, é comum a ausência de uma infra-estrutura préestabelecida de comunicação entre usuários durante a execução de uma ou mais operações eventuais. Nestes casos, Veículos Aéreos Não Tripulados (VANTs) podem ser vistos como uma alternativa para o estabelecimento de uma rede temporária durante essas missões. Para algumas aplicações, a alta mobilidade destes usuários podem trazem grandes desafios para o gerenciamento autônomo de uma estrutura de comunicação aérea, como a organização espacial dos nós roteadores e as políticas de encaminhamento de pacotes adotadas durante a operação. Tendo isso em vista, esse trabalho apresenta o estudo de uma solução que visa o estabelecimento e manutenção das conexões entre os usuários - nos quais executam tarefas individuais ou colaborativas -, através do uso de algoritmos de coordenação de formação - no qual inclui o algoritmo evolucionário Otimização por Enxame de Partículas -, e, também, de conceitos relacionados a Rede Definidas por Software para o gerenciamento da rede. Ainda, é proposto um novo critério de seleção das partículas do algoritmo evolucionário, visando garantir gerenciabilidade das topologias formadas e, consequentemente, a persistência do serviço em caso de falha dos nós roteadores, assim como o cumprimento de especificações desejadas para o desempenho da rede. Simulações em OMNeT++ mostraram a eficácia da proposta e sustentam o modelo proposto a fim de atingir seus objetivos

    Distributed Task Allocation and Task Sequencing for Robots with Motion Constraints

    Get PDF
    This thesis considers two routing and scheduling problems. The first problem is task allocation and sequencing for multiple robots with differential motion constraints. Each task is defined as visiting a point in a subset of the robot configuration space -- this definition captures a variety of tasks including inspection and servicing, as well as one-in-a-set tasks. Our approach is to transform the problem into a multi-vehicle generalized traveling salesman problem (GTSP). We analyze the GTSP insertion methods presented in literature and we provide bounds on the performance of the three insertion mechanisms. We then develop a combinatorial-auction-based distributed implementation of the allocation and sequencing algorithm. The number of the bids in a combinatorial auction, a crucial factor in the runtime, is shown to be linear in the size of the tasks. Finally, we present extensive benchmarking results to demonstrate the improvement over existing distributed task allocation methods. In the second part of this thesis, we address the problem of computing optimal paths through three consecutive points for the curvature-constrained forward moving Dubins vehicle. Given initial and final configurations of the Dubins vehicle and a midpoint with an unconstrained heading, the objective is to compute the midpoint heading that minimizes the total Dubins path length. We provide a novel geometrical analysis of the optimal path and establish new properties of the optimal Dubins' path through three points. We then show how our method can be used to quickly refine Dubins TSP tours produced using state-of-the-art techniques. We also provide extensive simulation results showing the improvement of the proposed approach in both runtime and solution quality over the conventional method of uniform discretization of the heading at the mid-point, followed by solving the minimum Dubins path for each discrete heading
    corecore