Lectures. Lecture content. Lecture goals. TDDD10 AI Programming Agents and Agent Architectures Cyrille Berger
|
|
- Laureen Rosaline McKenzie
- 6 years ago
- Views:
Transcription
1 Lectures TDDD0 AI Programming Agents and Agent Architectures Cyrille Berger AI Programming: Introduction Introduction to RoboRescue Agents and Agents Architecture Communication Multiagent Decision Making Cooperation And Coordination Cooperation And Coordination Machine Learning 9 Knowledge Representation 0 Putting It All Together / Lecture goals Acquire knowledge on what is an agent. Acquire knowledge on what are the different agent architecture and how they take decision Lecture content Agents An Overview of Decision Making Agent Architectures Deliberative Architecture Reactive Architecture State Machines Hybrid Architecture Summary / /
2 What is an agent? Agents Agents are autonomous: capable of acting independently and exhibiting control over their internal state An agent is a (computer) system that is situated in some environment and that is capable of autonomous action in this environment in order to meet its delegated objectives. What is an agent? What is an agent? Should an agent be able to learn? Should an agent be intelligent?
3 Intelligent Agent Properties Reactivity Intelligent agents are able to perceive their environment, and respond in a timely fashion to changes that occur in it in order to meet its delegated objectives. Proactivity Intelligent agents are able to exhibit goal-directed behavior by taking the initiative in order to meet its delegated Social Ability Intelligent agents are capable of interacting (cooperating, coordinating and negotiating) with other agents (and possible humans) in order to meet its delegated objectives. Social Ability Cooperation is working together as a team to achieve a shared goal. Often prompted either by the fact that no one agent can achieve the goal alone, or that cooperation will obtain a better result (e.g., get result Coordination is managing the interdependencies between activities. Negotiation is the ability to reach agreements on matters of common interest. Typically involves offer and counter-offer, with compromises made by participants. 9 0 Agents as Intentional Systems Object Oriented Programming vs Multi-Agent System The philosopher Daniel Dennett coined the term intentional system to describe entities whose behaviour can be predicted by the method of attributing belief, desires and rational acumen. Is it legitimate or useful to attribute beliefs, desires, and so on, to computer systems? With very complex systems a mechanistic explanation of its behaviour may not be practical or available. But, the more we know about a system, the less we need to rely on animistic, intentional explanations of its behaviour. As computer systems become ever more complex, we need more powerful abstractions and metaphors to explain their operation low level explanations become impractical. The intentional stance is such an abstraction, which provide us with a convenient and familiar way of describing, explaining, and predicting the behaviour of complex systems. Object-Oriented Programming Objects are passive, i.e. an object has no control over method invocation Objects are designed for a common goal Typically integrated into a single thread Multi-Agent Systems Agents are autonomous, i.e. pro-active Agents can have diverging goals, e.g. coming from different organizations Agents have own thread of control
4 Agent-Oriented Programming Machine Language Structured Programming Object- Oriented Programming Structural unit Program Subroutine Object Agent Relation to previous level Bound unit of program Subroutine + persistent local state Agent-Oriented Programming Object + independent thread of control + initiative Agent Oriented Programming (Yoav Shoham) Based on the agent definition: An agent is an entity whose state is viewed as consisting of mental components such as beliefs, capabilities, choices, and commitments. The mental constructs will appear in the programming language itself. The semantics will be related to the semantics of the mental constructs. A computation will consist of agents performing speech-acts on each other. AGENT0 (/) AGENT0 is implemented in LISP Each agent in AGENT0 has components: a set of capabilities (things the agent can do) a set of initial beliefs a set of initial commitments (things the agent will do) a set of commitment rules The key component, which determines how the agent acts, is the commitment rule set AGENT0 (/) Each commitment rule contains a message condition a mental condition an action On each agent cycle... The message condition is matched against the messages the agent has received The mental condition is matched against the beliefs of the agent If the rule fires, then the agent becomes committed to the action (the action gets added to the agent s commitment set)
5 Example AGENT0 Rule One rule could be: if I receive a message from agent which requests me to do action at time, and I believe that: agent is currently a friend I can do the action At time, I am not committed to doing any other action then commit to doing action at time Example AGENT0 Rule COMMIT( ( agent, REQUEST, DO(time, action) ), ;;; msg condition ( B, [now, Friend agent] AND CAN(self, action) AND NOT [time, CMT(self, anyaction)] ), ;;; mental condition self, DO(time, action) ) An Overview of Decision Making Individual decision making Explicit decision making Decision trees Rules Automata Single agent task specification languages Decision theoretic decision making Markov Decision Processes (MDP) Partially Observable Markov Decision Processes (POMDP) Declarative (logic-based) decision making Theorem Proving Planning Constraint satisfaction 0
6 Multiagent decision making Explicit Mutual modeling Norms Organizations and Roles Multiagent task specification languages Decision theoretic Decentralized POMDPs (Dec-POMDP) Game theoretic Auctions Declarative Multiagent planning Distributed constraint satisfaction Agent Architectures Agent Architectures [A] particular methodology for building [agents]. It specifies how the agent can be decomposed into the construction of a set of component modules and how these modules should be made to interact. (P. Maes 99) Agent Architectures Three types: deliberative (symbolic/logical) reactive hybrid.
7 Deliberative Architecture Deliberative Architecture We define a deliberative (or reasoning) agent or agent architecture to be one that: contains an explicitly represented, symbolic model of the world and makes decisions via symbolic reasoning. Views agents as knowledge-based systems. We can say that a deliberative agent makes an action in three steps: Sense Plan Act Practical Reasoning Practical reasoning is a matter of weighing conflicting considerations for and against competing options, where the relevant considerations are provided by what the agent desires/values/cares about and what the agent believes. Bratman Practical Reasoning Human practical reasoning consists of two activities: deliberation - deciding what state of affairs we want to achieve; means-ends reasoning - deciding how to achieve these states of affairs. The output of deliberation is intentions.
8 Intentions (/) Agents need to determine ways of achieving intentions. If I have an intention to φ you would expect me to devote resources to deciding how to bring about Intentions provide a filter for adopting other intentions, which must not conflict. If I have an intention to φ, you would not expect me to adopt an intention ψ such φ and ψ are mutually exclusive. Intentions (/) Agents believe their intentions are possible. An agent believes there is at least some way that the intentions could be brought about. Agents do not believe they will not bring about their intentions. It would not be rational of me to adopt an intention to φ if I believed φ was not possible. 9 0 Intentions (/) Under certain circumstances, agents believe they will bring about their intentions. It would not normally be rational of me to believe that I would bring my intentions about; intentions can fail. Moreover, it does not make sense that if I believe φ is inevitable that I would adopt it as an intention. Agents track the success of their intentions, and are inclined to try again if their attempts fail. If an agent's first attempt to achieve φ fails, then all other things being equal, it will try an alternative plan to achieve φ. Intentions (/) Agents need not intend all the expected side effects of their intentions. If I believe φ ψ and I intend that φ, I do not necessarily intend ψ also. (Intentions are not closed under implication.) This last problem is known as the side effect or package deal problem. I may believe that going to the dentist involves pain, and I may also intend to go to the dentist - but this does not imply that I intend to suffer pain!
9 Intentions - Summary Intentions drive means-ends reasoning Intentions persist Intentions constrain future deliberation Intentions influence beliefs upon which future practical reasoning is based Means-Ends Reasoning Given: a representation of goal/intention to achieve a representation of actions it can perform a representation of the environment generate a plan to achieve the goal. Agent Control Loop Version Deliberation (/) while true observe the update internal world deliberate about what intentions to achieve next use means-ends reasoning to get a plan for the intention execute the while true do get next percept p; I := deliberate(b); P := plan(b,i); execute(p); How does an agent deliberate? begin by trying to understand what the options available to you are choose between them, and commit to some. Chosen options are then intentions.
10 Deliberation (/) Agent Control Loop Version The deliberate function can be decomposed into two distinct functional components: option generation in which the agent generates a set of possible alternatives represent option generation via a function, options, which takes the agent s current beliefs and current intentions, and from them determines a set of options (= desires). filtering in which the agent chooses between competing alternatives, and commits to achieving them. In order to select between competing options, an agent uses a filter function. while true do get next percept p; I := deliberate(b); P := plan(b,i); execute(p); while true do get next percept p; D := options(b,i); I := filter(b,d,i); P := plan(b,i); execute(p); Example of Logic Based Agent (/) Cleaning robot with: Percepts p = {dirt, X, Y} Actions A = {turnright, forward, suck...} Start: (0,0,North) Goal: searching and cleaning dirt Example of Logic Based Agent (/) Beliefs B are: {dirt, 0, } {dirt,, } {pos, 0, 0, East} Options D: {clean, 0, } {clean,, } 9 0
11 Example of Logic Based Agent (/) After filtering the intention is: {clean, 0, } Plan P: {turnright, forward, forward, suck} Commitment Strategies Blind commitment a blindly committed agent will continue to maintain an intention until it believes the intention has actually been achieved. Blind commitment is also sometimes referred to as fanatical commitment. Single-minded commitment a single-minded agent will continue to maintain an intention until it believes that either the intention has been achieved, or else that it is no longer possible to achieve the intention. Open-minded commitment an open-minded agent will maintain an intention as long as it is still believed possible. Commitment Agent Control Loop Version An agent has commitment both to ends (i.e. of wishes to bring about), and means (i.e., the mechanism via which the agent wishes to achieve the state of affairs). Currently, our agent control loop is overcommitted, both to means and ends. Modification: replan if ever a plan goes wrong. while true do get next percept p; D := options(b,i); I := filter(b,d,i); P := plan(b,i); execute(p); while true do get next percept B := D := I := while not empty(p) do a := first(p); execute(a); P := rest(p); 9 0 if not sound(p,b,i) then P := plan(b,i);
12 Commitment Agent Control Loop Version Still overcommitted to intentions: never stops to consider whether or not its intentions are appropriate. Modification: stop to determine whether intentions have succeeded or whether they are impossible (singleminded commitment). while true do D := options(b,i); I := filter(b,d,i); while not empty(p) do a := first(p); execute(a); P := rest(p); 9 0 if not sound(p,b,i) then P := plan(b,i); while true do D := options(b,i); I := filter(b,d,i); while not empty(p)or succeeded(b,i) or impossible(b,i) do a := first(p); execute(a); P := rest(p); 9 0 if not sound(p,b,i) then P := plan(b,i); ; Intention Reconsideration Agent Control Loop Version Our agent gets to reconsider its intentions once every time around the outer control loop, i.e., when: it has completely executed a plan to achieve its current intentions; or it believes it has achieved its current intentions; or it believes its current intentions are no longer possible. This is limited in the way that it permits an agent to reconsider its intentions. Modification: Reconsider intentions after executing every action. while true do D := options(b,i); I := filter(b,d,i); while not empty(p) or succeeded(b,i) or impossible(b,i) do a := first(p); execute(a); P := rest(p); 9 0 if not sound(p,b,i) then P := plan(b,i); ; while true do D := options(b,i); I := filter(b,d,i); while not empty(p) or succeeded(b,i) or impossible(b,i)</font> do a := first(p); execute(a); P := rest(p); 9 0 D := options(b,i); I := filter(b,d,i); if not sound(p,b,i) then P := plan(b,i); ;
13 Intention Reconsideration Agent Control Loop Version But intention reconsideration is costly! A dilemma: an agent that does not stop to reconsider its intentions sufficiently often will continue attempting to achieve its intentions even after it is clear that they cannot be achieved, or that there is no longer any reason for achieving them; an agent that constantly reconsiders its intentions may spend insufficient time actually working to achieve them, and hence runs the risk of never actually achieving them. Solution: incorporate an explicit meta-level control component, that decides whether or not to reconsider. while true do D := options(b,i); I := filter(b,d,i); while not empty(p) or succeeded(b,i) or impossible(b,i) do a := first(p); execute(a); P := rest(p); 9 0 D := options(b,i); I := filter(b,d,i); if not sound(p,b,i) then P := plan(b,i); ; while true do D := options(b,i); I := filter(b,d,i); while not empty(p) or succeeded(b,i) or impossible(b,i)</font> do a := first(p); execute(a); P := rest(p); 9 0 if reconsider(b,i) then D := options(b,i); I := filter(b,d,i); if not sound(p,b,i) then P := plan(b,i); 9 0 Optimal Intention Reconsideration Kinny and Georgeff's experimentally investigated effectiveness of intention reconsideration strategies. Two different types of reconsideration strategy were used: bold agents never pause to reconsider intentions, and cautious agents stop to reconsider after every action. Dynamism in the environment is represented by the rate of world change, ɣ. Kinny and Georgeff's Results If ɣ is low (i.e., the environment does not change quickly), then bold agents do well compared to cautious ones. This is because cautious ones waste time reconsidering their commitments while bold agents are busy working towards - and achieving - their intentions. If ɣ is high (i.e., the environment changes frequently), then cautious agents tend to outperform bold agents. This is because they are able to recognize when intentions are doomed, and also to take advantage of serendipitous situations and new opportunities when they arise.
14 The representation/reasoning problem How to symbolically represent information about complex real-world entities and processes. How to translate the perceived world into an accurate, adequate symbolic description, in time for that description to be useful vision, speech recognition, learning. How to get agents to reason with this information in time for the results to be useful knowledge representation, automated reasoning, planning. During computation, the dynamic world might change and thus the solution not valid anymore! How to represent temporal information, e.g., how a situation changes over time? Critizism of Symbolic AI There are many unsolved problems associated with symbolic AI. Most of what people do in their day to day lives is not problem-solving or planning, but rather it is routine activity in a relatively benign, but certainly dynamic, world. (Brooks, 99) These problems have led some researchers to question the viability of the whole paradigm, and to the development of reactive architectures. Although united by a belief that the assumptions underpinning mainstream AI are in some sense wrong, reactive agent researchers use many different techniques. Brooks' Design Criterias Reactive Architecture An agent must cope appropriately and in a timely fashion with changes in its environment. An agent should be robust with respect to its environment. An agent should be able to maintain multiple goals and switch between them. An agent should do something, it should have some purpose in being.
15 Brooks - Behaviour Languages Brooks has put forward three theses: Intelligent behaviour can be generated without explicit representations of the kind that symbolic AI proposes. Intelligent behaviour can be generated without explicit abstract reasoning of the kind that symbolic AI proposes. Intelligence is an emergent property of certain complex systems. Brooks - Key Ideas Situatedness and embodiment: The world is its own best model and it gives the agent a firm ground for its reasoning. Intelligence and emergence: Intelligent behaviour arises as a result of an agent's interaction with its environment. Also, intelligence is in the eye of the beholder ; it is not an innate, isolated property. The Subsumption Architecture (/) To illustrate his ideas, Brooks built some robots based on his subsumption architecture. A subsumption architecture is a hierarchy of task-accomplishing behaviours. Each behaviour is a rather simple rule-like structure. Each behaviour competes with others to exercise control over the agent. The Subsumption Architecture Traditional decomposition into functional modules: Decomposition based on task achieving behaviors: 9 0
16 The Subsumption Architecture The Subsumption Architecture Lower layers represent more primitive kinds of behaviour, (such as avoiding obstacles), and have precedence over layers further up the hierarchy. The resulting systems are, in terms of the amount of computation they do, extremely simple. Some of the robots do tasks that would be impressive if they were accomplished by symbolic AI systems. Example of Reactive Architecture State Machines
17 Finite State Machines Example: light switch It is a machine that is in one state among a finite number of states A finite state machine is defined by A finite number of states S A finite number of transitions T between states An initial state s₀ S The current state s S Example: ambulance Benefits and drawbacks Benefits: Simple Predictable Flexible Fast Verifiable / Provable Drawbacks: Complexity increase faster than the number of states and transitions
18 State charts FSM Calculator Extend Finite State-Machines: Hierarchical states Concurent States Data flow 9 0 State Chart Calculator Advantages Of Reactive Systems Simplicity, i.e. modules have high expressiveness Computational tractability Robustness against failure, i.e. possibility of modeling redundancies Overall behavior emerges from interactions
19 Problems With Reactive Systems The local environment must contain enough information to make a decision. Hard to take non-local information into account. Behavior emerges from interactions How to engineer the system in the general case? How to model long-term decisions? How to implemented varying goals? Hard to engineer, especially large systems with many layers that interacts. Hybrid Architecture Hybrid Architecture A hybrid system is neither a completely deliberative nor completely reactive approach. An obvious approach is to build an agent out of two (or more) subsystems: a deliberative one, containing a symbolic world model, which develops plans and makes decisions in the way proposed by symbolic AI; and a reactive one, which is capable of reacting to events without complex reasoning. Often, the reactive component is given some kind of precedence over the deliberative one. This kind of structuring leads naturally to the idea of a layered architecture. Hybrid Architecture In a layered architecture, an agent's control subsystems are arranged into a hierarchy, with higher layers dealing with information at increasing levels of abstraction. A key problem in layered architectures is what kind of control framework to embed the agent's subsystems in, to manage the interactions between the various layers. Horizontal layering - Layers are each directly connected to the sensory input and action output. In effect, each layer itself acts like an agent, producing suggestions as to what action to perform. Vertical layering - Sensory input and action output are each dealt with by at most one layer each.
20 Hybrid Architecture Hybrid Architecture Agent Architectures Summary Summary Originally (9-9), pretty much all agents designed within AI were symbolic reasoning agents Its purest expression proposes that agents use explicit logical reasoning in order to decide what to do Problems with symbolic reasoning led to a reaction against this the so-called reactive agents movement, 9 present From 990-present, a number of alternatives proposed: hybrid architectures, which attempt to combine the best of reasoning and reactive architectures 0
21 Deliberative Architectures Properties Internal state (using symbolic representation) Search-based decision making Goal directed Benefits Nice and clear (logics) semantics Easy to analyze by proving properties Problems Can t react in a timely manner to events that requires immediate actions. Intractable algorithms. Hard to create a symbolic representation from continuous sensor data. The anchoring problem. Reactive Agent Architectures Properties No explicit world model Rule-based decision making Benefits Efficient Robust Problems The local environment must contain enough information to make a decision. Easy to build small agents, hard to build agents with many behaviors or rules. Emergent behavior. Hybrid Agent Architectures Properties Tries to combine the good parts of both reactive and deliberative architectures. Usually layered architectures. Benefits Attacks the problem on different abstraction levels. Has the benefits of both architecture types. Problems Hard do combine the different parts.
CHAPTER 3: DEDUCTIVE REASONING AGENTS. An Introduction to Multiagent Systems. mjw/pubs/imas/
CHAPTER 3: DEDUCTIVE REASONING AGENTS An Introduction to Multiagent Systems http://www.csc.liv.ac.uk/ mjw/pubs/imas/ Agent Architectures An agent architecture is a software design for an agent. We have
More informationLECTURE 4: DEDUCTIVE REASONING AGENTS. An Introduction to Multiagent Systems CIS 716.5, Spring 2006
LECTURE 4: DEDUCTIVE REASONING AGENTS CIS 716.5, Spring 2006 1 Agent Architectures Pattie Maes (1991): [A] particular methodology for building [agents]. It specifies how... the agent can be decomposed
More informationCOMP310 MultiAgent Systems. Chapter 3 - Deductive Reasoning Agents
COMP310 MultiAgent Systems Chapter 3 - Deductive Reasoning Agents Agent Architectures Pattie Maes (1991):... [A] particular methodology for building [agents]. It specifies how... the agent can be decomposed
More informationLECTURE 4: PRACTICAL REASONING AGENTS. An Introduction to Multiagent Systems CIS 716.5, Spring 2010
LECTURE 4: PRACTICAL REASONING AGENTS CIS 716.5, Spring 2010 What is Practical Reasoning? Practical reasoning is reasoning directed towards actions the process of figuring out what to do: Practical reasoning
More informationReactive and Hybrid Agents. Based on An Introduction to MultiAgent Systems and slides by Michael Wooldridge
Reactive and Hybrid Agents Based on An Introduction to MultiAgent Systems and slides by Michael Wooldridge Reactive Architectures Problems with symbolic/logical approaches (transduction, computational
More informationCOMP310 Multi-Agent Systems Chapter 4 - Practical Reasoning Agents. Dr Terry R. Payne Department of Computer Science
COMP310 Multi-Agent Systems Chapter 4 - Practical Reasoning Agents Dr Terry R. Payne Department of Computer Science Pro-Active Behaviour Previously we looked at: Characteristics of an Agent and its Environment
More informationICS 606. Intelligent Autonomous Agents 1
Intelligent utonomous gents ICS 606 / EE 606 Fall 2011 Nancy E. Reed nreed@hawaii.edu Lecture #4 Practical Reasoning gents Intentions Planning Means-ends reasoning The blocks world References Wooldridge
More informationLECTURE 2: INTELLIGENT AGENTS. An Introduction to Multiagent Systems CIS 716.5, Spring 2005
LECTURE 2: INTELLIGENT AGENTS CIS 716.5, Spring 2005 1 What is an Agent? The main point about agents is they are autonomous: capable of acting independently, exhibiting control over their internal state.
More informationLECTURE 3: DEDUCTIVE REASONING AGENTS
Agent Architectures LECTURE 3: DEDUCTIVE REASONING AGENTS An Introduction to MultiAgent Systems http://www.csc.liv.ac.uk/~mjw/pubs/imas An agent is a computer system capable of flexible autonomous action
More informationSoftware Architecture. Lecture 4
Software Architecture Lecture 4 Last time We discussed tactics to achieve architecture qualities We briefly surveyed architectural styles 23-Jan-08 http://www.users.abo.fi/lpetre/sa08/ 2 Today We check
More informationMAY 2009 EXAMINATIONS. Multiagent Systems
COMP310 DEPARTMENT : Computer Science Tel. No. 7790 MAY 2009 EXAMINATIONS Multiagent Systems TIME ALLOWED : Two and a Half hours INSTRUCTIONS TO CANDIDATES Answer four questions. If you attempt to answer
More informationAgent Architectures & Languages. Heikki Helin
Agent Architectures & Languages Heikki Helin Agent Architectures Introduction Different architectures Deliberative approach Reactive approach Hybrid approach Agent Architectures Definition Maes: An architecture
More information1.1 Jadex - Engineering Goal-Oriented Agents
1.1 Jadex - Engineering Goal-Oriented Agents In previous sections of the book agents have been considered as software artifacts that differ from objects mainly in their capability to autonomously execute
More informationIntroduction to Intelligent Agents
Introduction to Intelligent Agents Pınar Yolum p.yolum@uu.nl Utrecht University Course Information Jointly taught with Mehdi Dastani Topics Work Schedule Grading Resources Academic Integrity Spring 2018
More informationAgent-Oriented Software Engineering
Agent-Oriented Software Engineering Lin Zuoquan Information Science Department Peking University lz@is.pku.edu.cn http://www.is.pku.edu.cn/~lz/teaching/stm/saswws.html Outline Introduction AOSE Agent-oriented
More informationChapter 2 Overview of the Design Methodology
Chapter 2 Overview of the Design Methodology This chapter presents an overview of the design methodology which is developed in this thesis, by identifying global abstraction levels at which a distributed
More informationThe following are just some of the many possible definitions that can be written:
2.1 Define in your own words the following terms: agent, agent function, agent program, rationality, autonomy, reflex agent, model-based agent, goal-based agent, utility-based agent, learning agent. The
More informationPlexil-Like Plan Execution Control in Agent Programming
AI and Robotics: Papers from the AAAI-14 Workshop Plexil-Like Plan Execution Control in Agent Programming Pouyan Ziafati SnT, University of Luxembourg Intelligent Systems Group, Utrecht University Abstract
More informationAgent-Oriented Programming
Agent-Oriented Programming Marco Alberti Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa Multi-Agent Systems, 2010/2011 Marco Alberti Agent-Oriented Programming MAS, 2010/2011 1 / 50 Outline
More informationLecture 18: Planning and plan execution, applications
Lecture 18: Planning and plan execution, applications Planning, plan execution, replanning Planner as a part of an autonomous robot: robot architectures The subsumption architecture The 3-tier architecture:
More informationSoftware Architecture--Continued. Another Software Architecture Example
Software Architecture--Continued References for Software Architecture examples: Software Architecture, Perspectives on an Emerging Discipline, by Mary Shaw and David Garlin, Prentice Hall, 1996. B. Hayes-Roth,
More informationObject-Oriented Programming and Laboratory of Simulation Development
Object-Oriented Programming and Laboratory of Simulation Development Marco Valente LEM, Pisa and University of L Aquila January, 2008 Outline Goal: show major features of LSD and their methodological motivations
More informationCSCI 445 Amin Atrash. Control Architectures. Introduction to Robotics L. Itti, M. J. Mataric
Introduction to Robotics CSCI 445 Amin Atrash Control Architectures The Story So Far Definitions and history Locomotion and manipulation Sensors and actuators Control => Essential building blocks Today
More informationIncremental development A.Y. 2018/2019
Incremental development A.Y. 2018/2019 Incremental development Interleaves the activities of specification, development, and validation. The system is developed as a series of versions (increments), with
More informationPART 1 GRAPHICAL STRUCTURE
PART 1 GRAPHICAL STRUCTURE in this web service in this web service 1 Treewidth and Hypertree Width Georg Gottlob, Gianluigi Greco, Francesco Scarcello This chapter covers methods for identifying islands
More informationAutonomous Vehicles:
Autonomous Vehicles: Research, Design and Implementation of Autonomous Vehicles Research Group - GPVA http://www.eletrica.unisinos.br/~autonom Tutorial page: http://inf.unisinos.br/~osorio/palestras/cerma07.html
More informationAutonomous Vehicles:
Autonomous Vehicles: Research, Design and Implementation of Autonomous Vehicles Research Group - GPVA http://www.eletrica.unisinos.br/~autonom Tutorial page: http://inf.unisinos.br/~osorio/palestras/cerma07.html
More informationRobotics. CSPP Artificial Intelligence March 10, 2004
Robotics CSPP 56553 Artificial Intelligence March 10, 2004 Roadmap Robotics is AI-complete Integration of many AI techniques Classic AI Search in configuration space (Ultra) Modern AI Subsumption architecture
More informationMobile Robots: An Introduction.
Mobile Robots: An Introduction Amirkabir University of Technology Computer Engineering & Information Technology Department http://ce.aut.ac.ir/~shiry/lecture/robotics-2004/robotics04.html Introduction
More informationCOMPARING AGENT ORIENTED PROGRAMMING VERSUS OBJECT- ORIENTED PROGRAMMING
COMPARING AGENT ORIENTED PROGRAMMING VERSUS OBJECT- ORIENTED PROGRAMMING Rula K.Al-Azawi Gulf College affiliated with Staffordshire University-UK Muscat/Oman E-mail: rulaalazzawi@yahoo.com Aladdin Ayesh
More informationConcurrency, Mutual Exclusion and Synchronization C H A P T E R 5
Concurrency, Mutual Exclusion and Synchronization C H A P T E R 5 Multiple Processes OS design is concerned with the management of processes and threads: Multiprogramming Multiprocessing Distributed processing
More informationProgramming Cognitive Agents in Goal. Draft. c Koen V. Hindriks
Programming Cognitive Agents in Goal Draft c Koen V. Hindriks March 2, 2014 2 Contents Preface 7 1 Getting Started with GOAL 9 1.1 A Hello World Agent................................. 9 1.2 Creating a
More informationA multi-threaded architecture for cognitive robotics. Keith Clark Imperial College London
A multi-threaded architecture for cognitive robotics Keith Clark Imperial College London Overview of talk Nilsson s Teleo-Reactive (TR) Procedures Simulation demo of TR controlled can collecting robot
More informationDialogue systems. Volha Petukhova Saarland University
Dialogue systems Volha Petukhova Saarland University 20/07/2016 Einführung in Diskurs and Pragmatik, Sommersemester 2016 Introduction Multimodal natural-language based dialogue as humanmachine interface
More informationFrom Objects to Agents: The Java Agent Middleware (JAM)
From Objects to Agents: The Java Agent Middleware (JAM) Laboratory of Multiagent Systems LM Laboratorio di Sistemi Multiagente LM Elena Nardini elena.nardini@unibo.it Ingegneria Due Alma Mater Studiorum
More informationBridges To Computing
Bridges To Computing General Information: This document was created for use in the "Bridges to Computing" project of Brooklyn College. You are invited and encouraged to use this presentation to promote
More informationVerification of Multiple Agent Knowledge-based Systems
Verification of Multiple Agent Knowledge-based Systems From: AAAI Technical Report WS-97-01. Compilation copyright 1997, AAAI (www.aaai.org). All rights reserved. Daniel E. O Leary University of Southern
More informationProfiling and optimization for Android applications on the tatami platform
Profiling and optimization for Android applications on the tatami platform Understanding the tatami Platform and the S-CLAIM Language Jaber Hassoun Advisor: S. l. dr. ing. Andrei Olaru University "Politehnica"
More informationCHAPTER 16: ARGUING Multiagent Systems. mjw/pubs/imas/
CHAPTER 16: ARGUING Multiagent Systems http://www.csc.liv.ac.uk/ mjw/pubs/imas/ Argumentation Argumentation is the process of attempting to agree about what to believe. Only a question when information
More informationCognitive Walkthrough. Francesca Rizzo 24 novembre 2004
Cognitive Walkthrough Francesca Rizzo 24 novembre 2004 The cognitive walkthrough It is a task-based inspection method widely adopted in evaluating user interfaces It requires: A low-fi prototype of the
More informationISO/IEC/ IEEE INTERNATIONAL STANDARD. Systems and software engineering Architecture description
INTERNATIONAL STANDARD ISO/IEC/ IEEE 42010 First edition 2011-12-01 Systems and software engineering Architecture description Ingénierie des systèmes et des logiciels Description de l'architecture Reference
More informationMinsoo Ryu. College of Information and Communications Hanyang University.
Software Reuse and Component-Based Software Engineering Minsoo Ryu College of Information and Communications Hanyang University msryu@hanyang.ac.kr Software Reuse Contents Components CBSE (Component-Based
More informationMobile robots control architectures
1 Mobile robots control architectures Dimitri Popov Universität Hamburg Fakultät für Mathematik, Informatik und Naturwissenschaften Department Informatik Integriertes Seminar Intelligent Robotics 10 1.
More informationChapter 5 INTRODUCTION TO MOBILE AGENT
Chapter 5 INTRODUCTION TO MOBILE AGENT 135 Chapter 5 Introductions to Mobile Agent 5.1 Mobile agents What is an agent? In fact a software program is containing an intelligence to help users and take action
More informationSOME TYPES AND USES OF DATA MODELS
3 SOME TYPES AND USES OF DATA MODELS CHAPTER OUTLINE 3.1 Different Types of Data Models 23 3.1.1 Physical Data Model 24 3.1.2 Logical Data Model 24 3.1.3 Conceptual Data Model 25 3.1.4 Canonical Data Model
More informationDublin Bogtrotters : agent herders
Provided by the author(s) and University College Dublin Library in accordance with publisher policies. Please cite the published version when available. Title Dublin Bogtrotters : agent herders Author(s)
More informationBrowsing the World in the Sensors Continuum. Franco Zambonelli. Motivations. all our everyday objects all our everyday environments
Browsing the World in the Sensors Continuum Agents and Franco Zambonelli Agents and Motivations Agents and n Computer-based systems and sensors will be soon embedded in everywhere all our everyday objects
More informationA MULTI-ROBOT SYSTEM FOR ASSEMBLY TASKS IN AUTOMOTIVE INDUSTRY
The 4th International Conference Computational Mechanics and Virtual Engineering COMEC 2011 20-22 OCTOBER 2011, Brasov, Romania A MULTI-ROBOT SYSTEM FOR ASSEMBLY TASKS IN AUTOMOTIVE INDUSTRY A. Fratu 1
More informationModeling and Simulating Social Systems with MATLAB
Modeling and Simulating Social Systems with MATLAB Lecture 7 Game Theory / Agent-Based Modeling Stefano Balietti, Olivia Woolley, Lloyd Sanders, Dirk Helbing Computational Social Science ETH Zürich 02-11-2015
More informationTHINGS YOU NEED TO KNOW ABOUT USER DOCUMENTATION DOCUMENTATION BEST PRACTICES
5 THINGS YOU NEED TO KNOW ABOUT USER DOCUMENTATION DOCUMENTATION BEST PRACTICES THIS E-BOOK IS DIVIDED INTO 5 PARTS: 1. WHY YOU NEED TO KNOW YOUR READER 2. A USER MANUAL OR A USER GUIDE WHAT S THE DIFFERENCE?
More informationB. H. Gardi College of Engineering & Technology, RAJKOT Department of Master of Computer Application. MCA Lecturer At GARDI VIDYAPITH RAJKOT.
Prepared By :- Mr. Ajay A. Ardeshana MCA Lecturer At GARDI VIDYAPITH RAJKOT. Email :- ajay.24021985@gmail.com Mobile :- + 91 95588 20298 Chap5er - 6 SYSTEM ENGINEERING (SSAD SSAD) Mobile : 9558820298 1
More informationInternational Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.7, No.3, May Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani
LINK MINING PROCESS Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani Higher Colleges of Technology, United Arab Emirates ABSTRACT Many data mining and knowledge discovery methodologies and process models
More informationProblem Solving Agents Solving Problems through Search CIS 32
Problem Solving Agents Solving Problems through Search CIS 32 Today: Behavior Based AI Functionally Next Class - In 2 Wednesdays (Could Meet on Tuesday Next Week) No Thursday Office Hours (any more) -
More informationDistributed Systems Programming (F21DS1) Formal Verification
Distributed Systems Programming (F21DS1) Formal Verification Andrew Ireland Department of Computer Science School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh Overview Focus on
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 38 A Tutorial on Network Protocols
More informationComplexity. Object Orientated Analysis and Design. Benjamin Kenwright
Complexity Object Orientated Analysis and Design Benjamin Kenwright Outline Review Object Orientated Programming Concepts (e.g., encapsulation, data abstraction,..) What do we mean by Complexity? How do
More informationChapter 3. Design of Grid Scheduler. 3.1 Introduction
Chapter 3 Design of Grid Scheduler The scheduler component of the grid is responsible to prepare the job ques for grid resources. The research in design of grid schedulers has given various topologies
More informationCONCLUSIONS AND RECOMMENDATIONS
Chapter 4 CONCLUSIONS AND RECOMMENDATIONS UNDP and the Special Unit have considerable experience in South-South cooperation and are well positioned to play a more active and effective role in supporting
More informationAgent Oriented Software Engineering. Michael Winikoff and Lin Padgham
Agent Oriented Software Engineering Michael Winikoff and Lin Padgham Chapter 15 of Multiagent Systems Edited by Gerhard Weiss MIT Press, 2012 http://www.the-mas-book.info/ Introduction Agent Oriented Software
More informationTERMINOLOGY MANAGEMENT DURING TRANSLATION PROJECTS: PROFESSIONAL TESTIMONY
LINGUACULTURE, 1, 2010 TERMINOLOGY MANAGEMENT DURING TRANSLATION PROJECTS: PROFESSIONAL TESTIMONY Nancy Matis Abstract This article briefly presents an overview of the author's experience regarding the
More informationLocalization and Map Building
Localization and Map Building Noise and aliasing; odometric position estimation To localize or not to localize Belief representation Map representation Probabilistic map-based localization Other examples
More informationCybersecurity. Quality. security LED-Modul. basis. Comments by the electrical industry on the EU Cybersecurity Act. manufacturer s declaration
Statement Comments by the electrical industry on the EU Cybersecurity Act manufacturer s declaration industrial security Cybersecurity Quality basis security LED-Modul Statement P January 2018 German Electrical
More informationBest practices in IT security co-management
Best practices in IT security co-management How to leverage a meaningful security partnership to advance business goals Whitepaper Make Security Possible Table of Contents The rise of co-management...3
More information5/9/2014. Recall the design process. Lecture 1. Establishing the overall structureof a software system. Topics covered
Topics covered Chapter 6 Architectural Design Architectural design decisions Architectural views Architectural patterns Application architectures Lecture 1 1 2 Software architecture The design process
More informationTriadic Formal Concept Analysis within Multi Agent Systems
Triadic Formal Concept Analysis within Multi Agent Systems Petr Gajdoš, Pavel Děrgel Department of Computer Science, VŠB - Technical University of Ostrava, tř. 17. listopadu 15, 708 33 Ostrava-Poruba Czech
More informationCONTRIBUTION TO THE INVESTIGATION OF STOPPING SIGHT DISTANCE IN THREE-DIMENSIONAL SPACE
National Technical University of Athens School of Civil Engineering Department of Transportation Planning and Engineering Doctoral Dissertation CONTRIBUTION TO THE INVESTIGATION OF STOPPING SIGHT DISTANCE
More informationConsidering a Services Approach for Data Quality
Solutions for Customer Intelligence, Communications and Care. Considering a Services Approach for Data Quality Standardize Data Quality Capabilities for Increased Efficiency and Lower Overall Cost W H
More informationINTELLIGENT SYSTEMS OVER THE INTERNET
INTELLIGENT SYSTEMS OVER THE INTERNET Web-Based Intelligent Systems Intelligent systems use a Web-based architecture and friendly user interface Web-based intelligent systems: Use the Web as a platform
More informationAnalysis and Design with the Universal Design Pattern
Analysis and Design with the Universal Design Pattern by Koni Buhrer Software Engineering Specialist Rational Software Developing large software systems is notoriously difficult and unpredictable. Software
More informationVisual Layout of Graph-Like Models
Visual Layout of Graph-Like Models Tarek Sharbak MhdTarek.Sharbak@uantwerpen.be Abstract The modeling of complex software systems has been growing significantly in the last years, and it is proving to
More informationConcurrent & Distributed Systems Supervision Exercises
Concurrent & Distributed Systems Supervision Exercises Stephen Kell Stephen.Kell@cl.cam.ac.uk November 9, 2009 These exercises are intended to cover all the main points of understanding in the lecture
More informationAgent controlled traffic lights
Agent controlled traffic lights Danko A. Roozemond *, Jan L.H. Rogier ** * Delft University of Technology, Civil Engineering and Geosciences Stevinweg 1, 2628 CN, Delft, The Netherlands Phone: +31(0)15
More informationProgramming Languages
Programming Languages As difficult to discuss rationally as religion or politics. Prone to extreme statements devoid of data. Examples: "It is practically impossible to teach good programming to students
More informationExploring Factors Influencing Perceived Usefulness and Its Relationship on Hospital Information System End User Satisfaction
Exploring Factors Influencing Perceived Usefulness and Its Relationship on Hospital Information System End User Satisfaction MAYA ABDULLAH MAAMUOM, MUHAMMAD HAIKAL SATRIA, EKO SUPRIYANTO, JASMY YUNUS Advanced
More informationAutonomous Navigation in Unknown Environments via Language Grounding
Autonomous Navigation in Unknown Environments via Language Grounding Koushik (kbhavani) Aditya (avmandal) Sanjay (svnaraya) Mentor Jean Oh Introduction As robots become an integral part of various domains
More informationADVANCED SOFTWARE DESIGN LECTURE 4 SOFTWARE ARCHITECTURE
ADVANCED SOFTWARE DESIGN LECTURE 4 SOFTWARE ARCHITECTURE Dave Clarke 1 THIS LECTURE At the end of this lecture you will know notations for expressing software architecture the design principles of cohesion
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationObject-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur
Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur Lecture 06 Object-Oriented Analysis and Design Welcome
More informationAutonomic Computing. Pablo Chacin
Autonomic Computing Pablo Chacin Acknowledgements Some Slides taken from Manish Parashar and Omer Rana presentations Agenda Fundamentals Definitions Objectives Alternative approaches Examples Research
More informationKernel Korner AEM: A Scalable and Native Event Mechanism for Linux
Kernel Korner AEM: A Scalable and Native Event Mechanism for Linux Give your application the ability to register callbacks with the kernel. by Frédéric Rossi In a previous article [ An Event Mechanism
More informationAgent-Based Systems. Agent-Based Systems. Michael Rovatsos. Lecture 13 Argumentation in Multiagent Systems 1 / 18
Agent-Based Systems Michael Rovatsos mrovatso@inf.ed.ac.uk Lecture 13 Argumentation in Multiagent Systems 1 / 18 Where are we? Last time... Bargaining Alternating offers Negotiation decision functions
More informationFAQ: Database Development and Management
Question 1: Are normalization rules followed exclusively in the real world? Answer 1: Unfortunately, the answer to this question is no. Database design and development do not have hard and fast rules,
More informationBusiness Process Framework (etom)
Business Process Framework (etom) For The Information and Communications Services Industry Addendum W: Working Together: ITIL and etom GB921 Addendum W Version 11.2 October, 2011 TM Forum 2011 Notice No
More informationIntroduction to Software Engineering
Introduction to Software Engineering (CS350) Lecture 17 Jongmoon Baik Testing Conventional Applications 2 Testability Operability it operates cleanly Observability the results of each test case are readily
More informationRecommended Practice for Software Requirements Specifications (IEEE)
Recommended Practice for Software Requirements Specifications (IEEE) Author: John Doe Revision: 29/Dec/11 Abstract: The content and qualities of a good software requirements specification (SRS) are described
More informationDESIGN AS RISK MINIMIZATION
THOMAS LATOZA SWE 621 FALL 2018 DESIGN AS RISK MINIMIZATION IN CLASS EXERCISE As you come in and take a seat What were the most important risks you faced in a recent software project? WHAT IS A RISK? WHAT
More informationBy: Chaitanya Settaluri Devendra Kalia
By: Chaitanya Settaluri Devendra Kalia What is an embedded system? An embedded system Uses a controller to perform some function Is not perceived as a computer Software is used for features and flexibility
More informationTransaction Processing in a Mobile Computing Environment with Alternating Client Hosts *
Transaction Processing in a Mobile Computing Environment with Alternating Client Hosts * Sven Buchholz, Thomas Ziegert and Alexander Schill Department of Computer Science Dresden University of Technology
More informationA Distributed Multi-Agent Meeting Scheduler System
A Distributed Multi-Agent Meeting Scheduler System Ali Durmus, Nadia Erdogan Electrical-Electronics Faculty, Department of Computer Engineering Istanbul Technical University Ayazaga, 34469, Istanbul, Turkey.
More informationOpinion 02/2012 on facial recognition in online and mobile services
ARTICLE 29 DATA PROTECTION WORKING PARTY 00727/12/EN WP 192 Opinion 02/2012 on facial recognition in online and mobile services Adopted on 22 March 2012 This Working Party was set up under Article 29 of
More informationCOMP 388/441 HCI: 09 - Balancing Function and Fashion Balancing Function and Fashion
09 - Balancing Function and Fashion Lecture 09 - Overview This lecture deals with five design matters that are functional issues [...] but also leave room for varying styles to suite a variety of users.
More informationManaging Data Resources
Chapter 7 Managing Data Resources 7.1 2006 by Prentice Hall OBJECTIVES Describe basic file organization concepts and the problems of managing data resources in a traditional file environment Describe how
More information6.001 Notes: Section 8.1
6.001 Notes: Section 8.1 Slide 8.1.1 In this lecture we are going to introduce a new data type, specifically to deal with symbols. This may sound a bit odd, but if you step back, you may realize that everything
More informationPartially Observable Markov Decision Processes. Mausam (slides by Dieter Fox)
Partially Observable Markov Decision Processes Mausam (slides by Dieter Fox) Stochastic Planning: MDPs Static Environment Fully Observable Perfect What action next? Stochastic Instantaneous Percepts Actions
More informationThe Eight Rules of Security
The Eight Rules of Security The components of every security decision. Understanding and applying these rules builds a foundation for creating strong and formal practices through which we can make intelligent
More informationA Comparison of the Booch Method and Shlaer-Mellor OOA/RD
A Comparison of the Booch Method and Shlaer-Mellor OOA/RD Stephen J. Mellor Project Technology, Inc. 7400 N. Oracle Rd., Suite 365 Tucson Arizona 85704 520 544-2881 http://www.projtech.com 2 May 1993 The
More informationMulti-Agent Programming
Multi-Agent Programming Brian Logan 1 School of Computer Science University of Nottingham Midlands Graduate School 8th 12th April 2013 1 Slides on Normative Organisations are from an AAMAS 2012 tutorial
More informationSoftware Testing CS 408
Software Testing CS 408 1/09/18 Course Webpage: http://www.cs.purdue.edu/homes/suresh/408-spring2018 1 The Course Understand testing in the context of an Agile software development methodology - Detail
More informationBuilding Object-Agents from a Software Meta-Architecture
Building Object-Agents from a Software Meta-Architecture Analía Amandi and Ana Price Universidad Nac. del Centro de la Pcia. de Bs. As. - Fac. de Cs. Exactas - ISISTAN - San Martin 57 - (7000) Tandil -
More informationGoal-Based Agents Problem solving as search. Outline
Goal-Based Agents Problem solving as search Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/
More information