139 research outputs found

    Multi-Robot Symbolic Task and Motion Planning Leveraging Human Trust Models: Theory and Applications

    Get PDF
    Multi-robot systems (MRS) can accomplish more complex tasks with two or more robots and have produced a broad set of applications. The presence of a human operator in an MRS can guarantee the safety of the task performing, but the human operators can be subject to heavier stress and cognitive workload in collaboration with the MRS than the single robot. It is significant for the MRS to have the provable correct task and motion planning solution for a complex task. That can reduce the human workload during supervising the task and improve the reliability of human-MRS collaboration. This dissertation relies on formal verification to provide the provable-correct solution for the robotic system. One of the challenges in task and motion planning under temporal logic task specifications is developing computationally efficient MRS frameworks. The dissertation first presents an automaton-based task and motion planning framework for MRS to satisfy finite words of linear temporal logic (LTL) task specifications in parallel and concurrently. Furthermore, the dissertation develops a computational trust model to improve the human-MRS collaboration for a motion task. Notably, the current works commonly underemphasize the environmental attributes when investigating the impacting factors of human trust in robots. Our computational trust model builds a linear state-space (LSS) equation to capture the influence of environment attributes on human trust in an MRS. A Bayesian optimization based experimental design (BOED) is proposed to sequentially learn the human-MRS trust model parameters in a data-efficient way. Finally, the dissertation shapes a reward function for the human-MRS collaborated complex task by referring to the above LTL task specification and computational trust model. A Bayesian active reinforcement learning (RL) algorithm is used to concurrently learn the shaped reward function and explore the most trustworthy task and motion planning solution

    Multi-Agent Systems

    Get PDF
    This Special Issue ""Multi-Agent Systems"" gathers original research articles reporting results on the steadily growing area of agent-oriented computing and multi-agent systems technologies. After more than 20 years of academic research on multi-agent systems (MASs), in fact, agent-oriented models and technologies have been promoted as the most suitable candidates for the design and development of distributed and intelligent applications in complex and dynamic environments. With respect to both their quality and range, the papers in this Special Issue already represent a meaningful sample of the most recent advancements in the field of agent-oriented models and technologies. In particular, the 17 contributions cover agent-based modeling and simulation, situated multi-agent systems, socio-technical multi-agent systems, and semantic technologies applied to multi-agent systems. In fact, it is surprising to witness how such a limited portion of MAS research already highlights the most relevant usage of agent-based models and technologies, as well as their most appreciated characteristics. We are thus confident that the readers of Applied Sciences will be able to appreciate the growing role that MASs will play in the design and development of the next generation of complex intelligent systems. This Special Issue has been converted into a yearly series, for which a new call for papers is already available at the Applied Sciences journal’s website: https://www.mdpi.com/journal/applsci/special_issues/Multi-Agent_Systems_2019

    Swarm intelligence: novel tools for optimization, feature extraction, and multi-agent system modeling

    Get PDF
    Abstract Animal swarms in nature are able to adapt to dynamic changes in their envi-ronment, and through cooperation they can solve problems that are crucial for their survival. Only by means of local interactions with other members of the swarm and with the environment, they can achieve a common goal more efficiently than it would be done by a single individual. This problem-solving behavior that results from the multiplicity of such interactions is referred to as Swarm Intelligence. The mathematical models of swarming behavior in nature were initially proposed to solve optimization problems. Nevertheless, this decentralized approach can be a valuable tool for a variety of applications, where emerging global patterns represent a solution to the task at hand. Methods for the solution of difficult computational problems based on Swarm Intelligence have been experimentally demonstrated and reported in the literature. However, a general framework that would facilitate their design does not exist yet. In this dissertation, a new general design methodology for Swarm Intelligence tools is proposed. By defining a discrete space in which the members of the swarm can move, and by modifying the rules of local interactions and setting the adequate objective function for solutions evaluation, the proposed methodology is tested in various domains. The dissertation presents a set of case studies, and focuses on two general approaches. One approach is to apply Swarm Intelligence as a tool for optimization and feature extraction, and the other approach is to model multi-agent systems such that they resemble swarms of animals in nature providing them with the ability to autonomously perform a task at hand. Artificial swarms are designed to be autonomous, scalable, robust, and adaptive to the changes in their environment. In this work, the methods that exploit one or more of these features are presented. First, the proposed methodology is validated in a real-world scenario seen as a combinatorial optimization problem. Then a set of novel tools for feature extraction, more precisely the adaptive edge detection and the broken-edge linking in digital images is proposed. A novel data clustering algorithm is also proposed and applied to image segmentation. Finally, a scalable algorithm based on the proposed methodology is developed for distributed task allocation in multi-agent systems, and applied to a swarm of robots. The newly proposed general methodology provides a guideline for future developers of the Swarm Intelligence tools. Los enjambres de animales en la naturaleza son capaces de adaptarse a cambios dinamicos en su entorno y, por medio de la cooperación, pueden resolver problemas ´ cruciales para su supervivencia. Unicamente por medio de interacciones locales con otros miembros del enjambre y con el entorno, pueden lograr un objetivo común de forma más eficiente que lo haría un solo individuo. Este comportamiento problema-resolutivo que es resultado de la multiplicidad de interacciones se denomina Inteligencia de Enjambre. Los modelos matemáticos de comportamiento de enjambres en entornos naturales fueron propuestos inicialmente para resolver problemas de optimización. Sin embargo, esta aproximación descentralizada puede ser una herramienta valiosa en una variedad de aplicaciones donde patrones globales emergentes representan una solución de las tareas actuales. Aunque en la literatura se muestra la utilidad de los métodos de Inteligencia de Enjambre, no existe un entorno de trabajo que facilite su diseño. En esta memoria de tesis proponemos una nueva metodologia general de diseño para herramientas de Inteligencia de Enjambre. Desarrollamos herramientas noveles que representan ejem-plos ilustrativos de su implementación. Probamos la metodología propuesta en varios dominios definiendo un espacio discreto en el que los miembros del enjambre pueden moverse, modificando las reglas de las interacciones locales y fijando la función objetivo adecuada para evaluar las soluciones. La memoria de tesis presenta un conjunto de casos de estudio y se centra en dos aproximaciones generales. Una aproximación es aplicar Inteligencia de Enjambre como herramienta de optimización y extracción de características mientras que la otra es modelar sistemas multi-agente de tal manera que se asemejen a enjambres de animales en la naturaleza a los que se les confiere la habilidad de ejecutar autónomamente la tarea. Los enjambres artificiales están diseñados para ser autónomos, escalables, robustos y adaptables a los cambios en su entorno. En este trabajo, presentamos métodos que explotan una o más de estas características. Primero, validamos la metodología propuesta en un escenario del mundo real visto como un problema de optimización combinatoria. Después, proponemos un conjunto de herramientas noveles para ex-tracción de características, en concreto la detección adaptativa de bordes y el enlazado de bordes rotos en imágenes digitales, y el agrupamiento de datos para segmentación de imágenes. Finalmente, proponemos un algoritmo escalable para la asignación distribuida de tareas en sistemas multi-agente aplicada a enjambres de robots. La metodología general recién propuesta ofrece una guía para futuros desarrolladores deherramientas de Inteligencia de Enjambre

    Adaptive heterogeneous parallelism for semi-empirical lattice dynamics in computational materials science.

    Get PDF
    With the variability in performance of the multitude of parallel environments available today, the conceptual overhead created by the need to anticipate runtime information to make design-time decisions has become overwhelming. Performance-critical applications and libraries carry implicit assumptions based on incidental metrics that are not portable to emerging computational platforms or even alternative contemporary architectures. Furthermore, the significance of runtime concerns such as makespan, energy efficiency and fault tolerance depends on the situational context. This thesis presents a case study in the application of both Mattsons prescriptive pattern-oriented approach and the more principled structured parallelism formalism to the computational simulation of inelastic neutron scattering spectra on hybrid CPU/GPU platforms. The original ad hoc implementation as well as new patternbased and structured implementations are evaluated for relative performance and scalability. Two new structural abstractions are introduced to facilitate adaptation by lazy optimisation and runtime feedback. A deferred-choice abstraction represents a unified space of alternative structural program variants, allowing static adaptation through model-specific exhaustive calibration with regards to the extrafunctional concerns of runtime, average instantaneous power and total energy usage. Instrumented queues serve as mechanism for structural composition and provide a representation of extrafunctional state that allows realisation of a market-based decentralised coordination heuristic for competitive resource allocation and the Lyapunov drift algorithm for cooperative scheduling

    Aerospace medicine and biology: A continuing bibliography with indexes (supplement 344)

    Get PDF
    This bibliography lists 125 reports, articles and other documents introduced into the NASA Scientific and Technical Information System during January, 1989. Subject coverage includes: aerospace medicine and psychology, life support systems and controlled environments, safety equipment, exobiology and extraterrestrial life, and flight crew behavior and performance

    Inverse Dynamics Problems

    Get PDF
    The inverse dynamics problem was developed in order to provide researchers with the state of the art in inverse problems for dynamic and vibrational systems. Contrasted with a forward problem, which solves for the system output in a straightforward manner, an inverse problem searches for the system input through a procedure contaminated with errors and uncertainties. An inverse problem, with a focus on structural dynamics, determines the changes made to the system and estimates the inputs, including forces and moments, to the system, utilizing measurements of structural vibration responses only. With its complex mathematical structure and need for more reliable input estimations, the inverse problem is still a fundamental subject of research among mathematicians and engineering scientists. This book contains 11 articles that touch upon various aspects of inverse dynamic problems

    Coordination of Cooperative Multi-Robot Teams

    Get PDF
    This thesis is about cooperation of multiple robots that have a common task they should fulfill, i.e., how multi-robot systems behave in cooperative scenarios. Cooperation is a very important aspect in robotics, because multiple robots can solve a task more quickly or efficiently in many situations. Specific points of interest are, how the effectiveness of the group of robots completing a task can be improved and how the amount of communication and computational requirements can be reduced. The importance of this topic lies in applications like search and rescue scenarios, where time can be a critical factor and a certain robustness and reliability are required. Further the communication can be limited by various factors and operating (multiple) robots can be a highly complicated task. A typical search and rescue mission as considered in this thesis begins with the deployment of the robot team in an unknown or partly known environment. The team can be heterogeneous in the sense that it consists of pairs of air and ground robots that assist each other. The air vehicle – abbreviated as UAV – stays within vision range of the ground vehicle or UGV. Therefrom, it provides sensing information with a camera or similar sensor that might not be available to the UGV due to distance, perspective or occlusion. A new approach to fully use the available movement range is presented and analyzed theoretically and in simulations. The UAV moves according to a dynamic coverage algorithm which is combined with a tracking controller to guarantee the visibility limitation is kept. Since the environment is at least partly unknown, an exploration method is necessary to gather information about the situation and possible targets or areas of interest. Exploring the unknown regions in a short amount of time is solved by approaching points on the frontier between known and unknown territory. To this end, a basic approach for single robot exploration that uses the traveling salesman problem is extended to multirobot exploration. The coordination, which is a central aspect of the cooperative exploration process, is realized with a pairwise optimization procedure. This new algorithm uses minimum spanning trees for cost estimation and is inspired by one of the many multi-robot coordination methods from the related literature. Again, theoretical and simulated as well as statistical analysis are used as methods to evaluate the approach. After the exploration is complete, a map of the environment with possible regions of higher importance is known by the robot team. To stay useful and ready for any further events, the robots now switch to a monitoring state where they spread out to cover the area in an optimal manner. The optimality is measured with a criterion that can be derived into a distributed control law. This leads to splitting of the robots into areas of Voronoi cells where each robot has a maximum distance to other robots and can sense any events within its assigned cell. A new variant of these Voronoi cells is introduced. They are limited by visibility and depend on a delta-contraction of the environment, which leads to automatic collision avoidance. The combination of these two aspects leads to a coverage control algorithm that works in nonconvex environments and has advantageous properties compared to related work

    The 1995 Goddard Conference on Space Applications of Artificial Intelligence and Emerging Information Technologies

    Get PDF
    This publication comprises the papers presented at the 1995 Goddard Conference on Space Applications of Artificial Intelligence and Emerging Information Technologies held at the NASA/Goddard Space Flight Center, Greenbelt, Maryland, on May 9-11, 1995. The purpose of this annual conference is to provide a forum in which current research and development directed at space applications of artificial intelligence can be presented and discussed

    Path planning for first responders in the presence of moving obstacles

    Get PDF
    Navigation services have gained much importance for all kinds of human activities ranging from tourist navigation to support of rescue teams in disaster management. However, despite the considerable amount of route guidance research that has been performed, many issues that are related to navigation for first responders still need to be addressed. During disasters, emergencies can result in different types of moving obstacles (e.g., fires, plumes, floods), which make some parts of the road network temporarily unavailable. After such incidents occur, responders have to go to different destinations to perform their tasks in the environment affected by the disaster. Therefore they need a path planner that is capable of dealing with such moving obstacles, as well as generating and coordinating their routes quickly and efficiently. During the past decades, more and more hazard simulations, which can modify the models with incorporation of dynamic data from the field, have been developed. These hazard simulations use methods such as data assimilation, stochastic estimation, and adaptive measurement techniques, and are able to generate more reliable results of hazards. This would allow the hazard simulation models to provide valuable information regarding the state of road networks affected by hazards, which supports path planning for first responders among the moving obstacles. The objective of this research is to develop an integrated navigation system for first responders in the presence of moving obstacles. Such system should be able to navigate one or more responders to one or multiple destinations avoiding the moving obstacles, using the predicted information of the moving obstacles generated from by hazard simulations. In this dissertation, the objective we have is expressed as the following research question: How do we safely and efficiently navigate one or more first responders to one or more destinations avoiding moving obstacles? To address the above research questions, this research has been conducted using the following outline: 1). literature review; 2). conceptual design and analysis; 3). implementation of the prototype; and 4). assessment of the prototype and adaption. We investigated previous research related to navigation in disasters, and designed an integrated navigation system architecture, assisting responders in spatial data storage, processing and analysis.Within this architecture, we employ hazard models to provide the predicted information about the obstacles, and select a geo-database to store the data needed for emergency navigation. Throughout the development of the prototype navigation system, we have proposed: a taxonomy of navigation among obstacles, which categorizes navigation cases on basis of type and multiplicity of first responders, destinations, and obstacles; a multi-agent system, which supports information collection from hazard simulations, spatio-temporal data processing and analysis, connection with a geo-database, and route generation in dynamic environments affected by disasters; data models, which structure the information required for finding paths among moving obstacles, capturing both static information, such as the type of the response team, the topology of the road network, and dynamic information, such as changing availabilities of roads during disasters, the uncertainty of the moving obstacles generated from hazard simulations, and the position of the vehicle; path planning algorithms, which generate routes for one or more responders in the presence of moving obstacles. Using the speed of vehicles, departure time, and the predicted information about the state of the road network, etc., three versions (I, II, and III) of Moving Obstacle Avoiding A* (MOAAStar) algorithms are developed: 1). MOAAstar– I/Non-waiting, which supports path planning in the case of forest fires; 2). MOAAstar–II/Waiting, which introduces waiting options to avoid moving obstacles like plumes; 3). MOAAstar–III/Uncertainty, which can handle the uncertainty in predictions of moving obstacles and incorporate the profile of responders into the routing. We have applied the developed prototype navigation system to different navigation cases with moving obstacles. The main conclusions drawn from our applications are summarized as follows: In the proposed taxonomy, we have identified 16 navigation cases that could occur in disaster response and need to be investigated. In addressing these navigation problems, it would be quite useful to employ computer simulations and models, which can make reliable predicted information about responders, the targets, and obstacles, in finding safe routes for the responders. The approach we provide is general and not limited to the cases of plumes and fires. In our data model, the data about the movement of hazards is represented as moving polygons. This allows the data model to be easily adjusted to merge and organize information from models of different types of disasters. For example, the areas that are affected by floods can also be represented as moving polygons. To facilitate the route calculation, not only the data of obstacles but also the information about the state of road networks affected by obstacles need to be structured and stored in the database. In planning routes for responders, the routing algorithms should incorporate the dynamic data of obstacles to be able to avoid the hazards. Besides, other factors, such as the operation time of tasks, the required arrival time, and departure time, also need to be considered to achieve the objectives in a rescue process, e.g., to minimize the delays caused by the moving obstacles. The profile of responders is quite important for generation of feasible routes for a specific disaster situation. The responders may have different protective equipment that allows them to pass through different types of moving obstacles, and thus can have different classification of risk levels to define the state of the road network. By taking into account the profile of the responders, the navigation system can propose customized and safe routes to them, which would facilitate their disaster response processes. On the basis of our findings, we suggest the following topics for future work: As presented Wang and Zlatanova (2013c), there are still a couple of navigation cases that need to be addressed, especially the ones that involve dynamic destinations. More algorithms would be needed to solve these navigation problems. Besides, some extreme cases (e.g., the obstacle covers the target point during the course of an incident) also need to be investigated. Using standard Web services, an Android navigation application, which can provide navigation services in the environment affected by hazards, needs to be developed and tested in both the daily practice and real disasters. In this application, a user interface with various styling options should also be designed for different situations, e.g., waiting and moving, day and night, and urgent and non-urgent. Because the communication infrastructure may not be available or work properly during a disaster response, a decentralized method is needed to allow different users to negotiate with each other and to make local agreements on the distribution of tasks in case there is no support from the central planning system. Another type of multi-agent system would be needed to handle this situation. Introduce variable traveling speed into the re-routing process. The vehicle speed plays an important role in generation of routes avoiding moving obstacle, and can be influenced by many factors, such as the obstacles, the type of vehicles, traffic conditions, and the type of roads. Therefore, it would be needed to investigate how to derive the current and future speed from trajectories of vehicles. Apply the system to aid navigation in various types of natural disasters, using different hazard simulation models (e.g., flood model). More types of agents would be needed and integrated into the system to handle heterogeneous data from these models. Extensions of the data model are also required to meet a wider range of informational needs when multiple disasters occur simultaneously

    A Hormone Inspired System for On-line Adaptation in Swarm Robotic Systems

    Get PDF
    Individual robots, while providing the opportunity to develop a bespoke and specialised system, suffer in terms of performance when it comes to executing a large number of concurrent tasks. In some cases it is possible to drastically increase the speed of task execution by adding more agents to a system, however this comes at a cost. By mass producing relatively simple robots, costs can be kept low while still gaining the benefit of large scale multi-tasking. This approach sits at the core of swarm robotics. Robot swarms excel in tasks that rely heavily on their ability to multi-task, rather than applications that require bespoke actuation. Swarm suited tasks include: exploration, transportation or operation in dangerous environments. Swarms are particularly suited to hazardous environments due to the inherent expendability that comes with having multiple, decentralised agents. However, due to the variance in the environments a swarm may explore and their need to remain decentralised, a level of adaptability is required of them that can't be provided before a task begins. Methods of novel hormone-inspired robotic control are proposed in this thesis, offering solutions to these problems. These hormone inspired systems, or virtual hormones, provide an on-line method for adaptation that operates while a task is executed. These virtual hormones respond to environmental interactions. Then, through a mixture of decay and stimulant, provide values that grant contextually relevant information to individual robots. These values can then be used in decision making regarding parameters and behavioural changes. The hormone inspired systems presented in this thesis are found to be effective in mid-task adaptation, allowing robots to improve their effectiveness with minimal user interaction. It is also found that it is possible to deploy amalgamations of multiple hormone systems, controlling robots at multiple levels, enabling swarms to achieve strong, energy-efficient, performance
    corecore