The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
When its human operator cannot continuously supervise (much less teleoperate) an agent, the agent should be able to recognize its limitations and ask for help when it risks making autonomous decisions that could significantly surprise and disappoint the operator. Inspired by previous research on making exploration-exploitation tradeoff decisions and on inverse reinforcement learning, we develop Expected...
In this paper we introduce an efficient path planning algorithm called SGInfiniteVI so the resulting path solution facilitates for robots the accomplishment of their tasks. The algorithm is based on the dynamic programming and deals with the problem of distributed equilibrium computation and selection in general-sum stochastic games with infinite horizon. Our approach proposes three Nash selection...
In the collaborative multi-agent systems where agents' goals are prioritized, an agent often needs to be more flexible in the pursuit of its own goals, for the sake of the higher priority goals of the others. In such situations, finding an optimal plan under the constraints imposed by the other agents' plans, is really an important area which needs more investigation. This work aims to fill this gap...
Auctions are well-studied mechanisms to solve decentralized resource allocation problems. In situations where complementarity exists among resources, combinatorial auctions may be utilized. Unfortunately, combinatorial auctions often incur hefty computational requirements, in that the underlying winner determination problem is known to be NP-hard. Although a number of efficient implementations are...
To reduce the loads imposed on network administrators, we have proposed AIR-NMS, which is a network management support system (NMS) based on Active Information Resource (AIR). In AIR-NMS, various information resources (e.g., state information of a network, practical knowledge of network management) are combined with software agents which have the knowledge and functions for supporting the utilization...
This paper is concerned with decentralized planning and scheduling where the information for decision making resides within local agents. When considering a decentralized approach, the goal is not primarily on achieving global optimality. For instance, [Greenstadt et al. 2006] studies the tradeoff in the Distributed Constraint Optimization (DCOP) problem on efficiency, privacy and optimality. In principle,...
Applying distributed constraint optimization problem (DCOP) solution techniques to domains such as service-oriented agent networks can violate key limiting assumptions behind standard DCOP formulations. We extend the multi-constrained (MC-) DCOP to model problems where each agent controls multiple variables, calling this multi-variable (MV-) MC-DCOP. The MV-MC-DCOP formulation abstracts away some...
In human-level simulations, like video games can be, the design of character's behaviors has an important impact on simulation realism. We propose to divide it into a reasoning part, dedicated to a planner, and an individuality part, assigned to an action selection mechanism. Applying the separation of declarative and procedural aspects, the principle is to provide every character's agent with the...
In the course of globalization competitive pressure is rising in most industrial sectors. High quality products are basic prerequisites for companies of high wage countries to be present on the global market. Improved adherence to delivery date, increased flexibility despite to decreased production costs are some examples of the challenges to be managed just to keep current positions. In general,...
The Distributed Agents For Autonomy (DAFA) study has been performed for ESA/ESTEC by SciSys UK Ltd, VEGA, and Politecnico di Milano in 2008-2009. The aim of DAFA study has been to examine the application of distributed agent technology to increase the overall performance of a space mission. It is important to note that the distribution should be seen on a system level, including both earth- and space-based...
To promote a healthy and effective development of E-government in China, problems obstacle the E-government development are analyzed from planning, system construction and application level, based on previous construction experience such as overlapping projects, image projects, extensive investment and high failure rate. Corresponding solutions are given at last.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.