Constructing an Autonomous Agent with an Interdependent Heuristics
نویسندگان
چکیده
When we construct an agent by integrating modules, there appear troubles concerning the autonomy of the agent if we introduce a heuristics that dominates the whole agent. Thus, we design an agent that has an interdependent heuristics influenced by a module controlled by the heuristics, and we apply these agents into a problem of obtaining cooperation of Multi-Agents. We enable a present method that can solve the problem in a reinforcement learning context to be applied into a dynamic environment, and the improved method is embodied into the agent as the interdependent heuristics. We conduct experiments comparing the proposed agents with agents such as those ones each of which has a heuristics controlled by a supervisor, then we empirically confirm that the proposed agent having the interdependent heuristics is the most flexible of all the tested agent.
منابع مشابه
Interdependent Defense Games with Applications to Internet Security at the Level of Autonomous Systems
We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under deliberate external attacks. Our model builds upon interdependent security (IDS) games, a model by Heal and Kunreuther that considers the source of the risk to be the result of a fixed randomized-strategy. We adapt IDS ...
متن کاملInterdependent Defense Games: Modeling Interdependent Security under Deliberate Attacks
We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under deliberate external attacks. Our model builds upon interdependent security (IDS) games, a model due to Heal and Kunreuther that considers the source of the risk to be the result of a fixed randomizedstrategy. We adapt I...
متن کاملHeuristic Approaches for Transmission Scheduling in Sensor Networks with Multiple Mobile Sinks
A large part of the energy budget of traditional sensor networks is consumed by the hop-by-hop routing of the collected information to the static sink. In many applications it is possible to replace the static sink with one or more mobile sinks that move in a sensor field and collect the data through one-hop transmissions.This greatly reduces the power consumption of the nodes, which can be fur...
متن کاملConstructing an Abalone Game-Playing Agent
This paper will deal with the complexity of the game Abalone and depending on this complexity, will explore techniques that are useful for constructing an Abalone game-playing agent. It turns out that the complexity of Abalone is comparable to the complexity of Xiangqi and Shogi. Further, some basic heuristics and possible extensions to these basic heuristics are described. With these extension...
متن کاملAutonomous Scheduling
We discuss the problem of enabling agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose the individual schedules always can be merged into a global schedule. Unlike the traditional approaches to distributed scheduling we do not enforce a schedule to every participating agent, but a set of additional constraints guaranteeing that every agent can choos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000