Autonomous Agents for Business Process Management

Traditional approaches to managing business processes are often inadequate for large-scale organisation-wide, dynamic settings. However, since Internet and Intranet technologies have become widespread, an increasing number of business processes exhibit these properties. Therefore, a new approach is needed. To this end, we describe the motivation, conceptualization, design, and implementation of a novel agent-based business process management system. The key advance of our system is that responsibility for enacting various components of the business process is delegated to a number of autonomous problem solving agents. To enact their role, these agents typically interact and negotiate with other agents in order to coordinate their actions and to buy in the services they require. This approach leads to a system that is significantly more agile and robust than its traditional counterparts. To help demonstrate these benefits, a companion paper describes the application of our system to a real-world problem faced by British Telecom

Spatio-Temporal Context in Agent-Based Meeting Scheduling

Meeting scheduling is a common task for organizations of all sizes. It involves searching for a time and place when and where all the participants can meet. However, scheduling a meeting is generally difficult in that it attempts to satisfy the preferences of all participants. Negotiation tends to be an iterative and time consuming task. Proxy agents can handle the negotiation on behalf of the individuals without sacrificing their privacy or overlooking their preferences. This thesis examines the implications of formalizing meeting scheduling as a spatiotemporal negotiation problem. The “Children in the Rectangular Forest” (CRF) canonical model is applied to meeting scheduling. By formalizing meeting scheduling within the CRF model, a generalized problem emerges that establishes a clear relationship with other spatiotemporal distributed scheduling problems. The thesis also examines the implications of the proposed formalization to meeting scheduling negotiations. A protocol for meeting location selection is presented and evaluated using simulations

Automated Negotiation for Provisioning Virtual Private Networks Using FIPA-Compliant Agents

This paper describes the design and implementation of negotiating agents for the task of provisioning virtual private networks. The agents and their interactions comply with the FIPA specification and they are implemented using the FIPA-OS agent framework. Particular attention is focused on the design and implementation of the negotiation algorithms

Multi Agent Systems in Logistics: A Literature and State-of-the-art Review

Based on a literature survey, we aim to answer our main question: “How should we plan and execute logistics in supply chains that aim to meet today’s requirements, and how can we support such planning and execution using IT?†Today’s requirements in supply chains include inter-organizational collaboration and more responsive and tailored supply to meet specific demand. Enterprise systems fall short in meeting these requirements The focus of planning and execution systems should move towards an inter-enterprise and event-driven mode. Inter-organizational systems may support planning going from supporting information exchange and henceforth enable synchronized planning within the organizations towards the capability to do network planning based on available information throughout the network. We provide a framework for planning systems, constituting a rich landscape of possible configurations, where the centralized and fully decentralized approaches are two extremes. We define and discuss agent based systems and in particular multi agent systems (MAS). We emphasize the issue of the role of MAS coordination architectures, and then explain that transportation is, next to production, an important domain in which MAS can and actually are applied. However, implementation is not widespread and some implementation issues are explored. In this manner, we conclude that planning problems in transportation have characteristics that comply with the specific capabilities of agent systems. In particular, these systems are capable to deal with inter-organizational and event-driven planning settings, hence meeting today’s requirements in supply chain planning and execution.supply chain;MAS;multi agent systems

Self-organisation of mobile robots in large structure assembly using multi-agent systems

Competition between manufacturers in large structure assembly (LSA) is driven by the need to improve the adaptability and versatility of their manufacturing systems. The lack of these qualities in the currently used systems is caused by the dedicated nature of their fixtures and jigs. This has led to their underutilisation and costly changeover procedures. In addition to that, modern automation systems tend to be dedicated to very specific tasks. This means that such systems are highly specialised and can reach obsolescence once there is a substantial change in production requirements. In this doctoral thesis, a dynamic system consisting of mobile robots is proposed to overcome those limitations. As a first knowledge contribution in this doctoral thesis, it is investigated under which conditions using mobile robots instead of the traditional, fixed automation systems in LSA can be advantageous. In this context, dynamic systems are expected to be more versatile and adaptive than fixed systems. Unlike traditional, dedicated automation systems, they are not constrained to gantry rails or fixed to the floor. This results in an expanded working envelope and consequently the ability to reach more workstations. Furthermore, if a product is large enough, the manufacturer can choose how many mobile robots to deploy around it. Accordingly, it was shown that the ability to balance work rates on products and consequently meet their due times is improved. For the second knowledge contribution, two fundamentally different decision-making models for controlling mobile agents in the complex scheduling problem are investigated. This is done to investigate ways of taking full advantage from the potential benefits of applying mobile robots. It is found that existing models from related academic literature are not suited for the given problem. Therefore, two new models had to be proposed for this purpose. It was plausible to use an agent-based approach for self-organisation. This is because similarly to agents, mobile robots can perform independently of one-another; and have limited perception and communication abilities. Finally, through a comparison study, scenarios are identified where either model is better to use. In agreement with much of the established literature in the field, the models are shown to exhibit the common advantages and disadvantages of their respective architecture types. Considering that the enabling technologies are nearing sufficient maturity for deploying mobile robots in LSA, it is concluded that this approach can have several advantages. Firstly, the granularity and freedom of movement enables much more control over product completion times. Secondly, the increased working envelope enables higher utilisation of manufacturing resources. In the context of LSA, this is a considerable challenge because products take a very long time to get loaded and unloaded from workstations. However, if the product flow is steady, there are rare disruptions and rare production changes, fixed automation systems have an advantage due to requiring much less time (if any) for moving and localising. Therefore, mobile systems become more preferred to fixed systems in environments where there is an increasing frequency of disruptions and changes in production requirements. The validation of agent-based self-organisation models for mobile robots in LSA confirms the expectations based on existing literature. Also, it reveals that with relatively low amounts of spare capacity (5%) in the manufacturing systems, there is little need for sophisticated models. The value of optimised models becomes apparent when spare capacity approaches 0% (or even negative values) and there is less room for inefficiencies in scheduling

Protocols for distributive scheduling

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning

Collaborative and adaptive supply chain planning

Dans le contexte industriel d'aujourd'hui, la compétitivité est fortement liée à la performance de la chaîne d'approvisionnement. En d'autres termes, il est essentiel que les unités d'affaires de la chaîne collaborent pour coordonner efficacement leurs activités de production, de façon a produire et livrer les produits à temps, à un coût raisonnable. Pour atteindre cet objectif, nous croyons qu'il est nécessaire que les entreprises adaptent leurs stratégies de planification, que nous appelons comportements, aux différentes situations auxquelles elles font face. En ayant une connaissance de l'impact de leurs comportements de planification sur la performance de la chaîne d'approvisionnement, les entreprises peuvent alors adapter leur comportement plutôt que d'utiliser toujours le même. Cette thèse de doctorat porte sur l'adaptation des comportements de planification des membres d'une même chaîne d'approvisionnement. Chaque membre pouvant choisir un comportement différent et toutes les combinaisons de ces comportements ayant potentiellement un impact sur la performance globale, il est difficile de connaître à l'avance l'ensemble des comportements à adopter pour améliorer cette performance. Il devient alors intéressant de simuler les différentes combinaisons de comportements dans différentes situations et d'évaluer les performances de chacun. Pour permettre l'utilisation de plusieurs comportements dans différentes situations, en utilisant la technologie à base d'agents, nous avons conçu un modèle d'agent à comportements multiples qui a la capacité d'adapter son comportement de planification selon la situation. Les agents planificateurs ont alors la possibilité de se coordonner de façon collaborative pour améliorer leur performance collective. En modélisant les unités d'affaires par des agents, nous avons simulé avec la plateforme de planification à base d'agents de FORAC des agents utilisant différents comportements de planification dits de réaction et de négociation. Cette plateforme, développée par le consortium de recherche FORAC de l'Université Laval, permet de simuler des décisions de planification et de planifier les opérations de la chaîne d'approvisionnement. Ces comportements de planification sont des métaheurisciques organisationnelles qui permettent aux agents de générer des plans de production différents. La simulation est basée sur un cas illustrant la chaîne d'approvisionnement de l'industrie du bois d'œuvre. Les résultats obtenus par l'utilisation de multiples comportements de réaction et de négociation montrent que les systèmes de planification avancée peuvent tirer avantage de disposer de plusieurs comportements de planification, en raIson du contexte dynamique des chaînes d'approvisionnement. La pertinence des résultats de cette thèse dépend de la prémisse que les entreprises qui adapteront leurs comportements de planification aux autres et à leur environnement auront un avantage concurrentiel important sur leurs adversaires

A multi-agent system with application in project scheduling

The new economic and social dynamics increase project complexity and makes scheduling problems more difficult, therefore scheduling requires more versatile solutions as Multi Agent Systems (MAS). In this paper the authors analyze the implementation of a Multi-Agent System (MAS) considering two scheduling problems: TCPSP (Time-Constrained Project Scheduling), and RCPSP (Resource-Constrained Project Scheduling). The authors propose an improved BDI (Beliefs, Desires, and Intentions) model and present the first the MAS implementation results in JADE platform.multi-agent architecture, scheduling, project management, BDI architecture, JADE.