31,233 research outputs found
Recommended from our members
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
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
Decentralised Coordination in RoboCup Rescue
Emergency responders are faced with a number of significant challenges when managing major disasters. First, the number of rescue tasks posed is usually larger than the number of responders (or agents) and the resources available to them. Second, each task is likely to require a different level of effort in order to be completed by its deadline. Third, new tasks may continually appear or disappear from the environment, thus requiring the responders to quickly recompute their allocation of resources. Fourth, forming teams or coalitions of multiple agents from different agencies is vital since no single agency will have all the resources needed to save victims, unblock roads, and extinguish the ?res which might erupt in the disaster space. Given this, coalitions have to be efficiently selected and scheduled to work across the disaster space so as to maximise the number of lives and the portion of the infrastructure saved. In particular, it is important that the selection of such coalitions should be performed in a decentralised fashion in order to avoid a single point of failure in the system. Moreover, it is critical that responders communicate only locally given they are likely to have limited battery power or minimal access to long range communication devices. Against this background, we provide a novel decentralised solution to the coalition formation process that pervades disaster management. More specifically, we model the emergency management scenario defined in the RoboCup Rescue disaster simulation platform as a Coalition Formation with Spatial and Temporal constraints (CFST) problem where agents form coalitions in order to complete tasks, each with different demands. In order to design a decentralised algorithm for CFST we formulate it as a Distributed Constraint Optimisation problem and show how to solve it using the state-of-the-art Max-Sum algorithm that provides a completely decentralised message-passing solution. We then provide a novel algorithm (F-Max-Sum) that avoids sending redundant messages and efficiently adapts to changes in the environment. In empirical evaluations, our algorithm is shown to generate better solutions than other decentralised algorithms used for this problem
- …