Multi-agent Path Planning and Network Flow

This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the latter, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invariant, the problem always has a feasible solution path set with a longest finish time of no more than $n + V - 1$ steps, in which $n$ is the number of agents and $V$ is the number of vertices of the underlying graph. We then give a complete algorithm that finds such a solution in $O(nVE)$ time, with $E$ being the number of edges of the graph. Taking a further step, we study time and distance optimality of the feasible solutions, show that they have a pairwise Pareto optimal structure, and again provide efficient algorithms for optimizing two of these practical objectives.Comment: Corrected an inaccuracy on time optimal solution for average arrival tim

Multi-agent Animation Techniques for Traffic Simulation in Urban Environments

We describe an approach of using the multi-agent animation method for traffic simulations. The presented simulation system uses an individual-based agent behaviour model and discrete cell-based roadway configurations. The behaviour model defines the driving characteristics of each vehicle agent in a simulated traffic network, and the cell-based configurations allow real-time dynamic path planning and efficient traffic flow simulations. By incorporating the advantages of discrete cellular automation algorithms and the continuous model of fluid dynamics, our 3D virtual reality traffic simulation system achieves realistic and accurate simulations in virtual environments

Intermittent Connectivity for Exploration in Communication-Constrained Multi-Agent Systems

Motivated by exploration of communication-constrained underground environments using robot teams, we study the problem of planning for intermittent connectivity in multi-agent systems. We propose a novel concept of information-consistency to handle situations where the plan is not initially known by all agents, and suggest an integer linear program for synthesizing information-consistent plans that also achieve auxiliary goals. Furthermore, inspired by network flow problems we propose a novel way to pose connectivity constraints that scales much better than previous methods. In the second part of the paper we apply these results in an exploration setting, and propose a clustering method that separates a large exploration problem into smaller problems that can be solved independently. We demonstrate how the resulting exploration algorithm is able to coordinate a team of ten agents to explore a large environment

Synthesized cooperative strategies for intelligent multi-robots in a real-time distributed environment : a thesis presented in partial fulfillment of the requirements for the degree of Master of Science in Computer Science at Massey University, Albany, New Zealand

In the robot soccer domain, real-time response usually curtails the development of more complex Al-based game strategies, path-planning and team cooperation between intelligent agents. In light of this problem, distributing computationally intensive algorithms between several machines to control, coordinate and dynamically assign roles to a team of robots, and allowing them to communicate via a network gives rise to real-time cooperation in a multi-robotic team. This research presents a myriad of algorithms tested on a distributed system platform that allows for cooperating multi- agents in a dynamic environment. The test bed is an extension of a popular robot simulation system in the public domain developed at Carnegie Mellon University, known as TeamBots. A low-level real-time network game protocol using TCP/IP and UDP were incorporated to allow for a conglomeration of multi-agent to communicate and work cohesively as a team. Intelligent agents were defined to take on roles such as game coach agent, vision agent, and soccer player agents. Further, team cooperation is demonstrated by integrating a real-time fuzzy logic-based ball-passing algorithm and a fuzzy logic algorithm for path planning. Keywords Artificial Intelligence, Ball Passing, the coaching system, Collaborative, Distributed Multi-Agent, Fuzzy Logic, Role Assignmen

Preliminary Results of a Multiagent Traffic Simulation for Berlin

This paper provides an introduction to multi-agent traffic simulation. Metropolitan regions can consist of several million inhabitants, implying the simulation of several million travelers, which represents a considerable computational challenge. We reports on our recent case study of a real-world Berlin scenario. The paper explains computational techniques necessary to achieve results. It turns out that the difficulties there, because of data availability and because of the special situation of Berlin after the re-unification, are considerably larger than in previous scenarios that we have treated

VELOS : a VR platform for ship-evacuation analysis

Virtual Environment for Life On Ships (VELOS) is a multi-user Virtual Reality (VR) system that aims to support designers to assess (early in the design process) passenger and crew activities on a ship for both normal and hectic conditions of operations and to improve ship design accordingly. This article focuses on presenting the novel features of VELOS related to both its VR and evacuation-specific functionalities. These features include: (i) capability of multiple users’ immersion and active participation in the evacuation process, (ii) real-time interactivity and capability for making on-the-fly alterations of environment events and crowd-behavior parameters, (iii) capability of agents and avatars to move continuously on decks, (iv) integrated framework for both the simplified and advanced method of analysis according to the IMO/MSC 1033 Circular, (v) enrichment of the ship geometrical model with a topological model suitable for evacuation analysis, (vi) efficient interfaces for the dynamic specification and handling of the required heterogeneous input data, and (vii) post-processing of the calculated agent trajectories for extracting useful information for the evacuation process. VELOS evacuation functionality is illustrated using three evacuation test cases for a ro–ro passenger ship

Risk Minimizing Evacuation Strategies under Uncertainty

This paper presents results on the simulation of the evacuation of the city of Padang with approximately 1,000,000 inhabitants. The model used is MATSim (www.matsim.org). Three different strategies were applied: shortest path solution, user optimum, system optimum, together with a constraint that moves should reduce risk whenever possible. The introduction of the risk minimization increases the overall required safe egress time (RSET). The differences between the RSET for the three risk minimizing strategies are small. Further quantities used for the assessment of the evacuation are the formation of congestion and the individual RSETs (in comparison with the available SET).BMBF, 03G0666E, Verbundprojekt FW: Last-mile Evacuation; Vorhaben: Evakuierungsanalyse und Verkehrsoptimierung, Evakuierungsplan einer Stadt - Sonderprogramm GEOTECHNOLOGIENBMBF, 03NAPAI4, Transport und Verkehr: Verbundprojekt ADVEST: Adaptive Verkehrssteuerung; Teilprojekt Verkehrsplanung und Verkehrssteuerung in Megacitie