|
|
|
|
LEADER |
02867nam a22004935i 4500 |
001 |
978-1-4614-1472-8 |
003 |
DE-He213 |
005 |
20130726165232.0 |
007 |
cr nn 008mamaa |
008 |
110915s2011 xxu| s |||| 0|eng d |
020 |
|
|
|a 9781461414728
|9 978-1-4614-1472-8
|
024 |
7 |
|
|a 10.1007/978-1-4614-1472-8
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
050 |
|
4 |
|a TJ210.2-211.495
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a TJFM1
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Simari, Gerardo I.
|e author.
|
245 |
1 |
0 |
|a Markov Decision Processes and the Belief-Desire-Intention Model
|h [electronic resource] :
|b Bridging the Gap for Autonomous Agents /
|c by Gerardo I. Simari, Simon D. Parsons.
|
264 |
|
1 |
|a New York, NY :
|b Springer New York,
|c 2011.
|
300 |
|
|
|a VIII, 63p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a SpringerBriefs in Computer Science,
|x 2191-5768
|
505 |
0 |
|
|a Introduction -- Preliminary Concepts -- An Empirical Comparison of Models -- A Theoretical Comparison of Models -- Related Work. Conclusions, Limitations, and Future Directions.
|
520 |
|
|
|a In this work, we provide a treatment of the relationship between two models that have been widely used in the implementation of autonomous agents: the Belief DesireIntention (BDI) model and Markov Decision Processes (MDPs). We start with an informal description of the relationship, identifying the common features of the two approaches and the differences between them. Then we hone our understanding of these differences through an empirical analysis of the performance of both models on the TileWorld testbed. This allows us to show that even though the MDP model displays consistently better behavior than the BDI model for small worlds, this is not the case when the world becomes large and the MDP model cannot be solved exactly. Finally we present a theoretical analysis of the relationship between the two approaches, identifying mappings that allow us to extract a set of intentions from a policy (a solution to an MDP), and to extract a policy from a set of intentions.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Computer simulation.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Simulation and Modeling.
|
700 |
1 |
|
|a Parsons, Simon D.
|e author.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9781461414711
|
830 |
|
0 |
|a SpringerBriefs in Computer Science,
|x 2191-5768
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-1-4614-1472-8
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
950 |
|
|
|a Computer Science (Springer-11645)
|