• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Genetic algorithms as a feasible re-planning mechanism for Beliefs-Desires-Intentions agents

Shaw, G. 05 1900 (has links)
The BDI agent architecture includes a plan library containing pre-de ned plans. The plan library is included in the agent architecture to reduce the need for expensive means-end reasoning, however can hinder the agent's e ectiveness when operating in a changing environment. Existing research on integrating di erent planning methods into the BDI agent to overcome this limitation include HTNs, state-space planning and Graphplan. Genetic Algorithms (GAs) have not yet been used for this purpose. This dissertation investigates the feasibility of using GAs as a plan modi cation mechanism for BDI agents. It covers the design of a plan structure that can be encoded into a binary string, which can be operated on by the genetic operators. The e ectiveness of the agent in a changing environment is compared to an agent without the GA plan modification mechanism. The dissertation shows that GAs are a feasible plan modification mechanism for BDI agents. / Information Science
2

Genetic algorithms as a feasible re-planning mechanism for Beliefs-Desires-Intentions agents

Shaw, G. 05 1900 (has links)
The BDI agent architecture includes a plan library containing pre-defined plans. The plan library is included in the agent architecture to reduce the need for expensive means-end reasoning, however can hinder the agent’s effectiveness when operating in a changing environment. Existing research on integrating different planning methods into the BDI agent to overcome this limitation include HTNs, state-space planning and Graphplan. Genetic Algorithms (GAs) have not yet been used for this purpose. This dissertation investigates the feasibility of using GAs as a plan modification mechanism for BDI agents. It covers the design of a plan structure that can be encoded into a binary string, which can be operated on by the genetic operators. The effectiveness of the agent in a changing environment is compared to an agent without the GA plan modification mechanism. The dissertation shows that GAs are a feasible plan modification mechanism for BDI agents. / Information Science

Page generated in 0.0089 seconds