Rede de planos: uma proposta para a solução de problemas de planejamento em inteligência artificial usando redes de Petri
This thesis dissertation reports on the investigation of the relationships between the problems of planning, in the sense of Artificial Intelligence, and that of reachability, in the sense of Petri nets. The research approaches different ways to represent a planning problem as a Petri net, as well a...
| Autor principal: | Silva, Fabiano |
|---|---|
| Formato: | Tese |
| Idioma: | Português |
| Publicado em: |
Centro Federal de Educação Tecnológica do Paraná
2010
|
| Assuntos: | |
| Acesso em linha: |
http://repositorio.utfpr.edu.br/jspui/handle/1/84 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| Resumo: |
This thesis dissertation reports on the investigation of the relationships between the problems of planning, in the sense of Artificial Intelligence, and that of reachability, in the sense of Petri nets. The research approaches different ways to represent a planning problem as a Petri net, as well as the comparison of the given net with the plan graph. The main advantages and disadvantages in applying Petri nets compared to the plan graph method. We claim that, the use of Petri nets allows more precise and compact representation of action relationships than those obtained with the counter part method. One of the main research aims is to eliminate representational redundancies of the plan graph by projecting them against the dynamic aspects of the net. Examples of the comparative improvements are shown in the text, particularly for the relationships of inconsistency and the mutual exclusion of actions. |
|---|