Małgorzata Żabińska

Robot Task Allocation Using Signal Propagation Model

Abstract The problem of Multi-Robot Task Allocation has received significant attention over last years. The solutions with decentralized decision making have proven better durability than those using centralized planning. In this paper a method which does not use any explicit communication is presented. It is especially suitable for very high dynamics of tasks priorities, when other methods must often perform time-consuming replanning. The method uses a simple model of signal emission and propagation in the environment. Simulation experiments are provided to demonstrate usability and interesting features of the method.

Multi-agent Crisis Management in Transport Domain

A multi-agent system that solves static and dynamic versions of transport problem (Pickup and Delivery Problem with Time Windows) in presence of crises is shown here. Scenarios to serve different kinds of crises (especially vehicle failures and traffic jams) by agents are described. The results summarising system functioning for solving classical PDPTW as well as influence of crises and applied algorithms of serving them upon quality of obtained solutions have been presented.

Multi-variant Planing for Dynamic Problems with Agent-based Signal Modeling

Abstract The problem of planning for groups of autonomous beings is gaining attention over the last few years. Real life tasks, like mobile robots coordination or urban traffic management, need robust and flexible solutions. In this paper a new approach to the problem of multi-variant planning in such systems is presented. It assumes use of simple reactive controllers by the beings, however the state observation is enriched by dynamically updated model, which contains planning results. The approach gives promising results in the considered use case, which is the Multi Robot Task Allocation problem.

Application of Holonic Approach for Transportation Modelling and Optimising

The goal of this work is to design an environment which makes it possible to build systems allowing flexible composition. Such systems may be used for modelling an organisation with a high level of complexity, with functionalities on different levels, realising heterogeneous activities.We use concepts and assumptions offered by multi-agent and holonic approaches. Theoretic representation of the abstract holon structure is given and a model for building a realisation for a domain, focusing especially on building and reorganising holons. The domain is the management of the transportation company and a delivery strategy for it. Selected results provided by the developed system are presented.

Multi-agent Models for Transportation Problems with Different Strategies of Environment Information Propagation

The aim of the work is to show a solution of dynamic transportation problem Pickup and Delivery Problem with Soft Time Windows, taking into account variable travel times between locations. The information about changes is obtained thanks to an algorithm that generates and propagates traffic jams or collects data from the traffic simulator. The model of such a multi-agent system is presented. Different types of propagation of information about changes of travel times for agents constituting a fleet of vehicles for the realisation of transportation requests and different methods of prediction of future actual travel times on road sections are taken into consideration.

Holonic-Based Environment for Solving Transportation Problems

In this paper, a system based on the concept of holons for solving transportation problems is presented. Such a system focuses on the possibility of comparing the quality of solutions offered by the system with the results obtained from classical algorithms for commonly used sets of test problems. These problems were modified in order to take into consideration the fundamental features offered by the holonic approach.

Environment for Identification of Significant Subjects on Information Portals

A large amount of information available on the Internet makes it difficult to identify the most significant or interesting (for a given user) facts and relations between them. It especially concerns the content of information portals, e.g. provided by popular newspapers and magazines.

Agent-Based Decision-Information System Supporting Effective Resource Management of Companies

The aim of the work is to propose a universal multi-agent environment for resource management in the enterprise. The system being developed is to be useful for employees of various divisions of the company: device operators, engineering staff optimizing the production process and senior management. The paper describes the architecture of the solution, which has a layered structure. The environment uses advanced techniques of artificial intelligence, including machine learning and negotiation algorithms. In the evaluation part, an implementation of a pilot version of the foundry management system is presented and a study of selected test scenarios is carried out.

Agent Simulation of Traffic Optimisation with the Use of Complex Networks Analysis and Voting

In the paper we present a model of the universal system for traffic control. The model comprises elements responsible for identification of key crossroads and decomposing of road network into sub-areas associated with given key crossroads. Different versions of key crossroads identification and network decomposing algorithms are shown. Some of these algorithms use voting by crossroads to distinguish the most important ones. Experiments carried out prove that the used approach improves efficiency of road traffic control.

Situation Patterns in Multi-Agent Systems for Solving Transportation Problems

The aim of the work is to propose algorithms which solve transportation problems, viz. Pickup and Delivery Problem with Time Windows (PDPTW), taking into consideration the identification and description of the current situation. The essential element of a solution is to calculate measures of the current situation and use them to decide on versions and configurations of algorithms performed dealing with given kinds of problems the best and limit the computational time.