Adaptive use of task assignment models in team-based mobile business processes

Most mobile business processes are executed under uncertain and dynamic working environments. This makes the traditional centralized approach for the management of mobile tasks inappropriate to respond to the changes in working environment quickly as collecting the changing information from geographically distributed workforces in real time is expensive if not impossible. This raises the need of a distributed approach in the management of mobile tasks. This paper proposes a distributed architecture for team-based coordination support for mobile task management. In this architecture, tasks are managed via peer-to-peer style coordination between team members who have better understanding on the changing working environment than a centralised system. The novelty of the design of the architecture is explained by applying it to a real business process in the UK

A decentralized motion coordination strategy for dynamic target tracking

This paper presents a decentralized motion planning algorithm for the distributed sensing of a noisy dynamical process by multiple cooperating mobile sensor agents. This problem is motivated by localization and tracking tasks of dynamic targets. Our gradient-descent method is based on a cost function that measures the overall quality of sensing. We also investigate the role of imperfect communication between sensor agents in this framework, and examine the trade-offs in performance between sensing and communication. Simulations illustrate the basic characteristics of the algorithms

Self-organising satellite constellation in geostationary Earth orbit

This paper presents a novel solution to the problem of autonomous task allocation for a self-organizing satellite constellation in Earth orbit. The method allows satellites to cluster themselves above targets on the Earth’s surface. This is achieved using Coupled Selection Equations (CSE) - a dynamical systems approach to combinatorial optimization whose solution tends asymptotically towards a Boolean matrix describing the pairings of satellites and targets which solves the relevant assignment problems. Satellite manoeuvers are actuated by an Artificial Potential Field method which incorporates the CSE output. Three demonstrations of the method’s efficacy are given - first with equal numbers of satellites and targets, then with a satellite surplus, including agent failures, and finally with a fractionated constellation. Finally, a large constellation of 100 satellites is simulated to demonstrate the utility of the method in future swarm mission scenarios. The method provides efficient solutions with quick convergence, is robust to satellite failures, and hence appears suitable for distributed, on-board autonomy

Teaching about Madrid: A Collaborative Agents-Based Distributed Learning Course

Interactive art courses require a huge amount of computational resources to be running on real time. These computational resources are even bigger if the course has been designed as a Virtual Environment with which students can interact. In this paper, we present an initiative that has been develop in a close collaboration between two Spanish Universities: Universidad Politécnica de Madrid and Universidad Rey Juan Carlos with the aim of join two previous research project: a Collaborative Awareness Model for Task-Balancing-Delivery (CAMT) in clusters and the “Teaching about Madrid” course, which provides a cultural interactive background of the capital of Spain

Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art

Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP

A Factory-based Approach to Support E-commerce Agent Fabrication

With the development of Internet computing and software agent technologies, agent-based e-commerce is emerging. How to create agents for e-commerce applications has become an important issue along the way to success. We propose a factory-based approach to support agent fabrication in e-commerce and elaborate a design based on the SAFER (Secure Agent Fabrication, Evolution & Roaming) framework. The details of agent fabrication, modular agent structure, agent life cycle, as well as advantages of agent fabrication are presented. Product-brokering agent is employed as a practical agent type to demonstrate our design and Java-based implementation

Coordination of Mobile Mules via Facility Location Strategies

In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and fix it. The mules must constantly optimize their collective deployment to account for occupied mules. The objective is to define the optimal deployment and task allocation strategy for the mules, so that the sensors' downtime and the mules' traveling distance are minimized. Our solutions are inspired by research in the field of computational geometry and the design of our algorithms is based on state of the art approximation algorithms for the classical problem of facility location. Our empirical results demonstrate how cooperation enhances the team's performance, and indicate that a combination of k-Median based deployment with closest-available task allocation provides the best results in terms of minimizing the sensors' downtime but is inefficient in terms of the mules' travel distance. A k-Centroid based deployment produces good results in both criteria.Comment: 12 pages, 6 figures, conferenc