Title :
State space analysis on an AI problem with CPN model
Author :
Yao, Shaowen ; Zhou, Mingtian ; Zeng, Jiazhi
Author_Institution :
Dept. of Commun. & Electr. Eng., Yunnan Univ., Kunming, China
Abstract :
The travelling salesman problem, which can be solved with various methods, is a traditional and typical problem in artificial intelligence (AI). As an evolution of Petri nets, colored Petri nets (CPN) can be dedicated to modeling and analysis of different systems as a new attempt. The paper shows the brief description of the given problem and CPN, we detail the implementation of the CPN model of the problem and analyze the simulation result. This CPN example shows the potentiality of CPN application in AI
Keywords :
Petri nets; graph colouring; state-space methods; travelling salesman problems; artificial intelligence; colored Petri nets; state space analysis; travelling salesman problem; Analytical models; Application software; Artificial intelligence; Computational modeling; Computer science; Convergence; Learning systems; Logic; Petri nets; State-space methods;
Conference_Titel :
Signal Processing Proceedings, 2000. WCCC-ICSP 2000. 5th International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-5747-7
DOI :
10.1109/ICOSP.2000.893428
