Resource based plan revision in dynamic multi-agent environments

Download

index.pdf

Date

2004

Author

Erdoğdu, Utku

Metadata

Show full item record

Item Usage Stats

281
views

77
downloads

Planning framework is commonly used to represent intelligent agents effectively and to model complex behavior. In planning framework, resource-based perspective is interesting in the sense that in a multi-agent environment, exchange of resources can form a cooperative interaction. In resource based plan coordination, each agent constructs an individual plan, then plans are examined by a central plan revision unit for possibilities of removing actions. Domain of this work is the classical postmen domain that is also modifed to have non-sub-additive property.The domain is has numerous challenges that is not considered in the original plan coordination model. Moreover, the plan coordination algorithm is used in the re-planning phase, as the environment changes through plan execution.These issues are common for the realistic environments and the details of the original plan coordination perspective are renewed to cope with these issues.

Subject Keywords

Electronic computers., Computer science.

URI

http://etd.lib.metu.edu.tr/upload/12604721/index.pdf
https://hdl.handle.net/11511/14035

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Anomaly detection from personal usage patterns in web applications Vural, Gürkan; Yöndem (Turhan), Meltem; Department of Computer Engineering (2006) The anomaly detection task is to recognize the presence of an unusual (and potentially hazardous) state within the behaviors or activities of a computer user, system, or network with respect to some model of normal behavior which may be either hard-coded or learned from observation. An anomaly detection agent faces many learning problems including learning from streams of temporal data, learning from instances of a single class, and adaptation to a dynamically changing concept. The domain is complicated by ...
Abstraction in Reinforcement Learning Girgin, Serhat; Polat, Faruk; Department of Computer Engineering (2007) Reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment. Generally, the problem to be solved contains subtasks that repeat at different regions of the state space. Without any guidance an agent has to learn the solutions of all subtask instances independently, which degrades the learning performance. In this thesis, we propose two approaches to build connections between different regions of the search space leading to b...
Scheduling approaches for parameter sweep applications in a heterogeneous distributed environment Karaduman, Gülşah; Şener, Cevat; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010) In this thesis, the focus is on the development of scheduling algorithms for Sim-PETEK which is a framework for parallel and distributed execution of simulations. Since it is especially designed for running parameter sweep applications in a heterogeneous distributed computational environment, multi-round and adaptive scheduling approaches are followed. Five different scheduling algorithms are designed and evaluated for scheduling purposes of Sim-PETEK. Development of these algorithms are arranged in a way t...
Formation preserving navigation of agent teams in 3-d terrains Bayrak, Ali Galip; Polat, Faruk; Department of Computer Engineering (2008) Navigation of a group of autonomous agents that are needed to maintain a formation is a challenging task which has not been studied much in especially 3-D terrains. This thesis presents a novel approach to collision free path finding of multiple agents preserving a predefined formation in a 3-D terrain. The proposed method could be used in many areas like navigation of semi-automated forces (SAF) at unit level in military simulations and non player characters (NPC) in computer games. The proposed path findi...
Implementation of concurrent constraint transaction logic and its user interface Altunyuva, Fethi; Karagöz, Pınar; Department of Computer Engineering (2006) This thesis implements a logical formalism framework called Concurrent Constraint Transaction Logic (abbr.,CCTR) which was defined for modeling and scheduling of workflows under resource allocation and cost constraints and develops an extensible and flexible graphical user interface for the framework. CCTR extends Concurrent Transaction Logic and integrates with Constraint Logic Programming to find the correct scheduling of tasks that involves resource and cost constraints. The developed system, which integ...

Citation Formats

U. Erdoğdu, “Resource based plan revision in dynamic multi-agent environments,” M.S. - Master of Science, Middle East Technical University, 2004.