Evaluating Coverage Based Intention Selection Max Waters, Lin Padgham and Sebastian Sardina

RMIT University, Melbourne, Australia

Overview •

This paper tackles intention selection in BDI agents



A selection mechanism based on goal coverage was proposed at AAMAS in 20121



This work implements and empirically evaluates it



Analysis of results reveals a powerful selection mechanism based on the idea of progressability

[1] J. Thangarajah, S. Sardina, and L. Padgham. Measuring plan coverage and overlap for agent reasoning. In Proc. of Autonomous Agents and Multi-Agent Systems (AAMAS), pages 1049–1056, 2012

BDI Agents Events Prompt a response from the agent Plans A strategy to respond to an event, of the form: e: cc  p Coverage of event % of states with plans available Intentions Committed strategies

BDI Agents Events Prompt a response from the agent Plans A strategy to respond to an event, of the form: e: cc  p Coverage of event % of states with plans available Intentions Committed strategies

How to provide infrastructure support for intelligent intention selection?

Intention selection Intention selection • How to choose which intention to progress next? • Issues: intention interference and unexpected changes • Objective: maximize successfully executed intentions Existing approaches • Simple: first-in-first-out (FIFO) and round-robin (RR) • Meta-level programming • Domain info: priorities, deadlines, dependencies, Challenge: intelligent, domain-independent intention selection

Using coverage for domainindependent intention selection Coverage-based selection was proposed in AAMAS 2012 Opportunistically execute the most vulnerable intention • Vulnerability is measured through coverage Coverage of a goal: % of states with plans available Lower the coverage  more vulnerable intention Calculating coverage • Calculated from plans’ context conditions • Can be calculated off-line before execution, and without extra information from the programmer

Coverage-based scheduling C1: a variation on the AAMAS 2012 proposal • Select the progressable intention with the lowest coverage • Progressable: has an applicable plan • Pre-emptive: change focus if necessary • All are unprogressable? Failure recovery C1 is compared experimentally with FIFO and RR under different levels of coverage and environmental dynamism

Experimental setup Agent with ten concurrent intentions in a dynamic environment Automated test generation •Simple binary structure allows for bulk generation of test cases Preparatory effects A plan brings about a condition which is required by a later plan Coverage gaps •Remove a branch •Add p-effect to parent plan •Change probability of proposition to alter gap size

Experimental setup Agent with ten concurrent intentions in a dynamic environment Automated test generation •Simple binary structure allows for bulk generation of test cases Preparatory effects A plan brings about a condition which is required by a later plan Coverage gaps •Remove a branch •Add p-effect to parent plan •Change probability of proposition to alter gap size

Experimental setup The dynamic environment • Dynamism rate – 0 <= d <= 1 • At each step, the variables referred to by context conditions are re-sampled with probability d Test runs  Comparison of C1, FIFO, 1-step RR  100,000 test runs for each algorithm  Each test run has a randomly selected dynamism and coverage  For each test run, the proportion of successfully executed intentions is recorded (success rate)

Coverage results

• • • •

On average, C1 improves on FIFO by 13pp, RR by 24.5pp Never detrimental to the success rate Most benefit when environment is dynamic and goals have low coverage Low coverage and high dynamism: • C1 improves on FIFO by up to 60pp • C1 improves RR by up to 62pp

Coverage results

RR’s switching makes it prone to failure even in low dynamism environments

• • • •

On average, C1 improves on FIFO by 13pp, RR by 24.5pp Never detrimental to the success rate Most benefit when environment is dynamic and goals have low coverage Low coverage and high dynamism: • C1 improves on FIFO by up to 60pp • C1 improves RR by up to 62pp

Coverage results

60pp

• • • •

62pp

On average, C1 improves on FIFO by 13pp, RR by 24.5pp Never detrimental to the success rate Most benefit when environment is dynamic and goals have low coverage Low coverage and high dynamism: • C1 improves on FIFO by up to 60pp • C1 improves RR by up to 62pp

Progressability C1 has two key features: 1. Prioritizing by coverage 2. Progressability checking Two questions: 1. How much success is due to coverage prioritization, and how much is due to progressability checking? 2. Can progressability checking improve FIFO or RR? FIFOLA and RRLA: variations of FIFO and RR which change focus when an intention becomes unprogressable

Progressability results

• Overall: • FIFOLA improves on FIFO by 12pp • RRLA improves on RR by 18pp • Benefit of 5pp even with high coverage and low dynamism • With low coverage and high dynamism: • FIFOLA improves on FIFO by up to 48pp • RRLA improves on RR by up to 40pp

Progressability results

• Overall: • FIFOLA improves on FIFO by 12pp • RRLA improves on RR by 18pp • Benefit of 5pp even with high coverage and low dynamism • With low coverage and high dynamism: • FIFOLA improves on FIFO by up to 48pp • RRLA improves on RR by up to 40pp

Progressability results

48pp • Overall: • FIFOLA improves on FIFO by 12pp • RRLA improves on RR by 18pp • Benefit of 5pp even with high coverage and low dynamism • With low coverage and high dynamism: • FIFOLA improves on FIFO by up to 48pp • RRLA improves on RR by up to 40pp

40pp

Further benefit of coverage

• • • •

On average, C1 improves on FIFOLA by 1.2pp, and RRLA by 5.3pp Most improvement over FIFOLA in low-coverage, high-dynamism tests Most Improvement over RRLA in low-coverage tests Improves RR even in low dynamism environments

Further benefit of coverage

• • • •

On average, C1 improves on FIFOLA by 1.2pp, and RRLA by 5.3pp Most improvement over FIFOLA in low-coverage, high-dynamism tests Most improvement over RRLA in low-coverage tests Improves RR even in low dynamism environments

Further benefit of coverage

• • • •

On average, C1 improves on FIFOLA by 1.2pp, and RRLA by 5.3pp Most improvement over FIFOLA in low-coverage, high-dynamism tests Most improvement over RRLA in low-coverage tests Improves RR even in low dynamism environments

Conclusions Progressability ✓ Very easily implemented ✓ Increases the success rate ✗ Introduces pauses in execution ✗ Postpones failure recovery mechanisms  Use in conjunction with (e.g.) priorities Coverage ✓ An effective priority measure when goal coverage is low and the environment is unpredictable ✓ Standard BDI languages have information needed to implement ✗ Not trivial to implement

Further work Further work  Experimentation on more 'realistic' goal-plan trees 



Hybrid intention selection mechanisms  Combine progressability with check for failure recovery Further uses for coverage  Prioritize by expected gain in coverage

Evaluating Coverage Based Intention Selection

Agent with ten concurrent intentions in a dynamic environment. Automated test generation. •Simple binary structure allows for bulk generation of test cases.

741KB Sizes 2 Downloads 148 Views

Recommend Documents

Differences Between Intention-Based and Stimulus-Based Actions
in evenly timed sequences of visually-presented pacing sig- nals. The signals ..... of cortical activity, the present data also bear on the neural circuitry for visuo-.

Differences Between Intention-Based and Stimulus-Based Actions
A view that has found considerable support in this re- search is the ideo-motor ..... electrode pair FC3/FC4 between 230 ms and 360 ms after stimulus onset.

Improving Domain-Independent Intention Selection in ...
agents have, at any point in time, a set of intentions encoding the various ..... FIFO would by selecting (and applying failure recovery to) the intention at the ...... Dynamism. Co verage. (b) RRE − RR. Fig. 4 The change in success rate due to ...

Employment-Based Health Coverage Levels Hold Steady
Jun 20, 2013 - @EBRI or http://twitter.com/EBRI ... past decade—but your coverage odds are much better if you work for a ... does not lobby and does not take.

Employment-Based Health Coverage Levels Hold Steady
Jun 20, 2013 - EBRI blog: https://ebriorg.wordpress.com/. Sign up for our RSS feeds! © 2013, Employee Benefit Research Institute, 1100 13th St. NW, ...

Evaluating Content Based Image Retrieval Techniques ... - CiteSeerX
(“Mountain” class); right: a transformed image (negative transformation) in the testbed ... Some images from classes of the kernel of CLIC ... computer science.

Evaluating Embeddings using Syntax-based ...
Most evaluations for vector space models are semantically motivated, e.g. by mea- suring how well they capture word similar- ity. If one is interested in syntax-related downstream applications such as depen- dency parsing, a syntactically motivated e

Reconsidering Mutual Information Based Feature Selection: A ...
Abstract. Mutual information (MI) based approaches are a popu- lar feature selection paradigm. Although the stated goal of MI-based feature selection is to identify a subset of features that share the highest mutual information with the class variabl

Mesh-Based Sensor Relocation for Coverage ...
are not displayed; proxy nodes are represented by big colorful dots, and their ..... A-node, as servers, send four query messages respectively to the north, the ... protocols, every relocating node transfers all its local data to the newcomer at.

Carrier-based Coverage Augmentation in Wireless ...
At the end o the paper, we propose an optimization technique to reduce augmentation delay and save robot energy. I. INTRODUCTION. Wireless sensor networks (WSN) consist of a large number of small sensing and computational devices, called sensors, whi

Coverage-driven Self-deployment for Cluster Based ...
Coverage-driven Self-deployment for Cluster Based Mobile Sensor Networks. Xiaoling ... Department of Computer Engineering, Kyung Hee University, Korea.

SNP-based soybean variety selection
nized that we are at risk of underestimation of the model precision since in that case, we .... 29–36. https://doi.org/10.1148/radiology.143.1.7063747 ... Evaluation of the chemical quality traits of soybean seeds, as related to sensory ... [21] De

Personality-based selection Commentary on
“Reconsidering the Use of Personality Tests in Personnel Selection Contexts”: ... analytic research findings regarding the validity of personality-based assessments, and ... worked for a Fortune 500 company to develop large scale ... be driven pr

Oracle-Based Regression Test Selection
test suite for a system, test cases that are relevant to a modified version of that .... Test execution with respect to a data-based oracle involves checking the state of ...... introduce a firewall technique that selects integration tests based on m

Carrier-Based Focused Coverage Formation in Wireless Sensor and ...
Oct 5, 2011 - Abstract—Carrier-based sensor placement involves mobile robots carrying and dropping (static) sensors for optimal coverage formation.

Carrier-based Coverage Augmentation in Wireless ... - Semantic Scholar
As soon as they get in touch with already deployed sensors, they search (by communication) along the network border for best sensor placement points with respect ..... maintains a toke which is initially equal to its unique ID and flooded in the netw

Evaluating the harmfulness of cloning: a change based ...
software maintenance because it requires consistent changes of ... change of applications containing clones. ... all fragments, of which the developer may not be.

Evaluating Fuzzy Clustering for Relevance-based ...
meaningful groups [3]. Our motivation for using document clustering techniques is to enable ... III, the performance evaluation measures that have been used.

Span-Program-Based Quantum Algorithm for Evaluating Formulas
Jul 7, 2012 - Abstract: We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e. g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's input

A wavelet-based quality measure for evaluating the ...
In fact, without a. Further author information: (Send correspondence to Dr. Vladimir Buntilov) ... 6255, Fax: +66 (2) 889-2138 ext. 6268. ..... component PC1 of the decorrelated MS bands was replaced by its sharpened counterpart PC∗. 1 .

Evaluating the Survivability of SOA Systems based on ...
Abstract. Survivability is a crucial property for computer systems ... Quality of Service (QoS) property. ... services make it difficult to precisely model SOA systems.

Evaluating the Survivability of SOA Systems based on ...
While SOA advances the software development as well as the resulting systems, the new ... building dynamic systems more adaptive to varying envi- ronments.