267 research outputs found
Service selection with qos correlations in distributed service-based systems
© 2013 IEEE. Service selection is an important research problem in distributed service-based systems, which aims to select proper services to meet user requirements. A number of service selection approaches have been proposed in recent years. Most of them, however, overlook quality-of-service (QoS) correlations, which broadly exist in distributed service-based systems. The concept of QoS correlations involves two aspects: 1) QoS correlations among services and 2) QoS correlations of user requirements. The first aspect means that some QoS attributes of service not only depend on the service itself but also have correlations with other services, e.g., buying service 1 and then getting service 2 with half price. The second aspect means the relationships among QoS attributes of user requirements, e.g., a user can accept a service with fast response time and high service cost or the user can also accept a service with slow response time and low service cost (Fig. 1). These correlations significantly affect user selection of services. Currently, only a few existing approaches have considered QoS correlations among services, i.e., the first aspect, but they still overlook QoS correlations of user requirements, i.e., the second aspect, which are also very important in distributed service-based systems. In this paper, a novel service selection approach is proposed, which not only considers QoS correlations of services but also accounts for QoS correlations of user requirements. This approach, to the best of our knowledge, is the first one which considers QoS correlations of user requirements. Also, this approach is decentralized which can avoid the single point of failure. The experimental results demonstrate the effectiveness of the proposed approach
Combinatorial Auction-based Mechanisms for Composite Web Service Selection
Composite service selection presents the opportunity for the rapid development of complex applications using existing web services. It refers to the problem of selecting a set of web services from a large pool of available candidates to logically compose them to achieve value-added composite services. The aim of service selection is to choose the best set of services based on the functional and non-functional (quality related) requirements of a composite service requester. The current service selection approaches mostly assume that web services are offered as single independent entities; there is no possibility for bundling. Moreover, the current research has mainly focused on solving the problem for a single composite service. There is a limited research to date on how the presence of multiple requests for composite services affects the performance of service selection approaches. Addressing these two aspects can significantly enhance the application of composite service selection approaches in the real-world. We develop new approaches for the composite web service selection problem by addressing both the bundling and multiple requests issues. In particular, we propose two mechanisms based on combinatorial auction models, where the provisioning of multiple services are auctioned simultaneously and service providers can bid to offer combinations of web services. We mapped these mechanisms to Integer Linear Programing models and conducted extensive simulations to evaluate them. The results of our experimentation show that bundling can lead to cost reductions compared to when services are offered independently. Moreover, the simultaneous consideration of a set of requests enhances the success rate of the mechanism in allocating services to requests. By considering all composite service requests at the same time, the mechanism achieves more homogenous prices which can be a determining factor for the service requester in choosing the best composite service selection mechanism to deploy
A Survey and Analysis of Multi-Robot Coordination
International audienceIn the field of mobile robotics, the study of multi-robot systems (MRSs) has grown significantly in size and importance in recent years. Having made great progress in the development of the basic problems concerning single-robot control, many researchers shifted their focus to the study of multi-robot coordination. This paper presents a systematic survey and analysis of the existing literature on coordination, especially in multiple mobile robot systems (MMRSs). A series of related problems have been reviewed, which include a communication mechanism, a planning strategy and a decision-making structure. A brief conclusion and further research perspectives are given at the end of the paper
Route planning methods for a modular warehouse system
In this study, procedures are presented that can be used to determine the routes of the packages transported within a modular storage system. The problem is a variant of robot motion planning problem. The structures of the procedures are developed in three steps for the simultaneous movement of multiple unit-sized packages in a modular warehouse. The proposed heuristic methods consist of route planning, tagging, and main control components. In order to demonstrate the solution performance of the methods, various experiments were conducted with different data sets and the solution times and qualities of the proposed methods were compared with previous studies. It was found that the proposed methods provide better solutions when taking the number of steps and solution time into consideration
Approximate algorithms for decentralized Supply Chain Formation
[eng] Supply chain formation involves determining the participants and the exchange of goods within a production network. Today’s companies operate autonomously, making local decisions, and coordinating with other companies to buy and sell goods along their supply chains. Decentralized decision making is well suited to this scenario since it better preserves the privacy of the participants, offers better scalability on large-scale scenarios, and is more resilient to failure. Moreover, decentralized supply chain formation can be tackled either by means of peer-to-peer communication between supply chain participants or by introducing local markets that mediate the trading of goods. Unfortunately, current approaches to decentralized supply chain formation, both in the peer- to-peer and the mediated scenario, are unable to provide computationally and economically efficient solutions to the supply chain formation problem. The main goal of this dissertation is to provide computationally and economically efficient methods for decentralized supply chain formation both in the peer-to-peer and the mediated scenario. This is achieved by means of two optimized max-sum based methods for supply chain formation. On the one hand, we contribute to peer-to-peer supply chain formation via the so-called Reduced Binarized Loopy Belief Propagation (rb-lbp) algorithm. The rb-lbp algorithm is run by a multi-agent system in which each of the participants in the supply chain is represented by a computational agent. Moreover, rb-lbp’s message computation mechanisms allow the efficient computation of max-sum messages. This results in an algorithm that is able to find solutions to the supply chain formation problem of higher value than the state of the art while reducing the memory, bandwidth and computational resources required by several orders of magnitude. On the other hand, we contribute to mediated supply chain formation via the so-called CHaining Agents IN Mediated Environments (chainme) algorithm. The chainme algorithm is run by a multi-agent system in which each of the participants and each of the goods in the supply chain is represented by a computational agent. In chainme participant agents communicate exclusively with the agents representing the goods who act as mediators. Likewise rb-lbp, chainme is also endowed with a message computation mechanism for the efficient computation of max-sum messages. This results in an algorithm that is able to find economically efficient solutions while requiring a fraction of the computa- tional resources needed by the state-of-the-art methods for both peer-to-peer and mediated supply chain formation. Finally, the design and implementation of both of our contributions to decentralized supply chain formation follow the same methodology. That is, we first map the problem at hand into a local term graph over which max-sum can operate. Then, we assign each max-sum local term to a computational agent. Last, we derive computationally efficient expressions to assess the max-sum messages exchanged between these agents. Although our methodology proved to be valid for the design of SCF algorithms, its generality makes it appear as a promising candidate for other multi-agent coordination problems
Peer-to-Peer Energy Trading in Smart Residential Environment with User Behavioral Modeling
Electric power systems are transforming from a centralized unidirectional market to a decentralized open market. With this shift, the end-users have the possibility to actively participate in local energy exchanges, with or without the involvement of the main grid. Rapidly reducing prices for Renewable Energy Technologies (RETs), supported by their ease of installation and operation, with the facilitation of Electric Vehicles (EV) and Smart Grid (SG) technologies to make bidirectional flow of energy possible, has contributed to this changing landscape in the distribution side of the traditional power grid.
Trading energy among users in a decentralized fashion has been referred to as Peer- to-Peer (P2P) Energy Trading, which has attracted significant attention from the research and industry communities in recent times. However, previous research has mostly focused on engineering aspects of P2P energy trading systems, often neglecting the central role of users in such systems. P2P trading mechanisms require active participation from users to decide factors such as selling prices, storing versus trading energy, and selection of energy sources among others. The complexity of these tasks, paired with the limited cognitive and time capabilities of human users, can result sub-optimal decisions or even abandonment of such systems if performance is not satisfactory. Therefore, it is of paramount importance for P2P energy trading systems to incorporate user behavioral modeling that captures users’ individual trading behaviors, preferences, and perceived utility in a realistic and accurate manner. Often, such user behavioral models are not known a priori in real-world settings, and therefore need to be learned online as the P2P system is operating.
In this thesis, we design novel algorithms for P2P energy trading. By exploiting a variety of statistical, algorithmic, machine learning, and behavioral economics tools, we propose solutions that are able to jointly optimize the system performance while taking into account and learning realistic model of user behavior. The results in this dissertation has been published in IEEE Transactions on Green Communications and Networking 2021, Proceedings of IEEE Global Communication Conference 2022, Proceedings of IEEE Conference on Pervasive Computing and Communications 2023 and ACM Transactions on Evolutionary Learning and Optimization 2023
Multi-Agent Systems
A multi-agent system (MAS) is a system composed of multiple interacting intelligent agents. Multi-agent systems can be used to solve problems which are difficult or impossible for an individual agent or monolithic system to solve. Agent systems are open and extensible systems that allow for the deployment of autonomous and proactive software components. Multi-agent systems have been brought up and used in several application domains
Recommended from our members
A feature-based comparison of the centralised versus market-based decision making under lens of environment uncertainty: Case of the mobile task allocation problem
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Decision making problems are amongst the most common challenges facing managers at different management levels in the organisation: strategic, tactical, and operational. However, prior reaching decisions at the operational level of the management hierarchy, operations management departments frequently have to deal with the optimisation process to evaluate the available decision alternatives. Industries with complex supply chain structures and service organisations that have to optimise the utilisation of their resources are examples. Conventionally, operational decisions used to be taken centrally by a decision making authority located at the top of a hierarchically-structured organisation. In order to take decisions, information related to the managed system and the affecting externalities (e.g. demand) should be globally available to the decision maker. The obtained information is then processed to reach the optimal decision. This approach usually makes extensive use of information systems (IS) containing myriad of optimisation algorithms and meta-heuristics to process the high amount and complex nature of data. The decisions reached are then broadcasted to the passive actuators of the system to put them in execution. On the other hand, recent advancements in information and communication technologies (ICT) made it possible to distribute the decision making rights and proved its applicability in several sectors. The market-based approach is as such a distributed decision making mechanism where passive actuators are delegated the rights of taking individual decisions matching their self-interests. The communication among the market agents is done through market transactions regulated by auctions. The system’s global optimisation, therefore, raise from the aggregated self-oriented market agents. As opposed to the centralised approach, the main characteristics of the market-based approach are the market mechanism and local knowledge of the agents.
The existence of both approaches attracted several studies to compare them in different contexts. Recently, some comparisons compared the centralised versus market-based approaches in the context of transportation applications from an algorithm perspective. Transportation applications and routing problems are assumed to be good candidates for this comparison given the distributed nature of the system and due to the presence of several sources of uncertainty. Uncertainty exceptions make decisions highly vulnerable and necessitating frequent corrective interventions to keep an efficient level of service. Motivated by the previous comparison studies, this research aims at further investigating the features of both approaches and to contrast them in the context of a distributed task allocation problem in light of environmental uncertainty. Similar applications are often faced by service industries with mobile workforce. Contrary to the previous comparison studies that sought to compare those approaches at the mechanism level, this research attempts to identify the effect of the most significant characteristics of each approach to face environmental uncertainty, which is reflected in this research by the arrival of dynamic tasks and the occurrence of stochasticity delays. To achieve the aim of this research, a target optimisation problem from the VRP family is proposed and solved with both approaches. Given that this research does not target proposing new algorithms, two basic solution mechanisms are adopted to compare the centralised and the market-based approach. The produced solutions are executed on a dedicated multi-agent simulation system. During execution dynamism and stochasticity are introduced.
The research findings suggest that a market-based approach is attractive to implement in highly uncertain environments when the degree of local knowledge and workers’ experience is high and when the system tends to be complex with large dimensions. It is also suggested that a centralised approach fits more in situations where uncertainty is lower and the decision maker is able to make timely decision updates, which is in turn regulated by the size of the system at hand
Decentralized and Dynamic Home Health Care Resource Scheduling Using an Agent-Based Model
The purpose of this thesis is to design an agent-based scheduling system, simulated in a dynamic environment that will reduce home healthcare service costs. The study focuses on situations where a health care agency needs to assign home visits among a group of independent healthcare practitioners. Each practitioner has different skill sets, time constraints, and cost structures, given the nature, time and location of each home visit. Each expects reasonable payment commensurate with their skill levels as well as the costs incurred. The healthcare agency in turn needs all planned visits performed by qualified practitioners while minimizing overall service costs. Decisions about scheduling are made both before and during the scheduling period, requiring the health care agency to respond to unexpected situations based on the latest scheduling information.
This problem is examined in a multi-agent system environment where practitioners are modeled as self-interested agents. The study first analyzes the problem for insights into the combinatorial nature of such a problem occurring in a centralized environment, then discusses the decentralized and dynamic challenges. An iterated bidding mechanism is designed as the negotiation protocol for the system. The effectiveness of this system is evaluated through a computational study, with results showing the proposed multi-agent scheduling system is able to compute high quality schedules in the decentralized home healthcare environment. Following this, the system is also implemented in a simulation model that can accommodate unexpected situations. We presents different simulation scenarios which illustrate the process of how the system dynamically schedules incoming visits, and cost reduction can be observed from the results
- …