REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS
This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced wit...
Gespeichert in:
| Veröffentlicht in: | Computational intelligence 2008-05, Vol.24 (2), p.77-107 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 107 |
|---|---|
| container_issue | 2 |
| container_start_page | 77 |
| container_title | Computational intelligence |
| container_volume | 24 |
| creator | Corchado, J. M. Glez-Bedia, M. De Paz, Y. Bajo, J. De Paz, J. F. |
| description | This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced with planning where constraint satisfaction problems (CSP) resources are limited and formulate, through variation techniques, a reasoning model agent to resolve them. The design of the agent proposed, named MRP‐Ag (most‐replanable agent), will be evaluated in different environments using a series of simulation experiments, comparing it with others such as E‐Ag (Efficient Agent) and O‐Ag (Optimum Agent). Last, the most important results will be summarized, and the notion of an adaptable agent will be introduced. |
| doi_str_mv | 10.1111/j.1467-8640.2008.00323.x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_34339446</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>34339446</sourcerecordid><originalsourceid>FETCH-LOGICAL-c4093-271482c7e248772034ec5c10116edc97de3ffee4cc894b78827d16c9ce8ea943</originalsourceid><addsrcrecordid>eNqNkLtOwzAUQC0EEqXwDxEDW4IdO34MDCGEYNG40EYgpqvgulJLoRBT0f49CUUdmPBiSz7n6uogFBAckfaczyPCuAglZziKMZYRxjSm0XoP9XYf-6iHZcxCoWhyiI68n2OMCWWyh8pRfjdIjdGmCMo8u0mNHpfB9XAUXOUDfZmP0ko_5EFa5KYaB9oEV08mLXUWdGjRWbl50KOhKTvgGB1M64V3J793H1XXeZXdhINhobN0EFqGFQ1jQZiMrXAxk0LEmDJnE0swIdxNrBITR6dT55i1UrFnIWUsJoRbZZ10tWK0j862Y9-b5cfK-U94nXnrFov6zS1XHiijVDHGW_D0Dzhfrpq3djUginHGpZQtJLeQbZbeN24K783stW42QDB0jWEOXUroUkLXGH4aw7pVL7bq12zhNv_2IBtq075aP9z6M__p1ju_bl6ACyoSeDQF3Bt8yy8zBQn9BjjAiRE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>194646888</pqid></control><display><type>article</type><title>REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS</title><source>EBSCOhost Business Source Complete</source><source>Access via Wiley Online Library</source><creator>Corchado, J. M. ; Glez-Bedia, M. ; De Paz, Y. ; Bajo, J. ; De Paz, J. F.</creator><creatorcontrib>Corchado, J. M. ; Glez-Bedia, M. ; De Paz, Y. ; Bajo, J. ; De Paz, J. F.</creatorcontrib><description>This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced with planning where constraint satisfaction problems (CSP) resources are limited and formulate, through variation techniques, a reasoning model agent to resolve them. The design of the agent proposed, named MRP‐Ag (most‐replanable agent), will be evaluated in different environments using a series of simulation experiments, comparing it with others such as E‐Ag (Efficient Agent) and O‐Ag (Optimum Agent). Last, the most important results will be summarized, and the notion of an adaptable agent will be introduced.</description><identifier>ISSN: 0824-7935</identifier><identifier>EISSN: 1467-8640</identifier><identifier>EISSN: 0824-7935</identifier><identifier>DOI: 10.1111/j.1467-8640.2008.00323.x</identifier><language>eng</language><publisher>Malden, USA: Blackwell Publishing Inc</publisher><subject>case-based reasoning ; Computer programming ; deliberative agents ; execution time ; Intelligent agents ; Studies</subject><ispartof>Computational intelligence, 2008-05, Vol.24 (2), p.77-107</ispartof><rights>2008 Blackwell Publishing</rights><rights>Computational Intelligence ©2008 Blackwell Publishing</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c4093-271482c7e248772034ec5c10116edc97de3ffee4cc894b78827d16c9ce8ea943</citedby><cites>FETCH-LOGICAL-c4093-271482c7e248772034ec5c10116edc97de3ffee4cc894b78827d16c9ce8ea943</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fj.1467-8640.2008.00323.x$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fj.1467-8640.2008.00323.x$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Corchado, J. M.</creatorcontrib><creatorcontrib>Glez-Bedia, M.</creatorcontrib><creatorcontrib>De Paz, Y.</creatorcontrib><creatorcontrib>Bajo, J.</creatorcontrib><creatorcontrib>De Paz, J. F.</creatorcontrib><title>REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS</title><title>Computational intelligence</title><description>This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced with planning where constraint satisfaction problems (CSP) resources are limited and formulate, through variation techniques, a reasoning model agent to resolve them. The design of the agent proposed, named MRP‐Ag (most‐replanable agent), will be evaluated in different environments using a series of simulation experiments, comparing it with others such as E‐Ag (Efficient Agent) and O‐Ag (Optimum Agent). Last, the most important results will be summarized, and the notion of an adaptable agent will be introduced.</description><subject>case-based reasoning</subject><subject>Computer programming</subject><subject>deliberative agents</subject><subject>execution time</subject><subject>Intelligent agents</subject><subject>Studies</subject><issn>0824-7935</issn><issn>1467-8640</issn><issn>0824-7935</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNqNkLtOwzAUQC0EEqXwDxEDW4IdO34MDCGEYNG40EYgpqvgulJLoRBT0f49CUUdmPBiSz7n6uogFBAckfaczyPCuAglZziKMZYRxjSm0XoP9XYf-6iHZcxCoWhyiI68n2OMCWWyh8pRfjdIjdGmCMo8u0mNHpfB9XAUXOUDfZmP0ko_5EFa5KYaB9oEV08mLXUWdGjRWbl50KOhKTvgGB1M64V3J793H1XXeZXdhINhobN0EFqGFQ1jQZiMrXAxk0LEmDJnE0swIdxNrBITR6dT55i1UrFnIWUsJoRbZZ10tWK0j862Y9-b5cfK-U94nXnrFov6zS1XHiijVDHGW_D0Dzhfrpq3djUginHGpZQtJLeQbZbeN24K783stW42QDB0jWEOXUroUkLXGH4aw7pVL7bq12zhNv_2IBtq075aP9z6M__p1ju_bl6ACyoSeDQF3Bt8yy8zBQn9BjjAiRE</recordid><startdate>200805</startdate><enddate>200805</enddate><creator>Corchado, J. M.</creator><creator>Glez-Bedia, M.</creator><creator>De Paz, Y.</creator><creator>Bajo, J.</creator><creator>De Paz, J. F.</creator><general>Blackwell Publishing Inc</general><general>Blackwell Publishing Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200805</creationdate><title>REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS</title><author>Corchado, J. M. ; Glez-Bedia, M. ; De Paz, Y. ; Bajo, J. ; De Paz, J. F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c4093-271482c7e248772034ec5c10116edc97de3ffee4cc894b78827d16c9ce8ea943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>case-based reasoning</topic><topic>Computer programming</topic><topic>deliberative agents</topic><topic>execution time</topic><topic>Intelligent agents</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Corchado, J. M.</creatorcontrib><creatorcontrib>Glez-Bedia, M.</creatorcontrib><creatorcontrib>De Paz, Y.</creatorcontrib><creatorcontrib>Bajo, J.</creatorcontrib><creatorcontrib>De Paz, J. F.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computational intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Corchado, J. M.</au><au>Glez-Bedia, M.</au><au>De Paz, Y.</au><au>Bajo, J.</au><au>De Paz, J. F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS</atitle><jtitle>Computational intelligence</jtitle><date>2008-05</date><risdate>2008</risdate><volume>24</volume><issue>2</issue><spage>77</spage><epage>107</epage><pages>77-107</pages><issn>0824-7935</issn><eissn>1467-8640</eissn><eissn>0824-7935</eissn><abstract>This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced with planning where constraint satisfaction problems (CSP) resources are limited and formulate, through variation techniques, a reasoning model agent to resolve them. The design of the agent proposed, named MRP‐Ag (most‐replanable agent), will be evaluated in different environments using a series of simulation experiments, comparing it with others such as E‐Ag (Efficient Agent) and O‐Ag (Optimum Agent). Last, the most important results will be summarized, and the notion of an adaptable agent will be introduced.</abstract><cop>Malden, USA</cop><pub>Blackwell Publishing Inc</pub><doi>10.1111/j.1467-8640.2008.00323.x</doi><tpages>31</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0824-7935 |
| ispartof | Computational intelligence, 2008-05, Vol.24 (2), p.77-107 |
| issn | 0824-7935 1467-8640 0824-7935 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_34339446 |
| source | EBSCOhost Business Source Complete; Access via Wiley Online Library |
| subjects | case-based reasoning Computer programming deliberative agents execution time Intelligent agents Studies |
| title | REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T00%3A07%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=REPLANNING%20MECHANISM%20FOR%20DELIBERATIVE%20AGENTS%20IN%20DYNAMIC%20CHANGING%20ENVIRONMENTS&rft.jtitle=Computational%20intelligence&rft.au=Corchado,%20J.%20M.&rft.date=2008-05&rft.volume=24&rft.issue=2&rft.spage=77&rft.epage=107&rft.pages=77-107&rft.issn=0824-7935&rft.eissn=1467-8640&rft_id=info:doi/10.1111/j.1467-8640.2008.00323.x&rft_dat=%3Cproquest_cross%3E34339446%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=194646888&rft_id=info:pmid/&rfr_iscdi=true |